Recently riding my motorcycle on highway 101, south of San Francisco I've noticed big advertisement poster: (I stole the picture from some later post in spanish who also found the number. When I worked on this, google search did not find any results for this puzzle). Out of curiosity I decided to find out what it is. Since I am still learning Haskell, I decided that that would be nice Haskell exercise. It was nice exercise indeed, in course of which I have learned more about Haskell and things like RabinMiller Probable Prime Test and Spigot Algorithm Well, I did it and was able to find number. I went to the site, expecting something exiting, but it just says "Congratulations. You've made it to level 2" and offers next puzzle. Frankly, without knowing what it is about (I guess this is a new way to screen employees) I am not very inclined to spend more time solving their puzzles. Also, the next puzzle they offer is of kind I detest: trying to find next number in sequence. I hate when people ask something like this on interviews. So, being dissapointed for being sent to wild goose chanse without any gratification, I decided to share the answer to their first problem. I hope search engines pick up this page soon and they will have more potential candidates knocking on the door of their second level. The prime they were asking for is 7427466391. I will apprecite if somebody who will get through all their puzzles will tell me what it was about. UPDATE (September 2004): I would like to thank all of you who took their time to let me know that this is Google recruitment campaign. After solving second part of the puzzle I was able to see that for myself. So if you are looking for the answers: your got them right here. You are welcome to read the rest of my blog (or even subscribe to new posts with RSS).


It's a job recruitment campaign from google. It's kind of subtle, but you can read about it here. 
On September 21st, 2004 04:27 am (UTC), (Anonymous) commented: Some questions of a slighly different nature showed up in several technical magazines. A list of the questions is available here: http://daga.dyndns.org/computers/glat.php 
On January 16th, 2006 05:54 am (UTC), (Anonymous) commented: Hi, I read on some other website that the smallest 10digit prime is 1,000,000,007. Why is this is the smallest 10digit prime? Wouldn't the smallest 10digit prime be 1,000,000,002? Thank you. Sean On February 14th, 2006 11:30 pm (UTC), (Anonymous) replied: Someone needs to work on their English comprehension skills. On February 15th, 2006 01:16 am (UTC), (Anonymous) replied: Wow Sean, it looks like someone needs a crash course in math. 1,000,000,002 has the factors 2, 3, 43, 983, 3943. Since it has factors other then 1 and itself, it can't be prime. According to your logic, 12 would also be a prime number which it's not but 17 is. On March 14th, 2006 04:18 pm (UTC), (Anonymous) replied: are you retarded???? any number divisable by two is not prime, just because it is divisiable by two. On February 18th, 2008 12:18 am (UTC), (Anonymous) replied: 1,000,000,002 is divisible by 2 and therefore not prime. 
On March 14th, 2006 04:17 pm (UTC), (Anonymous) commented: hey this is a test by google... if you finish all the tests yu will be hired no the spot for a 100k job. No joke. On March 24th, 2006 03:18 pm (UTC), (Anonymous) replied: Sorry guys! Google has already abandoned the campaign related to this billboard, and yes, the website is down. Hint... Wait for the next sign. Google Rep. (Aka. Larry...) 
On February 3rd, 2007 08:18 pm (UTC), (Anonymous) commented: Your article is very informative and helped me further. Thanks, David 
On December 15th, 2007 12:52 pm (UTC), (Anonymous) commented: very interesting, but I don't agree with you Idetrorce 