My Weblog

Blog about programming and math

Project Euler 200

The problem itself is self explanatory and brute is enough is solve the problem.I was not suru for upper bound on 200th number so my blind guess was it should be less 10^18 :).Then i keep running the program till i found that bound is 10^12. You generate all the primes below 10^6 . Calculate p^2*q^3 find out that it contains a substring “200”.If it contains then simply replace every single digit by 0 to 9 and check for primality.Here is half answer 🙂 i relpace 6 digits of answer by *.



June 28, 2009 - Posted by | Uncategorized

No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: