Beal's Conjecture: A^x +B^y = C^z. Where A, B, C, x, y, z are positive integers and x, y, z are all greater than 2, then A, B, C, must have a common prime factor. Can someone solve this or come up with a counter example?
1 Answer
Mar 15, 2018
If they can, then there's a prize.
Explanation:
There is a $1 million prize for an solution to this question, which is a similar level of difficulty to "Fermat's Last Theorem".
This conjecture was posed in 1997 by Andrew Beal, with the prize offered for a correct proof or counterexample.