Number Theory

    

Beal Conjecture Proved Finally

Authors: A. A. Frempong

The author proves directly the original Beal conjecture (and not the equivalent conjecture) that if A^x + B^y = C^z where A, B, C, x. y, z are positive integers and x, y, z > 2, then A, B, and C have a common prime factor. The principles applied in the proof are based on the properties of the factored Beal equation. The main principle for obtaining relationships between the prime factors on the left side of the equation and the prime factor on the right side of the equation is that the greatest common power of the prime factors on the left side of the equation is the same as a power of the prime factor on the right side of the equation. High school students can learn and prove this conjecture as a bonus question on a final class exam.

Comments: 8 Pages. Copyright © by A. A. Frempong

Download: PDF

Submission history

[v1] 2020-01-31 00:57:16
[v2] 2020-02-01 03:02:41
[v3] 2020-02-02 00:44:06
[v4] 2020-02-05 01:41:44
[v5] 2020-02-09 01:02:13
[v6] 2020-02-24 23:21:53
[v7] 2020-04-25 02:35:37

Unique-IP document downloads: 606 times

Vixra.org 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. Vixra.org 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