Proof of Beal Conjecture

Zengyong Liang

doi:10.4236/apm.2019.95021

Abstract

Beal conjecture is a famous world mathematical problem and was proposed by American banker Beal, so to solve it is more difficult than Fermat’s last theorem. This paper uses relationship between the mathematical formula and corresponding graph, and by characteristics of graph, combined with the algebraic transformation and congruence theory of number theory; it is proved that the equation can only be formed under having a common factor and Beal conjecture is correct.

Highlights

Beal conjecture is named after D Andrew Beal, after studying Fermat’s last theorem in number theory
This paper uses relationship between the mathematical formula and corresponding graph, and by characteristics of graph, combined with the algebraic transformation and congruence theory of number theory; it is proved that the equation can only be formed under having a common factor and Beal conjecture is correct
A spokesman for the American Mathematical Association, Bren, he said that to solve it is more difficult than another related mathematical problem, Fermat’s Last Theorem [1] [2]

Summary

Introduction

Beal conjecture is named after D Andrew Beal, after studying Fermat’s last theorem in number theory. A spokesman for the American Mathematical Association, Bren, he said that to solve it is more difficult than another related mathematical problem, Fermat’s Last Theorem [1] [2]. Martin Gardner discussed PPWs. Martin Gardner discussed PPWs In his famous column Mathematics Games (1973) of an American scientific journal, Gardner states that “in many cases, dull proof can be supplemented by geometric figures, and it is so simple and beautiful that the truth of the theorem can be seen in an instant” [3], proving the most famous examples of indefinite equation by graphs; see (1) of Figure 1. The author found an effective way to prove the Beal conjecture

Propositional Proof

Conclusion