An All-Inclusive Proof of Beal’s Conjecture

Marshall, Stephen M.

doi:10.18052/www.scipress.com/BSMaSS.7.17

BSMaSS > Volume 7 > An All-Inclusive Proof of Beal’s Conjecture

< Back to Volume

An All-Inclusive Proof of Beal’s Conjecture

Removed due to low scientific quality

Full Text PDF

Abstract:

This paper presents a complete and exhaustive proof of the Beal Conjecture. The approach to this proof uses the Fundamental Theorem of Arithmetic as the basis for the proof of the Beal Conjecture. The Fundamental Theorem of Arithmetic states that every number greater than 1 is either prime itself or is unique product of prime numbers. The prime factorization of every number greater than 1 is used throughout every section of the proof of the Beal Conjecture. Without the Fundamental Theorem of Arithmetic, this approach to proving the Beal Conjecture would not be possible.

Info:

Periodical:

The Bulletin of Society for Mathematical Services and Standards (Volume 7)

Pages:

17-22

DOI:

https://doi.org/10.18052/www.scipress.com/BSMaSS.7.17

Citation:

S. M. Marshall, "An All-Inclusive Proof of Beal’s Conjecture", The Bulletin of Society for Mathematical Services and Standards, Vol. 7, pp. 17-22, 2013

Online since:

September 2013

Authors:

Stephen M. Marshall

Export:

RIS, BibTeX, Text

Distribution:

Open Access

This work is licensed under a
Creative Commons Attribution 4.0 International License

References:

[1] A Classical Introduction to Modern Number Theory, Authors: Kenneth Ireland and Michael Rosen.

[2] An Introduction to the Theory of Numbers, Authors: G. H. Hardy, Edward M. Wright, and Andrew Wiles.

[3] Wikipedia, the free encyclopedia, the Fundamental Theorem of Arithmetic.

Cited By:

This article has no citations.