A Note on Fermat’s Last Theorem

1. Introduction

Fermat’s Last Theorem, first stated by its namesake Pierre de Fermat in the ${17}^{\mathrm{th}}$ century, it claims that there are no positive integer solutions to the equation $a^n+b^n=c^n$, whenever $n\in \mathbb{N}$ is greater than 2. In a margin note left on his copy of Diophantus’ Arithmetica, Fermat claimed that he had a proof which the margin was too small to contain [1]. Later mathematicians such Leonhard Euler and Sophie Germain made significant contributions to its study [2,3], and ${20}^{\mathrm{th}}$ contributions by Ernst Kummer proved the theorem for a specific class of numbers [4]. However, a complete solution remained out of reach.

Finally, in 1994, British mathematician Andrew Wiles announced a proof for Fermat’s Last Theorem. His work was complex and multifaceted, drawing on advance topics of mathematics such as elliptic curves, which were beyond the prevalent purview of knowledge during Fermat’s time. After some initial errors were addressed, Wiles’ work was hailed as the long-awaited proof of the Theorem [5] and described as a “stunning advance” in the citation for Wiles’s Abel Prize award in 2016. It also proved much of the Taniyama-Shimura conjecture, subsequently known as the modularity theorem, and opened up entire new approaches to numerous other problems and mathematically powerful modularity lifting techniques [6]. The techniques used by Wiles are ostensibly far from Fermat’s claimed proof in terms of extension, complexity and novelty of tools used−many of which were only available during the ${20}^{\mathrm{th}}$ century.

In this article, we present what we contend is a correct and short proof for Fermat’s Last Theorem. The degree of actual closeness it might have with Fermat’s own can only be speculated upon, but in our view simplicity was of paramount importance and we have deliberately eschewed techniques and results that were not available in the ${17}^{\mathrm{th}}$ century. The techniques developed here show promise for application to similar Diophantine equations and other problems in Number Theory such as the Beal conjecture, a well-known generalization of Fermat’s Last Theorem [7].

2. Background and Ancillary Results

As usual, $d\mid n$ stands for integer d divides integer n; and we denote by $gcd(a,b)$, the greatest common divisor of $a,b$ [8].

Proposition 1

([9]). Let $a,b,c\in \mathbb{N}$ greater than 1. If $a,b$ are coprime $(\mathit{i}.\mathit{e}.gcd(a,b)=1)$ and $a=b·c$, then $a\mid c$.

Proposition 2

([9]). Fermat’s little theorem states that if p is a prime number, then for any integer a, the following condition $p\mid a^p-a$ holds. In addition, if p does not divide a, then $p\mid a^{p-1}-1$ holds as well.

Proposition 3.

If n is a positive integer, then

$$x^n-y^n=(x-y)·\sum _{k=0}^{n-1}{x}^k·y^{n-1-k}.$$

Proof.

$$\begin{array}{cc}\hfill (x-y)·\sum _{k=0}^{n-1}{x}^k·y^{n-1-k}& =\sum _{k=0}^{n-1}{x}^{k+1}·y^{n-1-k}-\sum _{k=0}^{n-1}{x}^k·y^{n-k}\hfill \\ \hfill & =x^n+\sum _{k=1}^{n-1}{x}^k·y^{n-k}-\sum _{k=1}^{n-1}{x}^k·y^{n-k}-y^n\hfill \\ \hfill & =x^n-y^n.\hfill \end{array}$$

□

3. Main Result

Theorem 4.

The statement of Fermat’s Last Theorem is true.

Proof. 

We will proceed by contradiction. Aside from the fact that case $n=4$ was proven to have no solutions by Fermat himself, further simplifying assumptions at our disposal are:

• the consideration of an odd prime p as the selected exponent;
• the coprimality of $a,b,c$;
• and the condition $a,b,c>1$ on account of Catalan’s conjecture, proven by Mihăilescu in [10].

Therefore, the Diophantine equation whose positive integer solvability constitutes our hypothesis is, for a given fixed prime $p>2$,

$$a^p+b^p=c^p,\mathrm{where} a,b,c>1 \mathrm{and} a,b,c\in \mathbb{N} \mathrm{are} \mathrm{pairwise} \mathrm{coprime}.$$

(1)

Assume such $a,b,c$ exist.

Case 1:

Suppose that $a,b,c$ are pairwise coprime with p. Using the Proposition 2 we notice that

$$p\mid c^p-b^p-(c-b)\Rightarrow p\mid a^p-(c-b).$$

(2)

First we start with an equivalent expression of (1)

$$a^p=c^p-b^p.$$

Substituting $x=c$, $y=b$ and using that p is odd,

$$c^p-b^p=(c-b)·\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}=a^p$$

(3)

by Proposition 3. That is equivalent to

$$\begin{array}{cc}\hfill (c-b)·\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}& =(c-b)·\left(1-1+\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}\right)\hfill \\ \hfill & =(c-b)+(c-b)·\left(-1+\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}\right).\hfill \end{array}$$

So, we would have

$$(c-b)·\left(-1+\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}\right)=a^p-(c-b)$$

from (3). If the prime number p divides $(c-b)$, then $p\mid a^p$ and thus, a is divisible by p. If p does not divide a, then this implies

$$p\mid \left(-1+\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}\right)$$

according to Proposition 1 and properties of (2). However, we can see that

$$\begin{array}{cc}\hfill \left(-1+\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}\right)& =\left(c^{p-1}-1+b·\sum _{k=0}^{p-2}{c}^k·b^{p-2-k}\right)\hfill \\ \hfill & =\left(b^{p-1}-1+c·\sum _{k=0}^{p-2}{c}^k·b^{p-2-k}\right).\hfill \end{array}$$

We know that

$$p\mid c^{p-1}-1,p\mid b^{p-1}-1$$

by Proposition 2 since p and $c,b$ are pairwise coprime. Consequently, we obtain that ($p\mid {\sum }_{k=0}^{p-2}{c}^k·b^{p-2-k}$) or ($p\mid c$ and $p\mid b$) by Proposition 1. It is not possible that ($p\mid c$ and $p\mid b$) whenever p and $c,b$ are pairwise coprime and therefore, it would be necessary that ($p\mid {\sum }_{k=0}^{p-2}{c}^k·b^{p-2-k}$). In virtue of (3), we would have

$$\begin{array}{cc}\hfill (c-b)·\sum _{k=0}^{p-1}{c}^k·b^{p-1-k}& =(c-b)·\left(c^{p-1}+b^{p-1}+\sum _{k=0}^{p-2}{c}^k·b^{p-2-k}\right)\hfill \\ \hfill & =(c-b)·\left(2+\left(c^{p-1}-1+b^{p-1}-1\right)+\sum _{k=0}^{p-2}{c}^k·b^{p-2-k}\right)\hfill \end{array}$$

which is

$$(c-b)+(c-b)·\left(\left(c^{p-1}-1+b^{p-1}-1\right)+\sum _{k=0}^{p-2}{c}^k·b^{p-2-k}\right)=a^p-(c-b).$$

By Proposition 2 and (2), we can further deduce that a is divisible by p because p would divide $(c-b)$. Since $a,b,c$ are pairwise coprime with p, we reach a contradiction.

Case 2:

Suppose that $b,c$ are pairwise coprime with p and a is divisible by p. By Proposition 2, we can see that

$$p\mid a^p+b^p-(a+b)\Rightarrow p\mid c^p-(a+b).$$

(4)

Substituting $x=a$, $y=-b$ and using that p is odd,

$$a^p+b^p=(a+b)·\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}=c^p$$

(5)

by Proposition 3. That would be

$$\begin{array}{cc}\hfill (a+b)·\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}& =(a+b)·\left(1-1+\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}\right)\hfill \\ \hfill & =(a+b)+(a+b)·\left(-1+\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}\right).\hfill \end{array}$$

After that, we check

$$(a+b)·\left(-1+\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}\right)=c^p-(a+b)$$

from (5). If the prime number p divides $(a+b)$, then $p\mid c^p$ and thus, c is divisible by p. If p does not divide c, then this implies

$$p\mid \left(-1+\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}\right)$$

according to Proposition 1 and properties of (4). Nevertheless, we can see that

$$\left(-1+\sum _{k=0}^{p-1}{a}^k·{(-b)}^{p-1-k}\right)=\left(b^{p-1}-1+a^{p-1}+\sum _{k=0}^{p-2}{a}^k·{(-b)}^{p-2-k}\right).$$

We know that

$$p\mid a^{p-1},p\mid b^{p-1}-1$$

by Proposition 2 since $p\mid a$ and p and b are pairwise coprime. Consequently, we obtain that

$$p\mid \sum _{k=0}^{p-2}{a}^k·{(-b)}^{p-2-k}.$$

Hence, it is enough to show that

$$\sum _{k=0}^{p-2}{a}^k·{(-b)}^{p-2-k}=-b^{p-2}+a·m.$$

Since $p\mid a·m$, then we can further deduce that b is divisible by p due to $p\mid -b^{p-2}$. Since $b,c$ are pairwise coprime with p, we reach a contradiction.

Case 3:

Suppose that $a,c$ are pairwise coprime with p and b is divisible by p. Following the same steps as the above case mutatis mutandis, and exploiting the symmetry of the left-hand side of (1) with respect to a and b, we get another contradiction after of applying the same arguments to the value of b instead of choosing the number a as a multiple of p.

Case 4:

Suppose that $a,b$ are pairwise coprime with p and c is divisible by p. Same as Case 3.

Case 5:

Finally, we arrive at the following conclusion: Natural numbers $a,b,c$ share p as a common prime factor. However, this poses a contradiction with the pairwise coprimality of $a,b,c\in \mathbb{N}$ assumed from the outset in (1).

Thus our original assumption that (1) had positive integer solutions for prime $p>2$ has led to a final contradiction. □

4. Conclusions

This paper presents a new and concise proof of Fermat’s Last Theorem. We have shown that the equation:

$$a^n+b^n=c^n,$$

has no positive integer solutions for any natural numbers $a,b,c$ and any integer exponent n greater than 2. This accomplishment contributes to resolves a longstanding problem in Number Theory, first posed by Pierre de Fermat nearly 400 years ago in the ${17}^{\mathrm{th}}$ century. Our proof leverages the vast history of mathematical attempts to tackle this Theorem, offering a simpler and shorter approach compared to previous methods. This is the bona fide confirmation that the wealth of tools available in Fermat’s days was indeed enough to prove his seminal result, and it opens exciting avenues for further exploration. This successful proof of his eponymous conjecture vindicates the aforementioned potential of simple tools as applied to difficult problems.