Prime Proofs

Check out this thread. Not quite sure if this is what you wanted. It’s about computing all the primes from 1 to n where n can be as much as 2^32

http://www.gamedev.net/community/forums/topic.asp?topic_id=329905

Thanks for the link, but I already wrote my own program and solved it but I havent been able to really disprove it. Not sure how I would do this because the equation can contain a variable that can be any number really.. no clue how to approach it without using something like induction.

Quote:

Original post by Gink Thanks for the link, but I already wrote my own program and solved it but I havent been able to really disprove it. Not sure how I would do this because the equation can contain a variable that can be any number really.. no clue how to approach it without using something like induction.

Here is a link to the wikipedia that may give you some ideas about how to proceed.


-Josh