<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Pierre Fermat on Medium]]></title>
        <description><![CDATA[Stories by Pierre Fermat on Medium]]></description>
        <link>https://medium.com/@pierre.fermat.1955?source=rss-7f7427959633------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*6RMGyQJ_vg_UJ1vZ</url>
            <title>Stories by Pierre Fermat on Medium</title>
            <link>https://medium.com/@pierre.fermat.1955?source=rss-7f7427959633------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 01:29:00 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@pierre.fermat.1955/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[A Smoke Letter across the Continuum]]></title>
            <link>https://medium.com/@pierre.fermat.1955/a-smoke-letter-across-the-continuum-bf4ab3a52442?source=rss-7f7427959633------2</link>
            <guid isPermaLink="false">https://medium.com/p/bf4ab3a52442</guid>
            <category><![CDATA[fermats-little-theorem]]></category>
            <category><![CDATA[pierre-fermat]]></category>
            <category><![CDATA[fermats-last-theorem]]></category>
            <category><![CDATA[number-theory]]></category>
            <dc:creator><![CDATA[Pierre Fermat]]></dc:creator>
            <pubDate>Wed, 11 Nov 2026 17:56:37 GMT</pubDate>
            <atom:updated>2026-11-17T00:35:47.946Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/382/1*Qf5P5KhYp-dhA81yBy1oPg.png" /></figure><p>Revised Nov 16, 2026 — — — Pierre Fermat<br>Over the ages, the greatest among us, have stipulated that if something is unknown, it does not neccessarily not exist. And the vastness of time, space and knowledge of the ancients, could not possibly fit into our miniscule human brains. Thus there perhaps is a very good reason, we can not know everything, all the time.<br>..<br>And thus, communications to the “other side” is necessarily constrained to a relatively small bandwidth. After seeing the movie “Harry Potter”, the smoke letter concept appeared to offer a good directl line of communications.<br>..<br>This latest smoke letter from Pierre Fermat’s protege to what may persist of Fermat himself, was delivered today. It is the 3rd or 4th smoke letter over the last 2 or 3 years. It’s nice to find a rigorous, unassailable proof within this metaverse, which could have been discovered in the 1700’s by Euler, and why didn’t he!<br>..<br>Euler produced 30.000 pages of mathematics, physics and engineering in his lifetime, if he had focus, and spent a bit of time, I am sure he would have eventually stumbled upon the same strong proof which I discovered, and wrapped up in the innocent sounding title of a “N=3 Fermateque Proof”. Some might consider the information delivery a secret delivery method, that’s what went thru my mind as I conspired to inform the mistrustful crowd of mathematicians of the breakthru. <br>(<em>Note Medium not ideal for equation presentation</em>)<br>..<br>8888888888888888888888888888888888888888888888888888888<br>..<br> <a href="https://fermatstheory.wordpress.com/wp-content/uploads/2026/11/n3-stark-c2-1.pdf"><strong>A Fermatesque Proof of the Cubic form of Fermat’s Last Theorem</strong></a><br> <br>A Fermatesque Proof of the Cubic form of Fermat’s Last Theorem<br> Socrates Ion Origin: Nov 16, 2026</p><p>When two discrete cubic variables are summed, the sum may not be another discrete cubic value, the proof of this is very simple if a factor of 3 is not present in any of the base variables, which we may define as A, B and C. However when one of the 3 variables A, B and C contains a factor of 3, this more difficult pre-condition must lead one to the following proof.</p><p>Sophie Germain spent a significant period to time analyzing FLT, she determined the following fundamentals for this interesting equation, A^P + B^P = C^P.</p><p>A + B — C must be divisible by P, in other words, A + B — C = 0 mod P.</p><p>When a factor of P is NOT present within one of the 3 variables A, B or C, analysis of the equation is referred to as: CASE 1.</p><p>When a factor of P is present within one of the 3 variables A, B or C, analysis of the equation is referred to as: CASE 2.</p><p>For this exposition, we will consider that if we present C as a negative number, the well known FLT equation may be written as: A^P + B^P + C^P = 0, and this symmetric presentation is ideal for analysis.</p><p><strong>N=3, part 1</strong></p><p>An assessment of Case 1 for the exponent 3 allows us to quickly prove that no possible integer solutions exist as follows:</p><p>A³ + B³ + C³ = 0, and since zero can divide all numbers we may also write:</p><p>A³ + B³ + C³ = 0 mod 3, as well as A³ + B³ + C³ = 0 mod 9</p><p>For Case 1 we only need analyze 2 preconditions, A=B=C= 1 mod 3, and also A=B=C= 2 mod 3 .</p><p>For both potential residue value sets, the sum of A³ + B³ + C³ = 0 mod 3, by application of Fermat’s Little Theorem, which states that x^P = x mod P. And this is truly easy to derive using binomial expansion.</p><p>An analysis of A³ + B³ + C³ = 0 mod 9, is where we will perceive the impossibility. Let us present the base values and x³ residue values of modulus 9, <br> <br> Base value: 0, 1, 2, 3, 4, 5 , 6, 7, 8, 9<br> Cubic value: 0, +1, -1, 0, +1, — 1, 0, +1, -1, 0<br> <br> For Case 1 we only need analyze 2 preconditions, A=B=C= 1 mod 3, and also A=B=C= 2 mod 3, to establish modulus 3 compliance.<br> <br> However, analysis of these conditions, modulus 9, shows that summing three of the base values which meet our modulus 3 preconditions, can never satisfy a modulus 9 summation state.</p><p><strong>N=3, part 2</strong></p><p>To prove FLT for Case 2, where one of the 3 base variables contain a factor of 3, a more detailed algorithm is required. In this segment of the proof, we will show that the factor 3, may not occur in any of the variables A, B or C thus ruling out any potential case 2 solution.</p><p>We will start by analysis of a potential solution of A³ + B³ = 11³, although per the Abel-Barlow case 2 factorization the base C may not contain a single factor, this is merely a numeric anchored explanation, which will help to rationalize understanding of the following section.<br> <br> Since phi (11³) can not contain a factor of 3 we can be certain that factorization of A³ + B³ must place 11³ in the (L) linear part, and we may write:<br> <br> A³ + B³ = 0 mod 11³, with the understanding that there is magnitude overflow within C³, since the L factor A+B must contain the coprime factors 11³. Therefore the (Q) Power quotient factors<br> (A³ + B³)/(A+B) must be contained in the magnitude overflow.<br> <br> So let’s let X = A, and rewrite the equation:</p><p>X + (11³ — X) = 11³<br> <br> and now the modulus analysis, simple binomial expansion: <br> <br> X³ — X³ + 11³³ — 3*(11³²)*X + 3*(11³)*X² = 0 mod 11³</p><p>Now of course we know it has to be divisible by 11³ so let’s rewrite once again:</p><p>11³ ( 11³² — 3*(11³)*X + 3*X² ) = 0 mod 11³</p><p>We have factored out 11³, and there is something sort of funky about the residue, spot it?</p><p>Numeric 3!!! Specifically 11³² — 3*(11³)*X + 3*X² ≠ 0 mod 3</p><p>Now let us rewrite this last equation in a more general form, and repeat for the rotations:<br> C.1⁶ — 3*(C.1³)*A + 3*A² ≠ 0 mod 3<br> A.1⁶ — 3*(A.1³)*B + 3*B² ≠ 0 mod 3<br> B.1⁶ — 3*(B.1³)*C + 3*C² ≠ 0 mod 3<br> All 3 equations must exist, none can contain a factor of 3.</p><p>Case 2 may not exist! The residue can not be divided by 3. And maybe that is OK for base variable C. But it can not be OK for base variables A, B and C. And since the exponent of the FLT equation is an odd number, we can rotate the base variables, after we precept the C base variable as a negative number, and write the equation as: A³ + B³ + C³ = 0.</p><p><strong>Reductio Ad Absurdum.</strong></p><p>CONTEXT FOOTNOTE:</p><p>Although Pierre Fermat had claimed proof of the n=3 case by Infinite Descent in various letters to contemporaries, such as Carcavi in 1659, he left no intermediate verbal prose illuminating a potential path, which he may have followed. And a century later Leonard Euler was only able to prove the n=3 case using complex numbers, which was later strengthened by Eisenstein complex number mathematics.<br> <br> However, had Fermat had a long healthy life span as is common in this day and age, and provided he had good focus on the n=3 conundrum, it is this author’s belief that Fermat would have likely eventually arrived at this same static real integer factoring proof solution.</p><p>Feel free to email me at Pierre.Fermat.1955@gmail.com</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=bf4ab3a52442" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[The mystery of the missing n=3 Proof]]></title>
            <link>https://medium.com/@pierre.fermat.1955/the-mystery-of-the-missing-n-4-proof-2094a2e8ab0b?source=rss-7f7427959633------2</link>
            <guid isPermaLink="false">https://medium.com/p/2094a2e8ab0b</guid>
            <category><![CDATA[fermats-last-theorem]]></category>
            <category><![CDATA[number-theory]]></category>
            <category><![CDATA[pierre-fermat]]></category>
            <dc:creator><![CDATA[Pierre Fermat]]></dc:creator>
            <pubDate>Wed, 11 Nov 2026 01:26:20 GMT</pubDate>
            <atom:updated>2026-11-17T00:36:48.937Z</atom:updated>
            <content:encoded><![CDATA[<p>Revised Nov 16, 2026<br>It may seem odd that though I claimed a proof to FLT for the case n=3, no pathway to the proof by infinite descent was ever found. Many have searched for this proof, hoping to discover an Infinite Descent proof themselves, none have been successful.<br>..<br>However, as of late, the work of Socrates Ion has found this ancient proof, but NOT BY INFINITE DESCENT! The proof is static (<em>aka non-iterative</em>), and uses modular math, to prove the power quotient is an empty set.<br>..<br>Sound intriguing? it’s a pretty easy (stark) read, check it out.<br>..<br><a href="https://fermatstheory.wordpress.com/wp-content/uploads/2026/11/n3-stark-c2-1.pdf">A Fermatesque Proof of the Cubic form of Fermat’s Last Theorem (2 pages)</a><br>..<br>There is a secret hidden knowledge conferred at the end of the proof, regarding the general case. Perhaps the Illuminati will help you find the key.<br>..<br>The Illuminati challenge may be found at <a href="http://fermatstheory.wordpress.com/">FermatsTheory.Wordpress.com</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=2094a2e8ab0b" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Infinities]]></title>
            <link>https://medium.com/@pierre.fermat.1955/infinities-6a3bdd2d4603?source=rss-7f7427959633------2</link>
            <guid isPermaLink="false">https://medium.com/p/6a3bdd2d4603</guid>
            <category><![CDATA[george-gamow]]></category>
            <category><![CDATA[fermat]]></category>
            <category><![CDATA[number-theory]]></category>
            <category><![CDATA[cantor]]></category>
            <category><![CDATA[macro-number-theory]]></category>
            <dc:creator><![CDATA[Pierre Fermat]]></dc:creator>
            <pubDate>Tue, 29 Sep 2026 12:14:18 GMT</pubDate>
            <atom:updated>2026-10-04T18:40:19.071Z</atom:updated>
            <content:encoded><![CDATA[<p>Sept 9th, 2026<br>..<br>Certainly a philosophical topic, which the average human and grasp. Yet as we as humans chew on the problem of do animals have souls, are they self aware, and such, have we expressed the question to ourselves: “Can animals implicitly understand the concept of infinity?”<br>..<br>Appears I am meandering on the subject, back down to earth. From a mathematical perspective I have 3 or 4 insights into infinity, listed below:<br>..<br>i) The book “1, 2, 3 Infinity” by George Gamow.<br>ii) The work of Georg Cantor.<br>iii) My work resolving infinite P-adic modular sums, thus proving FLT.<br>iv) Comment by my engineering professor regarding Reimann.<br>..<br>At an early age of perhaps 6, I was introduced to the theory ofinfinite numbers by my dad, who was an engineer. Several years later when I was approximately 10 years of age, he let me read his paperback copy of “1, 2, 3 Infinity” by George Gamow. Over a period of perhaps 4 weeks, I learned of the work of Cantor, Einstein and others.<br>..<br>George Gamow was a Russian-born physicist and mathematician who excelled at taking complex technical subject matter, and explaining it lucidly to the general well educated public. His book was published in 1959.<br>..<br>My second copy of this book which I aquired about 10 years ago (used) is missing from my library presently, I suppose I’ll need to check with my son. Anyway, as I recall in the first 60 pages Gamow had written of the different levels of infinity, no doubt based on the work of Cantor several decades earlier. I found this to be quite interesting that there would be more than one infinity defined thru mathematical relationships, and the most astounding thought presented in this section of the book was that the greatest infinity level was that of squiggly lines of varying length and compound curves in 3 dimensional space, which would represent the highest possible infinity. At the time, I was both fascinated and skeptical. Gamow had also been able to explain both Einstein’s Special relativity and General relativity work quite lucidly using very simple math, which I felt very priviedged to have learned at such an early age.<br>..<br>Georg Cantor published several papers detailing the existence of multiple levels of infinities between 1874 and 1897, which was quite controversial to many mathematicians at that point in time. And rightly so, that his contemporaries would question his concepts.<br>‘’<br>One of the facts of interest is his coining the expression transinfinite, to describe the various infinite sets of numbers. And perhaps more telling of the man’s basis, is that he reserved the term infinite for God’s use alone, since God would be the final infinite being.<br>..<br>From my own perspective both views are correct, like the ying and the yang, or the 2 faces of the same coin. I perceive there can only be a single infinity, and yet at the same time, multiple levels of infinity may be practical in certain fields of mathematics.<br>..<br>For instance in engineering mathematics, when we look at a LaPlace transform, it is possibe to have multiple zeros in the denominator. And of course the reciprocal of zero is infinity, thus if there are two zeros in the denominator, the function must contain two infinities. Therefore to preserve the basis of the equation, at times it is necessary to consider that we may have infinity squared in the function.<br>..<br>On the other hand I am considerably bothered by the concept of raising infinity to the power of infinity, I can not perceive of a practical math equation which would make use of this monstrosity of an infinity concept.<br>..<br>On the subject of my own work addressing the infinite, I have two main works to present, first in a humorous vein is the dark entry portal into the <a href="http://fermatstheory.wordpress,com/">FermatsTheory.Wordpress.com</a> website, which asks the question of the unfortunate soul poised at the gate entry:<br>..<br>What is <strong><em>0^(–1) + 0^(–2), </em></strong>should the respondent have a reasonable good understanding of math, they may email the answer to the gatekeeper Socrates Ion. Now fortunately the gatekeeper allows considerable leeway in the respondents answer. Infinity, -Infinity, Infinity squared, or -Infinity squared, +/-Infinity, and so on and on, many answers are acceptable, as infinity itself is highly flexible. The second use of infinity is nested and protected deep within the website fortress, but fortunately for you my phantom reader, you may find the answer directly in the public domain on Academia.com, Zenodo, or Medium. The Medium blog page is relatively easy to access:<br>..<br><a href="https://medium.com/@d.ross.randolph345/a-fermat-germain-zsigmondy-hensel-teichmuller-solution-d8c22ae401f4">Fermat, Germain, Zsigmondy, Hensel, Teichmüller Solution</a><br>..<br>On this page, you will find <a href="https://fermatstheory.wordpress.com/wp-content/uploads/2026/09/a-structural-modular-solution-to-flt-r02.pdf">A Structural Modular Solution to Fermat’s Last Theory</a> (7 pages), which shows a method of an ascending P-Adic structure, which forces the Fermat’s Last Theory variables A, B and C to infinite absolute values. Pretty cool. An interesting observation, Fermat’s own N=4 proof is called a proof by “Infinite Descent”, serious misnomer. It actually ought to be referred to as a proof by “Finite Descent”. If you understand the proof you may be allowed to chuckle at this interesting semantics flaw. ON the other hand the above Stuctural Modular Solution is truly an infinite upwards iteration. And thus the 25 page “Infinity Proof to Fermat’s Last Theory” is aptly named. <br>..<br>iv) My college Laplace professor’s comment reagarding Reimann. In Reimann space the point at the top of the complex number sphere represents both +infinity and -infinity. The concept works well in the mathematics Reimann developed, though don’t try to convince your next Python computer program that X/0 is equal to +/-infinity.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6a3bdd2d4603" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Number Theory Anomalies]]></title>
            <link>https://medium.com/@pierre.fermat.1955/number-theory-anomalies-c58d828f837c?source=rss-7f7427959633------2</link>
            <guid isPermaLink="false">https://medium.com/p/c58d828f837c</guid>
            <category><![CDATA[number-theory]]></category>
            <category><![CDATA[analytic-number-theory]]></category>
            <dc:creator><![CDATA[Pierre Fermat]]></dc:creator>
            <pubDate>Tue, 29 Sep 2026 03:24:53 GMT</pubDate>
            <atom:updated>2026-09-29T03:24:53.850Z</atom:updated>
            <content:encoded><![CDATA[<p>Sept 28, 2026<br>..<br>Why is it called Fermat’s Last Theorem, and not Fermat’s Last Theory. Fermat was known to make an occasional mistake, and why do we use the term theorem, when there was never any written notes of any kind regarding this difficult number theory problem. We really should use the proper expression: Fermat’s Last Theory.<br>..<br>Mod, Modulus, Modular, and Modularity. How is it that the term modularity became hard linked to elliptic curves. Clearly if you have even the vaguest idea of how the European languages are all founded upon the ancient Greek prefix and suffix system, then common sense dictates that the term modularity is only applicable in the broader sense, that it applies to modulus analysis, and not just complex elliptic curves.<br>..<br>The Twin Prime Conjecture? When Hardy and Littlewood published their seminal work on the topic showing prime gaps density are all mathematically linked to one another, they indirectly proved the twin prime conjecture. But ahh, the human frailty and fear of repercussions, so now we have a weird way of analyzing infinity by breaking it in two, and looking at both sides of bounded infinity and unbounded infinity, way nutsy, from a common sense perspective.<br>..<br>And finally, is Fermat’s Last Theory really so hard to proved using real integer modulus analysis? Any high school student, unaware of the Wiles extremely abstruse proof, who looks at the formula A^P + B^P = C^P will tell you that common sense instructs us that there must be a reasonably simple way to show the proof, for the odd primes. And no doubt, based on the massive mathematics audience, it surely has been proved in the past successfully, but communications faltered to the general world view of the problem. Suppression of the basic proof has surely been going on for some time.<br>..<br>For a blast from the past see: <a href="http://fermatstheory.wordpress.com/"><strong>FermatsTheory.Wordpress.com</strong></a><br>..<br>and <a href="https://medium.com/@d.ross.randolph345/a-fermat-germain-zsigmondy-hensel-teichmuller-solution-d8c22ae401f4"><strong>Fermat, Germain, Zsigmondy, Hensel, Teichmüller Solution</strong></a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c58d828f837c" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>