Subscribe

Subscribe to our Newsletter and get informed about new publication regulary and special discounts for subscribers!

BMSA > Volume 8 > A Proof to Beal’s Conjecture
< Back to Volume

A Proof to Beal’s Conjecture

Removed due to low scientific quality

Full Text PDF

Abstract:

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.

Info:

Periodical:
Bulletin of Mathematical Sciences and Applications (Volume 8)
Pages:
66-69
Citation:
R. C. Thiagarajan, "A Proof to Beal’s Conjecture", Bulletin of Mathematical Sciences and Applications, Vol. 8, pp. 66-69, 2014
Online since:
May 2014
Export:
Distribution:
References:

[1] Mordell, L. J, Diophantine equations, Series: Pure & Applied Mathematics, Academic Press Inc, July 1969, 312 pages.

[2] Chena, I and Siksekb, S, Perfect powers expressible as sums of two cubes, Journal of Algebra, Volume 322, Issue 3, 1 August 2009, Pages 638–656.

DOI: https://doi.org/10.1016/j.jalgebra.2009.03.010

[3] Mauldin, R.D, A Generalization of Fermat's Last Theorem: The Beal Conjecture and Prize Problem, AMS Notices 44, No 11, December 1997, 1436–1437.

Cited By:
This article has no citations.