Beal conjecture

The Beal conjecture^{👁 Mathworld
👁 Planetmath}
:

Let be nonzero integers such that , , and are all , and

(1)

Then , , and (or any two of them) are not relatively prime.

It is clear that the famous statement known as Fermat’s Last Theorem would follow from this stronger claim.

Solutions of equation (1) are not very scarce. One parametric solution is

for , and such that the are nonzero. But computerized searching brings forth quite a few additional solutions, such as:

Mysteriously, the summands have a common factor in each instance.

Dan Vanderkam has verified the Beal conjecture for all values of all six variables up to 1000, and he provides source code for anyone who wants to repeat the verification for himself. A 64-bit machine is required. See http://www.owlnet.rice.edu/ danvk/beal.html

This conjecture is “wanted in Texas, dead or alive”. For the details, plus some additional , see http://www.math.unt.edu/ mauldin/beal.htmlMauldin.

Title	Beal conjecture
Canonical name	BealConjecture
Date of creation	2013-03-22 13:16:53
Last modified on	2013-03-22 13:16:53
Owner	mathcam (2727)
Last modified by	mathcam (2727)
Numerical id	16
Author	mathcam (2727)
Entry type	Conjecture
Classification	msc 11D41
Synonym	Beal’s conjecture