Jump to content
  • Advertisement
Sign in to follow this  
Gink

Math Riddle # 2

This topic is 4812 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

Advertisement
Oh come on, cut people a little slack. Most people will not know what Fermat's last theorem is! You should have short brainteasers or stuff.

For people who want to have a go:

an + bn = cn has no solutions in positive integers a, b, c for n > 2

Share this post


Link to post
Share on other sites
Uh, I'm working on one Ph.D. at the moment, I don't really have time to start another. [smile]

Besides, I thought we finally have a proof for Fermat's Last Theorem.

Share this post


Link to post
Share on other sites
Quote:
Original post by Gink
Disprove Fermats Last Theoreom


Who does not know the theorem (and the math behind) can not desprove it.
Who knows the theorem and its history will not make an attempt to resolve it (again). Especially on a game forum.

Share this post


Link to post
Share on other sites
Quote:
Original post by blizzard999
Why have you posted as anonymous ??? I would rate you ++++.
[grin]

BTW, Gink, look I may not be speaking for everyone else, but I would be really interested to know what you have got, how you are going about disproving FLT. I honestly don't have time to give it a think now (Biology test day after tomorrow [disturbed]), but I like this kind of stuff. If you don't want to post, please keep it in mind to give me a PM.

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!