Beal's conjecture

Beal's conjecture is a conjecture in number theory proposed by Andrew Beal in about 1993; a similar conjecture was suggested independently at about the same time by Andrew Granville.

While investigating generalizations of Fermat's last theorem in 1993, Beal formulated the following conjecture:

If

A^x + B^y = C^z,

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.

Examples

To illustrate, the solution 3³ + 6³ = 3⁵ has bases with a common factor of 3, and the solution 7⁶ + 7⁷ = 98³ has bases with a common factor of 7. Indeed the equation has infinitely many solutions, including for example

$\left[a \left(a^m + b^m\right)\right]^m + \left[b \left(a^m + b^m\right)\right]^m = \left(a^m+b^m\right)^{m+1}$

for any a, b, m > 3. But no such solution of the equation is a counterexample to the conjecture, since the bases all have the factor a^m + b^m in common.

The example 7³ + 13² = 2⁹ shows that the conjecture is false if one of the exponents is allowed to be 2.

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. 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 27⁴ + 162³ = 9⁷.

Beal's conjecture is a generalization of Fermat's last theorem, which corresponds to the case x = y = z. If a^x + b^x = c^x with $x \ge 3$, 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)³ + (−2 − i)³ = (1 + i)⁴.

Sinha Conjecture

The Sinha Conjecture Prize in Number Theory is an award announced by the Excogitation & Innovation Laboratory on June 9, 2009, amounting to US$150,000, for the proof or disproof of a mathematical proposition called the Sinha Conjecture. The prior award money was US $50,000, and it had been made triple in January 11, 2010.

Apart from Andrew Beal's finding, there remained another possibility of FLT, which had been found by Neil Sinha, a non-mathematician and a physics enthusiast.

Here is the modified form of Sinha Conjecture:

Let X, Y, Z, a, b, and c be positive integers, with a, b, c > 2. The equation X^a + Y^b = Z^c has a solution if:

• at least one of X or Y is coprime with Z, when X and Y have a common factor;

or,

• at least one of X or Y has a common factor with Z, when X and Y coprime.

External links

• http://www.bealconjecture.com/
• http://www.math.unt.edu/~mauldin/beal.html
• R. Daniel Mauldin (1997). "A Generalization of Fermat’s Last Theorem: The Beal Conjecture and Prize Problem". Notices of the AMS 44 (11): 1436–1439. http://www.ams.org/notices/199711/beal.pdf. 
• Beal's Conjecture at PlanetMath.
• http://mathoverflow.net/questions/28764/status-of-beal-tijdeman-zagier-conjecture