In this paper, we provide computational results and a proof for Beal’s conjecture. We demonstrate that the common prime factor is intrinsic to this conjecture using the laws of powers. We show that the greatest common divisor is greater than 1 for the Beal’s conjecture.
Bulletin of Mathematical Sciences and Applications (Volume 8)
R. C. Thiagarajan "A Proof to Beal’s Conjecture", Bulletin of Mathematical Sciences and Applications, Vol. 8, pp. 66-69, 2014