Mathematical conjecture / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Beal's conjecture?
Summarize this article for a 10 years old
The Beal conjecture is the following conjecture in number theory:
If where A, B, C, x, y, z are positive integers and x, y, z are ≥ 3, do A, B, and C have a common prime factor?
- where A, B, C, x, y, and z are positive integers with x, y, z ≥ 3, then A, B, and C have a common prime factor.
- The equation has no solutions in positive integers and pairwise coprime integers A, B, C if x, y, z ≥ 3.
The conjecture was formulated in 1993 by Andrew Beal, a banker and amateur mathematician, while investigating generalizations of Fermat's Last Theorem. Since 1997, Beal has offered a monetary prize for a peer-reviewed proof of this conjecture or a counterexample. The value of the prize has increased several times and is currently $1 million.
In some publications, this conjecture has occasionally been referred to as a generalized Fermat equation, the Mauldin conjecture, and the Tijdeman-Zagier conjecture.