Beal conjecture
Beal's conjecture is a conjecture in number theory proposed by the Texas businessman and amateur mathematician Andrew Beal.
While investigating generalizations of Fermat's last theorem in 1993, Beal formulated the following conjecture:
If
where A, B, C, x, y, and z are positive integers with x, y, z > 2 then A, B, and C must have a common prime factor.
Beal has offered a prize of US$100,000 for a proof of his conjecture or a counterexample[1].
Example
To illustrate, the solution 33 + 63 = 35 has bases with a common factor of 3, and the solution 76 + 77 = 983 has bases with a common factor of 7. Indeed the equation has infinitely many solutions, including for example
for any , , . But no such solution of the equation is a counterexample to the conjecture, since the bases all have the factor in common.
Properties
By computerized searching, greatly accelerated by aid of modular arithmetic, this conjecture has been verified for all values of all six variables up to 1000.[2] So in any counterexample, at least one of the variables must be greater than 1000.
A variation of the conjecture where x, y, z (instead of A, B, C) must have a common prime factor is not true. See, for example .
Beal's conjecture is a generalization of Fermat's last theorem, which corresponds to the case . If with , then either the bases are coprime or share a common factor. If they share a common factor, it can be divided out of each to yield an equation with smaller, coprime bases.
The conjecture is not valid over the larger domain of Gaussian integers. After a prize of $50 was offered for a counterexample, Fred W. Helenius provided (−2 + i)3 + (−2 − i)3 = (1 + i)4.[3]
References
External links
- http://www.bealconjecture.com/
- http://www.math.unt.edu/~mauldin/beal.html
- http://www.ams.org/notices/199711/beal.pdf
- http://mathoverflow.net/questions/28764/status-of-beal-tijdeman-zagier-conjecture
- A search for counterexamples - http://www.norvig.com/beal.html
- http://planetmath.org/encyclopedia/BealsConjecture.html