<?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.2016.61001</article-id><article-id pub-id-type="publisher-id">APM-62803</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>
 
 
  On a Simpler, Much More General and Truly Marvellous Proof of Fermat’s Last Theorem (I)
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>olden</surname><given-names>Gadzirayi Nyambuya</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>Department of Applied Physics, National University of Science and Technology, Bulawayo, Republic of Zimbabwe</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>golden.nyambuya@nust.ac.zw</email></corresp></author-notes><pub-date pub-type="epub"><day>15</day><month>01</month><year>2016</year></pub-date><volume>06</volume><issue>01</issue><fpage>1</fpage><lpage>6</lpage><history><date date-type="received"><day>11</day>	<month>July</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>12</month>	<year>January</year>	</date><date date-type="accepted"><day>15</day>	<month>January</month>	<year>2016</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>
 
 
  English mathematics Professor, Sir Andrew John Wiles of the University of Cambridge finally and conclusively proved in 1995 Fermat’s Last Theorem which had for 358 years notoriously resisted all gallant and spirited efforts to prove it even by three of the greatest mathematicians of all time—such as Euler, Laplace and Gauss. Sir Professor Andrew Wiles’s proof employed very advanced mathematical tools and methods that were not at all available in the known World during Fermat’s days. Given that Fermat claimed to have had the “truly marvellous” proof, this fact that the proof only came after 358 years of repeated failures by many notable mathematicians and that the proof came from mathematical tools and methods which are far ahead of Fermat’s time, has led many to doubt that Fermat actually did possess the “truly marvellous” proof which he claimed to have had. In this short reading, via elementary arithmetic methods, we demonstrate conclusively that Fermat’s Last Theorem actually yields to our efforts to prove it.
 
</p></abstract><kwd-group><kwd>Diophantine Equations</kwd><kwd> Fermat’s Last Theorem</kwd><kwd> Fundamental Theorem of Arithmetic</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The pre-eminent French lawyer and amateur<sup>1</sup> mathematician, Advocate―Pierre de Fermat (1607-1665) in 1637, famous in the margin of a copy of the famous book Arithmetica which was written by Diophantus of Alexandria (~201 - 215 AD), wrote:</p><p>“It is impossible to separate a cube into two cubes, or a fourth power into two fourth powers, or in general, any power higher than the second, into two like powers. I have discovered a truly marvellous proof of this, which this margin is too narrow to contain.”</p><p>In the parlance of mathematical symbolism, this can be written succinctly as:</p><disp-formula id="scirp.62803-formula91"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x7.png"  xlink:type="simple"/></disp-formula><p>where the triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x8.png" xlink:type="simple"/></inline-formula>, is piecewise coprime, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x9.png" xlink:type="simple"/></inline-formula> is the set of all positive integer numbers. This theorem is classified among the most famous theorems in all History of Mathematics and prior to 1995, proving it was―and is ranked in the Guinness Book of World Records as one of the “most difficult mathematical problems” known to humanity. Fermat’s Last Theorem is now a true theorem since it has been proved, but prior to 1995 it was only a conjecture. Before it was proved in 1995, it is only for historic reasons that it was known by the title “Fermat’s Last Theorem”.</p><p>Rather “notoriously”, it stood as an unsolved riddle in mathematics for well over three and half centuries. Many amateur and great mathematicians tried but failed to prove the conjecture in the intervening years 1637- 1995; including three of the World’s greatest mathematicians such as Italy’s Leonhard Euler (1707-1783), France’s Pierre-Simon, marquis de Laplace (1749-1827), and the celebrated mathematical prodigy, genius and Crown Prince of Mathematics, Germany’s Johann Carl Friedrich Gauss (1777-1855), amongst many other notable and historic figures of mathematics.</p><p>Without any doubt, the conjecture or Fermat’s Last Theorem is in-itself―as it stands as a bare statement, deceptively simple mathematical statement whose any agile 10-year-old mathematical prodigy can fathom with relative ease. As already said, Fermat famous―via his bare marginal note stated he had solved the riddle around 1637. His claim was discovered some 30 years later after his death in 1665, as an overly simple statement in the margin of the famous copy Arithmetica. As it is well known from the history of mathematics, Fermat wrote many notes in the margins and most of these notes were “theorems” that he claimed to have solved himself. Some of the proofs of his assertions were found. For those that were not found, all the proofs save for one resisted all intellectually spirited efforts to prove it and this was the marginal note pertaining the so-called Fermat’s Last Theorem.</p><p>This marginal note dubbed Fermat’s Last Theorem, was the last of the assertions made by Fermat whose proof was needed, and for this reason that it was the last of Fermat’s statement that stood unproven, it naturally found itself under the title “Fermat’s Last Theorem”. Because all of the many of Fermat’s assertions were eventually proved, most people believed that this last assertion must―too, be correct as Fermat had claimed. Few― if any, doubted the assertion may be false, hence the confidence to call it a theorem. Simple, the proof Fermat claimed to have had, had to be found! Alas, reality could prove otherwise that the proof was not a mere summer walk in the park.</p><p>So the question is: Did Fermat actually posses the so-called “truly marvelous” proof which he claimed to have had? This is the question many have justly and rightly asked over the years and this reading makes the temerarious endeavour to vindicate Fermat that he very well might have had the “truly marvellous” proof he claimed to have had and we accomplish by providing a proof that employs elementary arithmetic methods that were available in Fermat’s day.</p><p>Surely, there are just reasons to doubt Fermat actually had the proof and this is so given the great many notable mathematicians that tried and monumentally failed and as-well, gave the number of years it took to find the first correct proof. The first correct proof was supplied only 358 years later by the English Professor of mathematics at the University of Cambridge―Sir Professor Andrew John Wiles, in 1995 [<xref ref-type="bibr" rid="scirp.62803-ref1">1</xref>] .</p><p>To add salt to injury i.e. add onto the doubts on whether or not Fermat actually had his so-called “truly marvellous” proof is that Sir Professor Andrew Wiles’s proof<sup>2</sup> employs highly advanced mathematical tools and methods that were not at all available in the known World during Fermat’s days. Actually, these tools and methods were invented (discovered) in the relentless effort to solve this very problem. Herein, we supply a very simple proof of Fermat’s Last Theorem.</p><p>That said, we must hasten to say that, as a difficult mathematical problem that so far yielded only to the difficult, esoteric and advanced mathematical tools and methods of Sir Professor Andrew Wiles―Fermat’s Last Theorem, as any other difficult mathematical problem in the History of Mathematics, it has had a record number of incorrect proofs of which the present may very well be an addition to this long list of incorrect proofs. In the words of historian of mathematics―Howard Eves [<xref ref-type="bibr" rid="scirp.62803-ref2">2</xref>] :</p><p>“Fermat’s Last Theorem has the peculiar distinction of being the mathematical problem for which the greatest number of incorrect proofs has been published.”</p><p>With that in mind, it allows us to say, we are confident that the proof we supply herein is water-tight and most certainly correct and that, it will stand the test of time and experience.</p><p>As stated in the ante-penultimate above, in this rather short reading, we make the temerarious endeavour to answer this question―of whether or not Fermat actually possessed the proof he claimed to have had. We accomplish by supplying a simple and elementary proof that does not require any advanced mathematics but mathematics that was available in the days of Fermat. Sir Professor Andrew Wiles’s acclaimed proof, is at best very difficult and to the chagrin of they that seek a simpler understanding―the proof is nothing but highly esoteric. The question thus “forever” hangs in there to the searching and inquisitive mind: “Did Fermat really possess the proof he claimed to have had?” The proof that we supply herein leads us to strongly believe that Fermat might have had the proof and this proof most certainly employed elementary methods of arithmetics!</p></sec><sec id="s2"><title>2. Proofs for Specific Indices</title><p>Before we go into the main business of the day, we shall give a short history of some notable efforts in finding a proof to Fermat’s Last Theorem. As is well known, the case for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x11.png" xlink:type="simple"/></inline-formula>, for all non-zero <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x12.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x13.png" xlink:type="simple"/></inline-formula>, the equation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x14.png" xlink:type="simple"/></inline-formula> admits no solutions. This was first proved by the great Italian mathematician Leonhard Euler in 1770 [<xref ref-type="bibr" rid="scirp.62803-ref3">3</xref>] , that is, 133 years after Fermat set into motion Fermat’s Last Theorem. Euler used the technique of infinite descent. Euler’s proof is not the only proof possible as other authors have published their independent proofs (cf. [<xref ref-type="bibr" rid="scirp.62803-ref4">4</xref>] -[<xref ref-type="bibr" rid="scirp.62803-ref8">8</xref>] , amongst many others).</p><p>Fermat was the first to provide a proof for the case <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x15.png" xlink:type="simple"/></inline-formula> which stated that for all non-zero piecewise coprime triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x16.png" xlink:type="simple"/></inline-formula>, the equation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x17.png" xlink:type="simple"/></inline-formula> admits no solutions. This proof by Fermat is the only surviving proof of Fermat’s Last Theorem and as is the case with Euler’s proof for the case<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x18.png" xlink:type="simple"/></inline-formula>, Fermat’s proof makes use of the technique of infinite descent. One wonders whether or not Fermat conducted this proof as part of a more general proof for all<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x19.png" xlink:type="simple"/></inline-formula>. As is the case with Euler’s proof for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x20.png" xlink:type="simple"/></inline-formula>, Fermat’s proof is not the only proof possible as other authors have published their independent proofs (see e.g. Refs. [<xref ref-type="bibr" rid="scirp.62803-ref5">5</xref>] [<xref ref-type="bibr" rid="scirp.62803-ref6">6</xref>] [<xref ref-type="bibr" rid="scirp.62803-ref9">9</xref>] -[<xref ref-type="bibr" rid="scirp.62803-ref11">11</xref>] , amongst many others). Even after Sir Professor Andrew Wiles’s 1995 breakthrough [<xref ref-type="bibr" rid="scirp.62803-ref1">1</xref>] , researchers are still publishing variants of the proof for the case <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x21.png" xlink:type="simple"/></inline-formula> (cf. [<xref ref-type="bibr" rid="scirp.62803-ref12">12</xref>] -[<xref ref-type="bibr" rid="scirp.62803-ref14">14</xref>] ).</p><p>The case <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x22.png" xlink:type="simple"/></inline-formula> was first proved independently by the French mathematician Adrien-Marie Legendre (1752-1833) and the German mathematician Johann Peter Gustav Lejeune Dirichlet (1805-1859) around 1825 and alternative and independent proofs were developed in the later years by others (cf. [<xref ref-type="bibr" rid="scirp.62803-ref5">5</xref>] [<xref ref-type="bibr" rid="scirp.62803-ref15">15</xref>] -[<xref ref-type="bibr" rid="scirp.62803-ref22">22</xref>] , amongst many others).</p></sec><sec id="s3"><title>3. Lemma (I)</title><p>If <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x23.png" xlink:type="simple"/></inline-formula> where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x24.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x25.png" xlink:type="simple"/></inline-formula> is one of the prime factors of a, then, the following will hold true always:</p><disp-formula id="scirp.62803-formula92"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x26.png"  xlink:type="simple"/></disp-formula><p>The above statement is clearly evident and needs no proof. However, below we demonstrate that this statement is true. This demonstration does not constitute a proof.</p><p>What this statement really means is that the number <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x27.png" xlink:type="simple"/></inline-formula> [for any <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x28.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x29.png" xlink:type="simple"/></inline-formula>], can always be</p><p>written as a sum or difference of two numbers p and q where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x30.png" xlink:type="simple"/></inline-formula> are not co-prime, i.e.:</p><disp-formula id="scirp.62803-formula93"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x31.png"  xlink:type="simple"/></disp-formula><p>since one can always find some <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x32.png" xlink:type="simple"/></inline-formula> such that a will always be a common factor of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x33.png" xlink:type="simple"/></inline-formula>, that is to say:</p><disp-formula id="scirp.62803-formula94"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x34.png"  xlink:type="simple"/></disp-formula><p>in which case we will have <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x35.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x36.png" xlink:type="simple"/></inline-formula> where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x37.png" xlink:type="simple"/></inline-formula> such that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x38.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x39.png" xlink:type="simple"/></inline-formula>. To see this, we know that if <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x40.png" xlink:type="simple"/></inline-formula> is the set of all the prime factors of a, then</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x41.png" xlink:type="simple"/></inline-formula>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x42.png" xlink:type="simple"/></inline-formula>. Substituting all this into (4), we will have:</p><disp-formula id="scirp.62803-formula95"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x43.png"  xlink:type="simple"/></disp-formula><p>Setting <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x44.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x45.png" xlink:type="simple"/></inline-formula>, (5) leads us to (2). As we did with Beal’s Conjecture in [<xref ref-type="bibr" rid="scirp.62803-ref23">23</xref>] , equipped with this simple fact, we will demonstrate that as we did with that Fermat’s Last Theorem yields to a proof in the simplest imaginable manner.</p><p>Proof.</p><p>If<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x46.png" xlink:type="simple"/></inline-formula>, then, according to the fundamental theorem of arithmetic, we can decompose the number a into its prime factors i.e.:</p><disp-formula id="scirp.62803-formula96"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x47.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x48.png" xlink:type="simple"/></inline-formula> and the<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x49.png" xlink:type="simple"/></inline-formula>’s are the prime factors of a and these are such that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x50.png" xlink:type="simple"/></inline-formula>. We will have <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x51.png" xlink:type="simple"/></inline-formula> if and only if a is prime.</p><p>Now, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula>and since <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula>, it is clear that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula>. Clearly, if<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x56.png" xlink:type="simple"/></inline-formula>, we can write <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x57.png" xlink:type="simple"/></inline-formula> where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x58.png" xlink:type="simple"/></inline-formula>. From the foregoing, it follows from <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x59.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x60.png" xlink:type="simple"/></inline-formula>, that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x61.png" xlink:type="simple"/></inline-formula>. From (6), it follows that:</p><disp-formula id="scirp.62803-formula97"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x62.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x63.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x64.png" xlink:type="simple"/></inline-formula> where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x65.png" xlink:type="simple"/></inline-formula>. Hence result is proven. Now we proceed to the main task of the present reading.</p></sec><sec id="s4"><title>4. Proof of Fermat’s Last Theorem (I)</title><p>Now, the proof that we are going to provide of FTL is a proof by contradiction and this proof makes use of Lemma &#167;(3) whereby we demonstrate that the triple <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x66.png" xlink:type="simple"/></inline-formula> is such that it will always have a common factor if the equation, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x67.png" xlink:type="simple"/></inline-formula>for all<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x68.png" xlink:type="simple"/></inline-formula>; is to hold true. We begin by assuming the statement:</p><disp-formula id="scirp.62803-formula98"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x69.png"  xlink:type="simple"/></disp-formula><p>to be true for some piecewise co-prime triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x70.png" xlink:type="simple"/></inline-formula>, the meaning of which is that the greatest common divisor of this triple or any pair of the triple is unity i.e., <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x71.png" xlink:type="simple"/></inline-formula>.</p><p>1) We must realise that if just one of the members of the triple <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x72.png" xlink:type="simple"/></inline-formula> is equal to unity for any<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x73.png" xlink:type="simple"/></inline-formula>, then, the other two members of this triple cannot be integers, hence, from this it follows that if a solution exists,</p><p>then, all the members of this triple will be greater than unity i.e.<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x74.png" xlink:type="simple"/></inline-formula>.</p><p>2) By way of contradiction, we assert that there exists a set of positive integers <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x75.png" xlink:type="simple"/></inline-formula> that satisfy the simple relation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x76.png" xlink:type="simple"/></inline-formula> for some piecewise co-prime triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x76.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x77.png" xlink:type="simple"/></inline-formula>. Having made this assumption, if we can show that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x76.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x78.png" xlink:type="simple"/></inline-formula>, then, by way of contradiction FTL holds true.</p><p>3) If the statement (8) holds true, then―clearly; there must exist some <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x79.png" xlink:type="simple"/></inline-formula> such that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x80.png" xlink:type="simple"/></inline-formula>, such that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x81.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x82.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x83.png" xlink:type="simple"/></inline-formula> can be decomposed as follows:</p><disp-formula id="scirp.62803-formula99"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x84.png"  xlink:type="simple"/></disp-formula><p>4) According to the Lemma &#167;(3), the equation<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula>; for any <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula> and for any<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula>, this equation, can always be written such that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x89.png" xlink:type="simple"/></inline-formula> for some <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x90.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x91.png" xlink:type="simple"/></inline-formula> is any of the prime factors of z. Putting everything together, we will have<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x92.png" xlink:type="simple"/></inline-formula>. Substituting <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x93.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x93.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x94.png" xlink:type="simple"/></inline-formula> into (9), we will have:</p><disp-formula id="scirp.62803-formula100"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x95.png"  xlink:type="simple"/></disp-formula><p>5) From (10), it is clear that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x96.png" xlink:type="simple"/></inline-formula> since there exists a common divisor <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x97.png" xlink:type="simple"/></inline-formula> of the triple <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x98.png" xlink:type="simple"/></inline-formula> which is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x99.png" xlink:type="simple"/></inline-formula>, that is to say, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x99.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x100.png" xlink:type="simple"/></inline-formula>is a common divisor of the triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x99.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x101.png" xlink:type="simple"/></inline-formula>. If</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x102.png" xlink:type="simple"/></inline-formula>, consequently, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x103.png" xlink:type="simple"/></inline-formula>and this is in complete violation of the critical, crucial and sacrosanct assumption that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x104.png" xlink:type="simple"/></inline-formula>. Q.E.D.</p><p>Alternatively, according to the Lemma &#167;(3), the equation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x105.png" xlink:type="simple"/></inline-formula> for any <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x106.png" xlink:type="simple"/></inline-formula> and for any<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x107.png" xlink:type="simple"/></inline-formula>, this equation, can always be written such that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x108.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x109.png" xlink:type="simple"/></inline-formula> for some <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x109.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x110.png" xlink:type="simple"/></inline-formula> and</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x111.png" xlink:type="simple"/></inline-formula>is any of the prime factors of x; putting everything together, we will have<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x112.png" xlink:type="simple"/></inline-formula>. Now, substituting <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x112.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x113.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x112.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x113.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x114.png" xlink:type="simple"/></inline-formula> into (9), we will have:</p><disp-formula id="scirp.62803-formula101"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-5300939x115.png"  xlink:type="simple"/></disp-formula><p>Again, from (11), it is clear that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula> since the<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x117.png" xlink:type="simple"/></inline-formula>, that is to say, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x118.png" xlink:type="simple"/></inline-formula>is a common divisor of triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x119.png" xlink:type="simple"/></inline-formula>. From the foregoing, it follows that the prime factors of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x119.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x120.png" xlink:type="simple"/></inline-formula> are common divisors of the triple<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x119.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x120.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x121.png" xlink:type="simple"/></inline-formula>, the meaning of which is that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x119.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x120.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x121.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x122.png" xlink:type="simple"/></inline-formula>.</p><p>Therefore, by way of contradiction, Fermat’s Last Theorem is true since we arrive at a contradictory result that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x123.png" xlink:type="simple"/></inline-formula>. What this effectively means is that the equation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x124.png" xlink:type="simple"/></inline-formula> for <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x125.png" xlink:type="simple"/></inline-formula> has a solution and this solution is such that the triple <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x126.png" xlink:type="simple"/></inline-formula> always has a common factor as is the case with all those values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-5300939x127.png" xlink:type="simple"/></inline-formula> that satisfy Fermat’s Last Theorem.</p></sec><sec id="s5"><title>5. General Discussion</title><p>If the proof we have provided herein stands the test of time and experience, then, it is without a doubt that Fermat’s claim to have had a ‘truly marvellous’ proof may very well resonate with truth. The proof provided herein is not only simple, but surprisingly simple, so simple that one wonders how great mathematicians would have missed this. All this simplicity is embodied in Lemma (3). As we anxiously await the World to judge our proof, effort and work, we must―if this be permitted at this point of closing, say that, we are confident that―simple as it is or may appear, this proof is flawless, it will stand the test of time and experience. It strongly appears that the great physicist and philosopher―Albeit Einstein (1879-1955), was probably right in saying that “Subtle is the Lord. Malicious He is not”. Because in Lemma &#167;(3), there exists deeply embedded therein, a subtlety that resolves and does away with the malice and notoriety associated with Fermat’s Last Theorem in a simpler and truly marvellous and general manner.</p></sec><sec id="s6"><title>6. Conclusion</title><p>Given that the method used here to prove Fermat’s Last Theorem is so elementary, it is very much possible that Fermat actually processed the correct proof.</p></sec><sec id="s7"><title>Cite this paper</title><p>Golden GadzirayiNyambuya, (2016) On a Simpler, Much More General and Truly Marvellous Proof of Fermat’s Last Theorem (I). Advances in Pure Mathematics,06,1-6. doi: 10.4236/apm.2016.61001</p></sec><sec id="s8"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.62803-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Wiles, A. (1995) Modular Elliptic Curves and Fermat’s Last Theorem. Annals of Mathematics, 141, 443-551.http://dx.doi.org/10.2307/2118559</mixed-citation></ref><ref id="scirp.62803-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Koshy, T. (2001) Elementary Number Theory with Applications. Academic Press, New York, 544.</mixed-citation></ref><ref id="scirp.62803-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Leonhard, E. (1770) Vollst&amp;#228;ndige Anleitung zur Algebra. Royal Academy of Sciences, St. Petersburg.</mixed-citation></ref><ref id="scirp.62803-ref4"><label>4</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Kausler</surname><given-names> C.F. </given-names></name>,<etal>et al</etal>. (<year>1802</year>)<article-title>Nova Demonstratio Theorematis nec Summam, nec Differentiam Duorum Cuborum Cubum esse Posse. Novi Acta Acad</article-title><source> Petrop</source><volume> 13</volume>,<fpage> 245</fpage>-<lpage>253</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref5"><label>5</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Gambioli</surname><given-names> D. </given-names></name>,<etal>et al</etal>. (<year>1901</year>)<article-title>Memoria Bibliographica Sull’ultimo Teorema di Fermat. Period. Mat</article-title><source></source><volume> 16</volume>,<fpage> 145</fpage>-<lpage>192</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref6"><label>6</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Legendre</surname><given-names> A.M. </given-names></name>,<etal>et al</etal>. (<year>1823</year>)<article-title>Recherches sur Quelques Objets D’analyse Indéterminée, et Particulièrement sur le Théorème de Fermat. Mém. Acad. Roy. Sci</article-title><source> Institut France</source><volume> 6</volume>,<fpage> 1</fpage>-<lpage>60</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Legendre, A.M. (1930) Théorie des Nombres, Volume II. 3rd Edition, Firmin Didot Frères, Paris.</mixed-citation></ref><ref id="scirp.62803-ref8"><label>8</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Duarte</surname><given-names> F.J. </given-names></name>,<etal>et al</etal>. (<year>1944</year>)<article-title>Sobre la Ecuaci on x3 + y3 + z3 = 0. Ciencias Fis. Mat</article-title><source> Naturales (Caracas)</source><volume> 8</volume>,<fpage> 971</fpage>-<lpage>979</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Hilbert, D. (1987) Die Theorie der Algebraischen Zahlk&amp;#246;rper, Volume 4. Jahresbericht der Deutschen Mathematiker-Vereinigung.</mixed-citation></ref><ref id="scirp.62803-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Lebesgue, V.A. (1853) Rèsolution des équations biquadratiques z2 = x4 ± 2my4, z2 = 2mx4y4, 2mz2 = x4 ± y4. Journal de Mathématiques Pures et Appliquées, 18, 73-86.Lebesgue, V.A. (1859) Exercices d’Analyse Numrique. Leiber et Faraguet, Paris, 83-84, 89. Lebesgue, V.A. (1862) Introduction à la Théorie des Nombres. Mallet-Bachelier, Paris, 71-73.</mixed-citation></ref><ref id="scirp.62803-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Kronecker, L. (1901) Vorlesungen über Zahlentheorie. Vol. I, Teubner, Leipzig, 33-38. Reprinted by Springer-Verlag, New York in 1978.</mixed-citation></ref><ref id="scirp.62803-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Grant, M. and Perella, M. (1999) Descending to the Irrational. The Mathematical Gazette, 83, 263-267. http://dx.doi.org/10.2307/3619054</mixed-citation></ref><ref id="scirp.62803-ref13"><label>13</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Dolan</surname><given-names> S. </given-names></name>,<etal>et al</etal>. (<year>2011</year>)<article-title>Fermat’s Method of Descente Infinie</article-title><source> The Mathematical Gazette</source><volume> 95</volume>,<fpage> 269</fpage>-<lpage>271</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref14"><label>14</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Barbara</surname><given-names> R. </given-names></name>,<etal>et al</etal>. (<year>2007</year>)<article-title>Fermat’s Last Theorem in the Case n = 4</article-title><source> The Mathematical Gazette</source><volume> 91</volume>,<fpage> 260</fpage>-<lpage>262</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Gauss, J.C.F. (1875) Neue Theorie der Zerlegung der Cuben. 2nd Edition, Vol. II, (Zur Theorie der complexen Zahlen, Werke), K&amp;#246;nigl. Ges. Wiss, G&amp;#246;ttingen. (Published posthumous)</mixed-citation></ref><ref id="scirp.62803-ref16"><label>16</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Lebesgue</surname><given-names> V.A. </given-names></name>,<etal>et al</etal>. (<year>1843</year>)<article-title>Thèorémes nouveaux sur l’équation indéterminée x5 + y5 = az5</article-title><source> Journal de Mathématiques Pures et Appliquées</source><volume> 8</volume>,<fpage> 49</fpage>-<lpage>70</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref17"><label>17</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Lamé</surname><given-names> G. </given-names></name>,<etal>et al</etal>. (<year>1847</year>)<article-title>Mémoire sur la Résolution en Nombres Complexes de Léquation A5 + B5 + C5 = 0</article-title><source> Journal de Mathématiques Pures et Appliquées</source><volume> 12</volume>,<fpage> 137</fpage>-<lpage>171</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Gambioli, D. (1903) Intorno all’ultimo teorema di Fermat. Il Pitagora, 10, 11-13, 41-42.</mixed-citation></ref><ref id="scirp.62803-ref19"><label>19</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Werebrusow</surname><given-names> A.S. </given-names></name>,<etal>et al</etal>. (<year>1905</year>)<article-title>On the Equation x5 + y5 = Az5. Moskov. Math</article-title><source> Samml</source><volume> 25</volume>,<fpage> 466</fpage>-<lpage>473</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Rychlik, K. (1910) On Fermat’s Last Theorem for n = 5. Casopis Pest. Mat, 39, 185-195, 305-317. (In Bohemian)</mixed-citation></ref><ref id="scirp.62803-ref21"><label>21</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>van der Corput</surname><given-names> J.G. </given-names></name>,<etal>et al</etal>. (<year>1915</year>)<article-title>Quelques Formes Quadratiques et Quelques équations Indéterminées</article-title><source> Nieuw Archief voor Wiskunde</source><volume> 11</volume>,<fpage> 45</fpage>-<lpage>47</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62803-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Terjanian, G. (1987) Sur une Question de V.A. Lebesgue. Annales de l’Institut Fourier, 37, 19-37. http://dx.doi.org/10.5802/aif.1096</mixed-citation></ref><ref id="scirp.62803-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Nyambuya, G.G. (2014) A Simple and General Proof of Beal’s Conjecture (I). Advances in Pure Mathematics, 4, 518-521. http://dx.doi.org/10.4236/apm.2014.49059</mixed-citation></ref></ref-list></back></article>