ASCII Code

[padillah]

Originally posted by Kuciwalker
My point was that it was less impressive than the Google one. The problem is trivial compared to the Google billboard. (Both are fairly easy.)

Well, if they're both easy then what's the solution to the google one?

Tom P.
(mostly cause I'm so bad at math I'm not even sure I understand the question)

[Kuciwalker]

Some ten-digit number. It takes all of a minute to write a program to find it.

[Asmodean]

Here it is

[Solver]

Yeah, the Google one was much better. It actually took some non-trivial programming. The ASCII one doesn't even require any programming skills to figure out, I have an ASCII character map somewhere in an ancient MS Word reference, not to mention online resources.

[Asmodean]

How would you actually go about this. First calculate e with a gazillion digits, then store it in a variable (can variables even hold that many digits???) and then start from the first digit, and checking if that sequence of 10 digits is a prime, and if not, move 1 digit further and recheck?

Asmodean

[Asher]

Originally posted by Asmodean
How would you actually go about this. First calculate e with a gazillion digits, then store it in a variable (can variables even hold that many digits???) and then start from the first digit, and checking if that sequence of 10 digits is a prime, and if not, move 1 digit further and recheck?

Asmodean

I would start with querying Google's registered domains.

[Asmodean]

Okay....how would anyone BUT Asher do this?

Asmodean

[Asher]

Think outside the box...isn't that what they want?

I'm not sure they'd be interested in the people who always just solve the problem as they're told, but to find a more efficient solution to the problem...

[Asmodean]

Okay...let's look at it in that context then.

Is a query such as the one you are proposing even possible.

(I assume you would be querying for numerical web adresses with 10 digits)

Asmodean

Edit: Okay...I get it now....you would be querying for domains registered by Google

Asmodean

[Provost Harrison]

I can roughly conceive, but it would require a decent computer quite a while to crunch all the way through I suspect

[Provost Harrison]

However, there can't be that many 10-digit primes (maybe?) - just type them all in and see which brings up a result

[Provost Harrison]

...if you're a quick typist maybe

[Kuciwalker]

Originally posted by Asmodean
How would you actually go about this. First calculate e with a gazillion digits, then store it in a variable (can variables even hold that many digits???) and then start from the first digit, and checking if that sequence of 10 digits is a prime, and if not, move 1 digit further and recheck?

Essentially. Except as I noted you can't use a naive check; instead, you have to use a method that is likely to produce the right answer, but not guaranteed.

[Kuciwalker]

Originally posted by Provost Harrison
However, there can't be that many 10-digit primes (maybe?) - just type them all in and see which brings up a result

Yes, yes there are.

[Provost Harrison]

Originally posted by Kuciwalker


Yes, yes there are.

I was...you know...joking