Psuedo Euler's Challenge

[Conan Edogawa 837]

Hi DCC Programmers

I would like to present my 5 programming problems, which will be a Psuedo-Euler project's questions(if you don't know what the Euler Project is and what it does, you should search it.)

Without further ado...

1. Find the first 10 digit prime number found in CONSECUTIVE digits of e.

 

2. 

Sue is a coordinator for UPS, and she's planning out tomorrow's route. Her next assignment is a truck in New York City, which must make 99 deliveries while driving on the rectangular grid of the city's streets.

If the coordinates the driver must reach are found in this list(measured in block lengths), which of the following is the closest to the minimum distance the truck will need to travel (in blocks)?

3.

Flap sends you a secret message hidden within a string of nonsense. You know that the real message is periodic within the garbage and that he's partial to the number three.

Find Flap's hidden message to you by taking periodic substrings.

panthas_message = "Tkxhwbiscscu vfbmwlgzirlsnysqr"

4. 

Your friend has written a program to check whether or not a number is prime. It is very simple and works by checking if n is divisible by each number from 2 all the way to n-1. When you see this, you curse your friend and tell him he's wasting time.

If your friend didn't want to waste time, what is (approximately) the biggest number that he needs to check before he can determine that any number n is prime?

5.

 

You have in your wallet $300, which you want to spend completely. You decide to spend all of it by buying food from a fancy restaurant with the following menu:

    tofu scramble: $1
    pancakes: $5
    brunch combo: $20
    saffron infused peach tea: $50
    truffles: $100
    caviar: $200

Let Z  be the number of different ways that you can spend exactly $300. What are the last 3 digits of  Z?

Edited June 27, 2016 by Centripetal Force

[Shawnic 2,977]

Great idea. 

Do we post our answers here? 

[Conan Edogawa 837]

43 minutes ago, Master Flap said:

Great idea. 

Do we post our answers here? 

in a PM