2025, Vol. 6, Issue 2, Part C
Proof of Beal’s conjecture
Author(s): John L Bodie
Abstract: The following article is an edited version of the article previously published at https://doi.org/10.22271/math.2024.v5.i1b.137. It has been edited for clarity and completeness. This article presents a straight-forward proof to Beal’s Conjecture. It begins by proving that there exists a factor common to all three numbers, Ax, By, and Cz, comprising Beal’s Conjecture. Then, using another number theory relationship, GCF(a,b) * LCM(a,b) = a*b, proves that the common factor must be greater than 1. Finally, the proof shows that, pursuant to the Fundamental Theorem of Arithmetic, all numbers greater than 1 are either prime or the product of prime factors.
DOI: https://doi.org/10.22271/math.2025.v6.i2c.242
Pages: 481-483 | Views: 208 | Downloads: 91
Download Full Article: Click Here
How to cite this article:
John L Bodie. Proof of Beal’s conjecture. Journal of Mathematical Problems, Equations and Statistics. 2025; 6(2): 481-483. DOI: 10.22271/math.2025.v6.i2c.242
