Jump to content
  • Advertisement
Sign in to follow this  
Gink

Prime Proofs

This topic is 4815 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Can anyone suggest the best way to prove/disprove that an equation is prime without using mathematical induction(For all int > 1)?

Share this post


Link to post
Share on other sites
Advertisement
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

Share this post


Link to post
Share on other sites
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.

Share this post


Link to post
Share on other sites
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

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!