UNSOLVED PROBLEMS

In Number Theory, Logic, and Cryptography

Beal Conjecture

 

The banker and poker player Andrew Beal has conjectured that there are no solutions to the equation

a^x + b^y = c^z

if a, b, and c are co-prime integers, and x, y, and z are all integers > 2.

 

The problem is to prove the Beal Conjecture, or find a counter-example.

 

For further information, please see:

[1] http://www.bealconjecture.com/

[2]  http://norvig.com/beal.html

[3]  http://en.wikipedia.org/wiki/Beal's_conjecture

 

There are contributions to this problem on the solutions page.

 

——————————–-

This web site developed and maintained by

Tim S Roberts

Email: timro21@gmail.com