Number Theory


Proof of Beal’s Conjecture and Related Examples

Authors: Kamal Barghout

In this article we prove Beal’s conjecture by deductive reasoning by means of elementary algebraic methods. The main assertion in the proof stands upon that the LHS of Beal’s equation represents the sum of two single-term polynomial functions with common indeterminate x of value greater than 1. The single term polynomial function on the RHS of Beal’s equation can be built from the sum of the two polynomials on the LHS. The Greatest Common Factor (GCF) of the two terms on the LHS of the equation is a number in exponential form whose base is the common indeterminate of the two polynomials. Upon factorization of the GCF, it must be combined with the sum of the two coefficients of the terms to yield the single-term polynomial on the RHS of the equation.

Comments: 16 Pages. The material in this article is copyrighted. Please obtain authorization to use from the author

Download: PDF

Submission history

[v1] 2017-12-05 15:21:45
[v2] 2017-12-07 09:57:31
[v3] 2017-12-09 13:15:45

Unique-IP document downloads: 7 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus