Submitted:
21 January 2026
Posted:
23 January 2026
Read the latest preprint version here
Abstract
In 1637, Pierre de Fermat asserted that the equation an + bn = cn has no positive integer solutions for any exponent n>2, famously claiming to possess a proof too large for the margin. Although Andrew Wiles established the theorem in 1994 using deep methods from algebraic geometry and modular forms, the possibility of a more elementary argument has remained a topic of enduring interest. In this work we present a classical proof of Fermat's Last Theorem for all exponents n ≥ 3. The argument reduces the general case to an odd prime exponent and then applies a structural result—Barlow's Relations—together with p-adic valuation techniques. These tools force any hypothetical solution to satisfy rigid algebraic and prime-divisor constraints that are mutually incompatible. The contradiction holds uniformly in all cases, thereby eliminating every possible solution. The proof relies solely on elementary number theory, factorization identities, and valuation arguments, offering a conceptually simple route to Fermat's Last Theorem that remains close to the arithmetic framework available in Fermat's time.
Keywords:
Fermat's equation
; Barlow's relations
; prime divisors
; lifting-the-exponent lemma
; p-adic valuation
; coprimality
MSC: 11D41; 11A41; 11A05; 11A07
1. Introduction
Fermat’s Last Theorem, first stated by Pierre de Fermat in the century, asserts that the Diophantine equation
has no solutions in positive integers whenever . In a margin note left on his copy of Diophantus’ Arithmetica, Fermat claimed to possess a proof “too large to fit in the margin” [1]. Over the centuries, mathematicians such as Euler [2], Sophie Germain [3], and Kummer [4] resolved important special cases, yet a complete proof remained elusive.
The modern breakthrough came in 1994, when Andrew Wiles established the full theorem using deep results from the theory of elliptic curves and modular forms [5]. His work, later strengthened by Ribet and others [6], revolutionized modern number theory and relied on sophisticated machinery far removed from the classical arithmetic methods available in Fermat’s time.
Despite this achievement, the search for an elementary proof—one relying only on classical number-theoretic tools—has persisted. Such a proof would illuminate the inherent arithmetic structure of the Fermat equation and provide insight into why the equation admits no nontrivial solutions.
In this article we present an elementary proof of Fermat’s Last Theorem for all exponents . The argument reduces the general case to an odd prime exponent and then applies a structural lemma—Barlow’s Relations—which describes the precise algebraic form that any hypothetical solution must satisfy. When combined with p-adic valuation techniques, these relations impose divisibility and size constraints that are mutually incompatible. The resulting contradiction eliminates all possible solutions, thereby establishing the theorem without recourse to modern analytic or geometric methods.
2. Background and Ancillary Results
As usual, we write to mean that the integer d divides the integer n, and to mean that n is not divisible by d. We denote by the greatest common divisor of a and b, and by the congruence of a and b modulo n (that is, ).
Definition 1
(p-adic valuation). Let p be a prime and . Thep-adic valuation, denoted , is the highest integer such that divides n. By convention, .
Lemma 1
(Lifting The Exponent Lemma (LTE) for odd primes [7]). Let p be an odd prime, , and . Write for the p-adic valuation.
- 1.
- Difference, coprime-to-p case. If and , then
- 2.
- Sum, coprime-to-p case (odd m). If , , and m is odd, then
Lemma 2
(Barlow’s Relations). Let p be an odd prime. Suppose there exist pairwise coprime positive integers satisfying
Then the integers must satisfy the following structural conditions:
- Case 1 (): There exist positive integers such that
-
Case 2 (): There exist positive integers and an integer such thatwith .
Furthermore, if for every prime q we have
and with the structural relations
we prove the inequality
Proof.
We use your detailed structural analysis and split into the two cases according to whether p divides c or not.
- 1.
- Factorization of
Write
where
Modulo , we have , hence
Let
Then . Since , we have , hence . Thus
Now we split into the two cases.
- Case 1:
From and , we have . If , then from the congruence above we get , hence
so , contradiction. Therefore
Since
is a perfect p-th power and the two factors are coprime, the valuation argument applies:
For any prime q,
Because , at most one of is nonzero. Thus each nonzero valuation is a multiple of p. Hence there exist integers such that
and then
So in Case 1 we already have
We now show that and are also perfect p-th powers.
- Factorizations of and
Write
where
Modulo , we have , hence
Let
Then . Since , we have , hence . Thus
From and , we have (otherwise would force , contradicting coprimality). Hence . If , then by LTE (difference case),
so , hence , contradiction. Thus
Since
is a perfect p-th power and the factors are coprime, the same valuation argument yields
A parallel argument applied to
gives
Thus in Case 1 we have shown:
as required.
- Case 2:
- Case 2:
Now suppose . Since , we must have and . From
and , we have . Applying LTE (sum case) with exponent p gives
But also
Let . Then
Write
with . From
for some integer with , we get
Since , we must have , and then
with . Because and is a perfect p-th power, the valuation argument shows that both M and N are perfect p-th powers. Thus there exist integers such that
with . Therefore
as claimed in Case 2.
The analysis of and proceeds exactly as in Case 1. The previous computations did not use the assumption ; they only used:
- to get ,
- and to rule out via LTE.
In Case 2 we still have and (since and ), so the same argument applies and yields
for some positive integers .
Thus in Case 2 we have shown:
with .
- A Key Inequality
Recall that from the structural relations we have , , ; write with . Pairwise coprimality of implies that are pairwise coprime. Moreover, because (or ) and .
From the three structural relations we obtain the linear identity
We first establish the auxiliary inequality
If , then and , so (2) holds with equality. But the case is impossible under our hypotheses: it would imply and , hence , contradicting . Thus in any admissible triple we have either or (or both). If both and , then and ; since for , inequality (2) holds. If one of equals 1 and the other is at least 2, say and , then . From the identity (obtained during the proof of the structural relations) we deduce , hence and consequently . Therefore
so (2) holds strictly. Thus in all admissible cases we have , with equality only when , which is excluded.
Next we use the elementary inequality for integers , which follows from Bernoulli’s inequality (or by induction). Applying it to gives
Combining (1), (2) and (3) we obtain
Hence
Since , we have , and (4) can be rewritten as
The equality case in (4) would require equality in both (2) and (3). Equality in (2) forces , which is impossible as noted. Therefore the inequality is strict:
This completes the proof of the key inequality. □
3. Main Result
This is the main theorem.
Theorem 1
(Fermat’s Last Theorem).
There exist no positive integers a, b, c, and n satisfying
when is an integer.
Proof.
Assume, for contradiction, that there exist positive integers with such that
- Step 1:
- Even exponents
Suppose first that n is even. If n is even but not divisible by 4, write with m odd. Then
Any prime divisor must be odd.
If instead m is even, say , then is divisible by 4. Fermat’s classical result for exponent 4 shows that
has no solutions in positive integers. Hence no solution exists for any exponent divisible by 4. Thus, after treating the case , it suffices to consider exponents having an odd prime divisor.
- Step 2:
- Reduction to an odd prime exponent
Let p be a prime divisor of n. By Step 1, we may assume , so p is an odd prime. Write with . Then
Set
Then
Dividing by their greatest common divisor, we may assume that are pairwise coprime. Thus we have reduced to the situation
- Step 3:
- Prime divisors of , , and
Let q be any prime divisor of , so . By coprimality of A and B, we have . Applying Lemma 1 (sum case) to , we get
Since , the left-hand side is . Thus
If , then , and hence
i.e. . If , then , and
In any case, every odd prime divisor q of divides C:
Similarly, let q be any odd prime divisor of , so . Since A and C are coprime, and . From
and applying Lemma 1 (difference case) to , we find
so , i.e. . Thus
Exchanging the roles of A and B, the same argument applied to
gives
Because the original equation preserves parity, these implications extend to the prime 2 as well (the parity of the three expressions is compatible). In particular, for all primes q we have
- if then ;
- if then ;
- if then .
- Step 4:
- Application of Barlow’s Relations and contradiction
We now apply Lemma 2 (Barlow’s Relations) to with exponent p. The hypotheses of that lemma are satisfied.
Hence there exist positive integers such that
Summing the three linear relations gives
Since , we have . Applying the Arithmetic Mean–Geometric Mean (AM–GM) inequality to the nonnegative reals :
Thus
since whenever . Combining this with (1):
When the exponent is , Bernoulli’s inequality takes its classical form. For any real number and any real exponent
we have
By Bernoulli’s inequality, we arrive at
since and . Hence, it is enough to show that
By Lemma 2, we can further deduce that
and therefore
which is impossible. This contradiction shows that no such (and hence no such with an odd prime divisor p) can exist under the stated conditions.
Together with the classical case and the analysis of even exponents, this establishes the theorem. □
4. Conclusions
We have given an elementary proof of Fermat’s Last Theorem for all integer exponents . After reducing to the case of an odd prime exponent, we applied Barlow’s Relations to any hypothetical solution. These relations force the quantities , , and to be perfect p-th powers (up to an explicit power of p in the case ), and the prime-divisor implications derived from the original equation impose strict divisibility constraints among these quantities.
The resulting system of relations is incompatible: in both cases and , the structural conditions lead to inequalities that cannot be simultaneously satisfied. Lemma 2 therefore rules out the existence of any triple satisfying under the required coprimality and prime-divisor conditions. Since every exponent reduces to such a prime exponent, no solution to can exist.
This proof relies solely on classical number-theoretic tools—factorization identities, p-adic valuations, and elementary divisibility arguments. It demonstrates that the Fermat equation contains within its own arithmetic structure the seeds of its impossibility, independent of the modern machinery used in Wiles’s proof. We hope that this approach contributes to a deeper understanding of the inherent rigidity of exponential Diophantine equations and encourages further exploration of classical methods in number theory.
Acknowledgments
The author would like to thank Iris, Marilin, Sonia, Yoselin, and Arelis for their support.
References
- Fermat, P.d. Oeuvres de Pierre de Fermat; Vol. 1, Gauthier-Villars: Paris, France, 1891.
- Euler, L. Elements of Algebra; Springer Science & Business Media: New York, United States, 2012. [CrossRef]
- Germain, S. Oeuvres philosophiques de Sophie Germain; Collection XIX: Paris, France, 2016.
- Kummer, E.E. Zur Theorie der complexen Zahlen 1847. [CrossRef]
- Wiles, A. Modular elliptic curves and Fermat’s Last Theorem. Annals of mathematics 1995, 141, 443–551. [CrossRef]
- Ribet, K.A. Galois representations and modular forms. Bulletin of the American Mathematical Society 1995, 32, 375–402. [CrossRef]
- Manea, M. Some an ± bn Problems in Number Theory. Mathematics Magazine 2006, 79, 140–145. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.