Proving the Beal Conjecture

David T. Mage

doi:https://doi.org/10.14445/22315373/IJMTT-V13P513

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 13 | Number 2 | Year 2014 | Article Id. IJMTT-V13P513 | DOI : https://doi.org/10.14445/22315373/IJMTT-V13P513

Proving the Beal Conjecture

David T. Mage

Citation :

David T. Mage, "Proving the Beal Conjecture," International Journal of Mathematics Trends and Technology (IJMTT), vol. 13, no. 2, pp. 96-96, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V13P513

Abstract

Fermat's Last Theorem stated, without proof, that the equation, Xn + Yn = Zn, where X, Y, Z and n are integers greater than 2, had no solution for X, Y and Z co-primes. This Theorem was proven by Andrew Wiles in 1994 using mathematical techniques unknown to Fermat 350 years ago. Andrew Beal posed a related conjecture that the equation Xa + Yb = Zc had no solution for X, Y, Z, a, b, and c, where they are all integers greater than 2, and X, Y and Z are co-primes. A simple mathematical proof available to Fermat is used here to prove the Beal conjecture.

Keywords

Fermat, Wiles, Beal, Pythagoras.

References

[1] (2014) The Beal Conjecture website. [Online]. Available: http://www.bealconjecture.com/
[2] R. D. Mauldin, " A Generalization of Fermat's Last Theorem: The Beal Conjecture and Prize Problem," Notices of the AMS, vol. 44, pp. 1436–1439, Nov. 1997.
[3] S. Singh, Fermat's Enigma, New York, NY: Walker and Company, 1997.