Number Theory

    

Beal’s Conjecture is Tenable ( Revised Version)

Authors: Zhang Tianshu

In this article, first classify A, B and C according to their odevity, and thereby get rid of two kinds of AX+BY≠CZ. Then, exemplify AX+BY=CZ under the given requirements. After that, divide AX+BY≠CZ into 4 inequalities under the known requirements, and that apply the mathematical induction, the odd-even relations on the symmetry or the method that takes apart integers to prove each inequality. Finally, reach the conclusion that Beal’s conjecture is tenable via the comparison between AX+BY=CZ and AX+BY≠CZ under the given requirements.

Comments: 17 Pages.

Download: PDF

Submission history

[v1] 2020-05-03 06:43:00

Unique-IP document downloads: 128 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