<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">APM</journal-id><journal-title-group><journal-title>Advances in Pure Mathematics</journal-title></journal-title-group><issn pub-type="epub">2160-0368</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/apm.2019.95021</article-id><article-id pub-id-type="publisher-id">APM-92539</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Proof of Beal Conjecture
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Zengyong</surname><given-names>Liang</given-names></name><xref ref-type="aff" rid="aff1"><sub>1</sub></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><label>1</label><addr-line>MCHH of Guangxi, Nanning, China</addr-line></aff><pub-date pub-type="epub"><day>17</day><month>05</month><year>2019</year></pub-date><volume>09</volume><issue>05</issue><fpage>429</fpage><lpage>433</lpage><history><date date-type="received"><day>26,</day>	<month>March</month>	<year>2019</year></date><date date-type="rev-recd"><day>19,</day>	<month>May</month>	<year>2019</year>	</date><date date-type="accepted"><day>22,</day>	<month>May</month>	<year>2019</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  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.
 
</p></abstract><kwd-group><kwd>Algebraic Formula</kwd><kwd> Graph</kwd><kwd> Algebraic Transformation</kwd><kwd> Congruence</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>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 [<xref ref-type="bibr" rid="scirp.92539-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.92539-ref2">2</xref>] .</p><p>“No language proof” (for short PWWs) has been widely known in magazines published by the American Mathematics Association, especially in Mathematics Journal and Mathematics School Journal. 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” [<xref ref-type="bibr" rid="scirp.92539-ref3">3</xref>] , proving the most famous examples of indefinite equation by graphs; see (1) of <xref ref-type="fig" rid="fig1">Figure 1</xref>. The proof of Pythagoras theorem is given by Euclidean geometry’s original 47th proposition [<xref ref-type="bibr" rid="scirp.92539-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.92539-ref4">4</xref>] [<xref ref-type="bibr" rid="scirp.92539-ref5">5</xref>] . Inspired by this, the author found an effective way to prove the Beal conjecture.</p></sec><sec id="s2"><title>2. Propositional Proof</title><p>Proposition (Beal conjecture). If</p><p>A x + B y = C z (1)</p><p>where A, B, C, x, y and z are positive integers; and x, y and z are all greater than 2, then A, B and C must have a common prime factor [<xref ref-type="bibr" rid="scirp.92539-ref2">2</xref>] .</p><p>Because x, y and z are larger than 2, firstly, the three powers in the Formula (1) are replaced by the areas of three rectangles that are A A x − 1 , B B y − 1 , C C z − 1 , as (2) of <xref ref-type="fig" rid="fig1">Figure 1</xref>. If the Equation (1) is true, the area sum of rectangles A A x − 1 , B B y − 1 should be equal to the area of rectangle of C C x − 1 .</p><p>Theorem 1. We called both graphs is isomorphic if the relation of corresponding edges of three rectangles are the same. All isomorphic graphs are equivalent.</p><p>Proof. Because for two isomorphic graphs, the corresponding unknowns are the same in the formula, then the conclusion of the analysis should be the same.</p><p>From Theorem 1, we can discuss rectangles of different sizes and shapes with a representative figure, such as (3) <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>Next, we discuss this conjecture in two ways:</p><p>1) When A, B and C have no common factor</p><p>a) If A = 2 a , C = 3 a , A x − 1 = u B , B y − 1 = ( n + 3 ) a , C z − 1 = ( u + 1 ) B , as (1) of <xref ref-type="fig" rid="fig2">Figure 2</xref></p><p>Obviously,</p><p>A A x − 1 + B B y − 1 = 2 a u B + ( n + 3 ) a B = ( 2 u + n + 3 ) a B ; (2)</p><p>C C z − 1 = 3 a ( u + 1 ) B ， (3)</p><p>By (2) and (3), A A x − 1 + B B y − 1 ≠ C C z − 1 .</p><p>If n = u, then</p><p>A A x − 1 + B B y − 1 = ( 2 u + n + 3 ) a B = 3 ( n + 1 ) a B (4)</p><p>C C z − 1 = 3 a ( u + 1 ) B = 3 a ( n + 1 ) B ， (5)</p><p>By (4) and (5), A A x − 1 + B B y − 1 = C C z − 1 , here, A A x − 1 , B B y − 1 and C C z − 1 have common factor a .</p><p>b) If there A ′ , B ′ , C ′ have no common factor, as (2) of <xref ref-type="fig" rid="fig2">Figure 2</xref>, as</p><p>A ′ x − 1 = n B + t ; A A ′ x − 1 = 2 a ( n B + t ) ; B ′ y − 1 = w + n a + 3 a ; B B ′ y − 1 = ( w + n a + 3 a ) B . Then<sup> </sup></p><p>A A ′ x − 1 + B B ′ y − 1 = 2 a ( n B + t ) + ( w + n a + 3 a ) B = a [ 2 ( n B + t ) + ( n + 3 ) B ] + w B (6)</p><p>and C ′ = 3 a + s , then</p><p>C ′ z = ( 3 a + s ) z = a [ 3 z a z − 1 + z 3 z − 1 a z − 2 s + ⋯ + 3 z s z − 1 ] + s z (7)</p><p>By (6) and (7), according to the congruence theory [<xref ref-type="bibr" rid="scirp.92539-ref6">6</xref>] , we seen that at least that wB and s have a common factor a, can be have</p><p>A A ′ x − 1 + B B ′ y − 1 = C ′ z (8)</p><p>In other words, the Equation (8) can only be established if A, B and C contain common factor a.</p><p>Sum up, we have been proved that the Equation (1) is not true when there is no common factor.</p><p>2) When A, B and C have a common factor</p><p>Look at the square in (1) of <xref ref-type="fig" rid="fig3">Figure 3</xref>. If A = 1, then there is</p><p>1 + 8 = 9, or</p><p>1 + 2 3 = 3 2 . (9)</p><p>If AA and CC are the products of two squares, and C = 3 A , as (1) of <xref ref-type="fig" rid="fig3">Figure 3</xref>, then</p><p>A A + 8 A A = 9 A A . (10)</p><p>If BB = 8AA, CC = 9AA, then we obtain</p><p>A A + B B = C C . (11)</p><p>It is say, when A, B, C have common factor, then can write as (10) and (11).</p><p>When A = D i , by substituting it into (10), we obtain as (2) of <xref ref-type="fig" rid="fig3">Figure 3</xref>, and</p><p>D 2 i + 8 D 2 i = 9 D 2 i (12)</p><p>It can also be obtained by multiplying D<sup>3i</sup> on both sides of (9), have</p><p>D 3 i + 2 3 D 3 i = 3 2 D 3 i . (13)</p><p>Let D = 3, by substituting it into (13), we obtain</p><p>3 3 i + ( 2 &#215; 3 i ) 3 = 3 2 + 3 i . (14)</p><p>These are general term formulas for Beal conjecture. Let A = 3 i , B = 2 &#215; 3 i , C = 3 , x = 3 , y = 3 , z = 2 + 3 i , by substituting it into (14), we obtain</p><p>A x + B y = C z .</p><p>For example of (3) in <xref ref-type="fig" rid="fig3">Figure 3</xref>, we saw 9 cubes, the equation corresponding as below</p><p>3 3 + 8 &#215; 3 3 = 9 &#215; 3 3 , or, 3 3 + 6 3 = 3 5 .</p><p>For more examples as 9 3 + 18 3 = 3 8 , 9 6 + 162 3 = 3 14 , ⋯ .</p><p>Obviously, when i is any integer, no matter the Equation (12) or Equation (14), they are all established.</p><p>Here, we noted that A<sup>x</sup>, B<sup>y</sup>, C<sup>z</sup> in (12) must be have a common factor D<sup>2i</sup>, and D = 3, i ≡ 0 (mod 3); that in (13) must be have a factor D<sup>3i</sup>. The exponents are multiples of 3, to merge with 2<sup>3</sup>. And the D is 3, to merge with 9D<sup>2i</sup> form 3<sup>2+2i</sup>. This is a necessary condition for the establishment of the equations of the Beal conjecture.</p><p>In addition, we have the second kind formulas:</p><p>2 i + 2 i = 2 i + 1 . (15)</p><p>For example, 2 12 + 2 12 = 2 13 , 4 6 + 8 4 = 2 13 .</p><p>Therefore, we proved that Equation (1) is maybe holds when A, B, C have a common factor.</p><p>In conclusion, we have been proved the Proposition, which Beal conjecture is true.</p></sec><sec id="s3"><title>3. Conclusion</title><p>The above proves that, the Equation (1) is not valid without common factors; and it maybe holds when having common factor. It proved that, Beal conjecture is correct. Using the relationship between algebraic formulas and graphs and algebraic transformation, a world mathematical problem of indefinite equation is solved smoothly. It shows that sometimes general and geometric figures can make mathematical proofs simple and clear, which is indispensable. At the same time, this paper also finds a new and effective way to solve the indefinite equation in number theory.</p></sec><sec id="s4"><title>Conflicts of Interest</title><p>The author declares no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s5"><title>Cite this paper</title><p>Liang, Z.Y. (2019) Proof of Beal Conjecture. Advances in Pure Mathematics, 9, 429-433. https://doi.org/10.4236/apm.2019.95021</p></sec></body><back><ref-list><title>References</title><ref id="scirp.92539-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Baike.baidu Beal’s Conjecture. https://baike.so.com/doc/7584609-7858703.html</mixed-citation></ref><ref id="scirp.92539-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">AMS Beal Prise. http://www.ams.org/profession/prizes-awards/ams-supported/beal-prize</mixed-citation></ref><ref id="scirp.92539-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Nelsen, R.B. (2014) Mathematical Protrait—Proof Without Language. Translated by Xiao Zhankui and Fu Wenwen, Machinery Industry Press, Beijing, 1-71.</mixed-citation></ref><ref id="scirp.92539-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Euclid (2011) Geometric Origin. Translated by Yan Xiaodong, Jiangsu People’s Publishing House, Nanjing, 44.</mixed-citation></ref><ref id="scirp.92539-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Xiao, W.Q. (2003) Mathematical Proof. Dalian University of Technology Press, Dalian, 43-44.</mixed-citation></ref><ref id="scirp.92539-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Harly, G.H. and Wright, E.M. (2007) An Introduction to the Theorem of Number. People’s Post and Telecommunications Press, Beijing, 48-57.</mixed-citation></ref></ref-list></back></article>