Main post link -> http://newsfeed.time.com/2013/06/11/solve-this-math-problem-win-a-million-bucks/?hpt=hp_t3

We know many of you are into Fermat's last theorem and thought you might be interested in the Beal Conjecture as well. Expanding the frontier of number theory probably isn't the easiest way to make a million bucks, or even the best reason to work on that kind of problem. That is an impressive prize though, here is the prize page from the American Mathematical Society.

No vote yet

17 votes

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestThere are 6(originally 7) unsolved conjectures known as the millennium prize problems and for solving each,the Clay Mathematical Institution offers a million bucks.The Poincare Conjecture is the only one that has been proved.

Log in to reply

Comment deleted Jun 15, 2013

Log in to reply

what if gcd(a,b) is 1?

Log in to reply

Comment deleted 5 months ago

Log in to reply

Log in to reply

Wait maybe we can use fermat's little theorem to turn it into a more simpler problem..

Log in to reply

Maybe Fermat proved his last theorem using the Beal equation? (see if you can find out how)

Log in to reply

thanks a lot for giving such a great problem i'll surely give it a try

Log in to reply

Comment deleted Jun 14, 2013

Log in to reply

If \(A\) and \(B\) are primes\(\neq 2\), \(C\) will always be an even number \(>2\) and thus cannot be prime.

Similarly play around with the equation and it will be apparent that the equation will not hold for set of primes.

Log in to reply

Comment deleted Jun 14, 2013

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Comment deleted Jun 15, 2013

Log in to reply

Log in to reply

just read how technical the proof of fermats last theorem by andrew willes first before someone considers your boring proof!!!

Log in to reply