ANALYTICAL SIMPLE PROOF OF FERMATS LAST THEOREM

RANBER SINGH
Abstract. We prove that if a and b are coprime positive integers such that
a
n
+ b
n
= c
n
where c and n 2 are positive integers, then either a or b is an
even integer and there exist another coprime positive integers d
1
and d
2
such
that (c d
1
)
n
+ (c d
2
)
n
= c
n
. For n=2, there are innitely many solutions
given as c = d
1
+ d
2
+ 2k
1
k
2
, d
1
=mk
2
1
and d
2
=
2
m
k
2
2
, where m=1 or 2 and
k
1
, k
2
are positive integers. However, for n 3, there exist no such positive
integers d
1
and d
2
. It means that a
n
+ b
n
= c
n
has no integer solutions for
n 3, which is the Fermats last theorem.
1. Introduction
For a
n
+ b
n
= c
n
, where a, b, c and n are positive integers, there is a famous
Fermats last theorem which states that no three positive integers a, b and c can
satisfy the equation a
n
+ b
n
= c
n
, for n 3. This theorem was rst conjectured
by Pierre de Fermat in 1637, in the margin of a copy of Arithmatica [1]. Fermat
claimed that he had a proof that was too large to t in the margin. However, there
is no published evidence of this proof. It is one of the most famous theorems in the
history of mathematics. It was among the most dicult mathematical problems
until 1995. In 1995, Wiles published a corrected proof of this theorem [3]. This proof
is basically a proof of the modularity theorem for semi-stable elliptic curves, which
together with Ribets theorem [2] provides a proof for the Fermats last theorem.
Here, we showed a simple proof of this theorem using the simple theorems of number
theory.
2. Main theorem
We prove that if a and b are coprime positive integers such that a
n
+ b
n
= c
n
where c and n 2 are positive integers, then either a or b is an even integer and there
exist another coprime positive integers d
1
and d
2
such that (cd
1
)
n
+(cd
2
)
n
= c
n
.
For n=2, there are innitely many solutions given as c = d
1
+d
2
+2k
1
k
2
, d
1
=mk
2
1
and d
2
=
2
m
k
2
2
, where m=1 or 2 and k
1
, k
2
are positive integers. However, for n 3,
there exist no such positive integers d
1
and d
2
. It means that a
n
+ b
n
= c
n
has no
integer solutions for n 3, which is the Fermats last theorem.
3. Proof of main theorem
Suppose there exist four positive integers a, b, c and n such that a
n
+ b
n
= c
n
.
If there are any common primes of a, b and c, they can be canceled on both sides
Date: August 22, 2014.
1991 Mathematics Subject Classication. 11D41.
Key words and phrases. Binomial theorem, fundamental theorem of airthmatic, prime
numbers.
1
2 RANBER SINGH
of the equation, a
n
+b
n
= c
n
. Therefore, without lose of generality we can assume
that a and b are coprime integers. Then, from the standard addition arithmetic,
we have c
n
> a
n
and c
n
> b
n
which implies that c > a and c > b. However, from
the binomial theorem we have
(3.1) (a + b)
n
= a
n
+ b
n
+
n1

i=1
_
n
i
_
a
ni
b
i
= c
n
+
n1

i=1
_
n
i
_
a
ni
b
i
,
where
_
n
i
_
are the binomial coecients dened as
_
n
i
_
= n!/[(i!)(n i)!]. Since
(3.2)
n1

i=1
_
n
i
_
a
ni
b
i
0,
therefore
(3.3) (a + b)
n
c
n
,
which implies that a + b c. This shows that there exist another positive integers
d
1
and d
2
such that c = a +d
1
for d
1
b and c = b +d
2
for d
2
a since c a +b.
Thus, we can write
(3.4) a
n
+ b
n
= (a + d
1
)
n
,
and
(3.5) a
n
+ b
n
= (b + d
2
)
n
,
Using the binomial theorem to expand the right-hand sides (RHS) of above equa-
tions, we have
(3.6) d
n
1
+
n1

i=1
_
n
i
_
a
i
d
ni
1
b
n
= 0,
and
(3.7) d
n
2
+
n1

i=1
_
n
i
_
b
i
d
ni
2
a
n
= 0
If d
1
= b, then we have
(3.8)
n1

i=1
_
n
i
_
a
i
d
ni
1
= 0.
It implies that n-1=0 or n=1. Thus, for the more general nontrivial case d
1
< b
for n 2. This shows that b cannot be equal to 1 for n 2 because d
1
and b are
non-zero positive integers. Similarly, if d
2
= a, then we have
(3.9)
n1

i=1
_
n
i
_
a
i
d
ni
2
= 0
It implies that n-1=0 or n=1. Thus, for the more general nontrivial case d
2
< a
for n 2. This shows that a cannot be equal to 1 for n 2 because d
2
and a are
non-zero positive integers.
From the equations (3.6) and (3.7) we have b
n
== 0( mod d
1
) and a
n
== 0(
mod d
2
). It means that b == 0( mod (rad(d
1
)) and a == 0( mod (rad(d
2
)).
ANALYTICAL SIMPLE PROOF OF FERMATS LAST THEOREM 3
Since gcd(a, b) = 1, therefore gcd(d
1
, d
2
) = 1. The rad and gcd stands for radical
and the greatest common divisor, respectively. Thus, we can write a
n
+b
n
= c
n
as
(3.10) (c d
1
)
n
+ (c d
2
)
n
= c
n
,
where gcd(d
1
, d
2
) = gcd(c, d
1
) = gcd(c, d
2
) = 1. As proved above using the bino-
mial theorem this equation implies that c d
1
+ c d
2
> c for n 2. Therefore,
c > d
1
+ d
2
. Suppose there exist a positive integer m such that c = d
1
+ d
2
+ m,
then above equation (3.10) can be written as
(3.11) (d
2
+ m)
n
+ (d
1
+ m)
n
= (d
1
+ d
2
+ m)
n
Simplifying this equation using the binomial theorem, we have
m
n
=
1
2
n(n 1)m
n2
[(d
1
+ d
2
)
2
(d
2
1
+ d
2
2
)]
+
1
6
n(n 1)(n 2)m
n3
[(d
1
+ d
2
)
3
(d
3
1
+ d
3
2
)]
+... + nm[(d
1
+ d
2
)
n1
(d
n1
1
+ d
n1
2
)] + [(d
1
+ d
2
)
n
(d
n
1
+ d
n
2
)]
m
n
= d
1
d
2
[n(n 1)m
n2
+
1
2
n(n 1)(n 2)m
n3
(d
1
+ d
2
) + ... +
nm
n2

i=1
_
n 1
i
_
d
ni2
1
d
i1
2
+
n1

i=1
_
n
i
_
d
ni1
1
d
i1
2
] (3.12)
For n = 2, we have m =

2d
1
d
2
. It implies that for n 3, we have m <

2d
1
d
2
for (d
1
+m)
n
+(d
2
+m)
n
= (d
1
+d
2
+m)
n
because (d
1
+d
2
+m)
n
is more strictly
increasing than (d
1
+m)
n
+(d
2
+m)
n
with increasing n for given d
1
and d
2
. Above
equation (3.12) also implies that m
n
== 0( mod d
1
d
2
). Thus, rad(m) = rad(d
1
d
2
)
because m
n
== 0( mod d
1
d
2
) and m

2d
1
d
2
.
The each term on the RHS of above equation (3.12) is even, therefore the left
hand side (LHS) should also be an even integer. It shows that the integer roots of
m from the above equation (3.12) have to be even integers. It is also directly clear
from the equation (3.11) that m is an even integer because d
1
and d
2
are coprime
integers. Since rad(m) = rad(d
1
d
2
), therefore either d
1
or d
2
is an even integer. It
means that either a or b is an even integer because m = a d
2
= b d
1
is an even
integer. According to the fundamental theorem of arithmetic, let d
1
and d
2
be
given as
(3.13) d
1
=

i
p

i
i
,
(3.14) d
2
=

j
p

j
j
,
where p
i
= p
j
for all i and j are the prime integers.
i
1,
j
1 are integers.
Then, we have
(3.15) m =

i,j
p

1i
i
p

1j
j
,
4 RANBER SINGH
where
1i
1 and
1j
1 are integers. Substituting these values of d
1
, d
2
and m
in the above equation (3.12), we have

i,j
p
n
1i

i
i
p
n
1j

j
j
= n(n 1)
_
_

i,j
p

1i
i
p

1j
j
_
_
n2
+
1
2
n(n 1)(n 2)
_
_

i,j
p

1i
i
p

1j
j
_
_
n3
_
_

i
p

i
i
+

j
p

j
j
_
_
+ ... +
n
_
_

i,j
p

1i
i
p

1j
j
_
_
[(n 1)

i
p

i
(n3)
i
+
1
2
(n 1)(n 2)

i,j
p

i
(n4)
i
p

j
j
+ ... + (n 1)

j
p

j
(n3)
j
] +
1
2
n(n 1)
_

i
p

i
i
_
n3
_
_

j
p

j
j
_
_
+ ... +
1
2
n(n 1)
_

i
p

i
i
_
_
_

j
p

j
j
_
_
n3
+ n
_
_

i
p

i
(n2)
i
+

j
p

j
(n2)
j
_
_

x,y
p
n
1x

x
x
p
n
1y

y
y
= n(n 1)
_

x,y
p

1x
(n2)
x
p

1y
(n2)
y
_
_
_

i=x,j=y
p

1i
(n2)
i
p

1j
(n2)
j
_
_
+
1
2
n
(n 1)(n 2)
_

x,y
p

1x
(n3)
x
p

1y
(n3)
y
_
_
_

i=x,j=y
p

1i
(n3)
i
p

1j
(n3)
j
_
_
_
_

x
p

x
x

i=x
p

i
i
+

y
p

y
y

j=y
p

j
j
_
_
+ ... + n
_

x,y
p

1x
x
p

1y
y
_
_
_

i=x,j=y
p

1i
i
p

1j
j
_
_
[(n 1)

x
p

x
(n3)
x

i=x
p

i
(n3)
i
+
1
2
(n 1)
(n 2)

x,y
p

x
(n4)
x
p

y
y

i=x,j=y
p

i
(n4)
i
p

j
j
+ ... + (n 1)

y
p

y
(n3)
y

j=y
p

j
(n3)
j
] +
1
2
n(n 1)
_

x,y
p

x
(n3)
x
p

y
y
_
_
_

i=x,j=y
p

i
(n3)
i
p

j
j
_
_
+... +
1
2
n(n 1)
_

x,y
p

x
x
p

y
(n3)
y
_
_
_

i=x,j=y
p

i
i
p

j
(n3)
j
_
_
+n
_
_

x
p

x
(n2)
x

i=x
p

i
(n2)
i
+

y
p

y
(n2)
y

j=y
p

j
(n2)
j
_
_
(3.16)
ANALYTICAL SIMPLE PROOF OF FERMATS LAST THEOREM 5
where x = i for n
1i

i
= 0 and y = j for n
1j

j
= 0. The LHS and each term
except the last term on the RHS of above equation is divisible by

x,y
p
x
p
y
. It
implies that the above equation may be true only when n == 0( mod (

x,y
p
x
p
y
))
because in the last term
_

x
p

x
(n2)
x

i=x
p

i
(n2)
i
+

y
p

y
(n2)
y

j=y
p

j
(n2)
j
_
is coprime to

x,y
p
x
p
y
. This imposes a strict condition on n which may satisfy
the above equation (3.16). Now we consider dierent cases of n
Case 1: n=2. In this case, we have
(3.17) m =
_
2d
1
d
2
We can write d
1
= m
1
k
2
1
and d
2
= m
2
k
2
2
, where k
2
1
(k
2
2
) and m
1
(m
2
) are the
squared and square-free integer factors of d
1
(d
2
), respectively. Since gcd(d
1
, d
2
) =
1, therefore gcd(m
1
k
1
, m
2
k
2
) = 1. It means that above equations are true for n = 2
only when d
1
= m
1
k
2
1
and d
2
=
2
m
1
k
2
2
, where m
1
=1, 2. Thus, for n=2 there are
innitely many integer solutions of a
n
+ b
n
= c
n
.
Case 2: n 3 odd integer. We can rewrite above equation (3.11) as
(d
1
+ d
2
+ m)
n
= (d
1
+ d
2
+ 2m)[(d
1
+ m)
n1
(d
1
+ m)
n2
(d
2
+ m)
+(d
1
+ m)
n3
(d
2
+ m)
2
... (d
1
+ m)(d
2
+ m)
n2
+(d
2
+ m)
n1
] (3.18)
As dened above, we have
(3.19) d
1
+ d
2
+ m = c
Therefore,
(3.20) d
1
+ d
2
+ 2m = c + m
Since rad(m) = rad(d
1
d
2
) and gcd(c, d
1
) = gcd(c, d
2
) = 1, therefore gcd(c, m) = 1.
It implies that d
1
+d
2
+2m = c+m cannot be integer factor of (d
1
+d
2
+m)
n
= c
n
.
It is a contradiction that the integer d
1
+d
2
+2m divides the RHS but not the LHS
of above equation (3.18). Thus, for odd n 3 there exist no d
1
and d
2
integers.
Case 3: n 4 even integer. In such a case, we can write n = l2
k
, where l is an
odd positive integer and k is any positive integer. The above equation (3.11) can
be rewritten as
(3.21) [(d
1
+ d
2
+ m)
2
k
]
l
= [(d
1
+ m)
2
k
]
l
+ [(d
2
+ m)
2
k
]
l
Subcase 3.1: k=1, l 3 odd integer such that n = 2l. In such a case, we
have
[(d
1
+ d
2
+ m)
2
]
l
= [(d
1
+ m)
2
+ (d
2
+ m)
2
]{[(d
1
+ m)
2
]
l1
[(d
1
+ m)
2
]
l2
(d
2
+ m)
2
+[(d
1
+ m)
2
]
l3
[(d
2
+ m)
2
]
2
... [(d
1
+ m)
2
][(d
2
+ m)
2
]
l2
+[(d
2
+ m)
2
]
l1
}
As we discussed above for n = 2, (d
1
+ m)
2
+ (d
2
+ m)
2
is an integer factor of
(d
1
+d
2
+m)
2
only when m =

2d
1
d
2
is an integer. However, for given d
1
, d
2
and
m =

2d
1
d
2
the above equation does not hold for l 3 odd integer.
Subcase 3.2: l=1, k 2 such that n = 2
k
. Since n == 0( mod (

x,y
p
x
p
y
)),
therefore only one of p
x
or p
y
is equal to 2 and rest all p
x
, p
y
are equal to 1 because
p
x
and p
y
are coprimes for all x and y. In such a case, let p
x
= 2 for some x, then
from above equation (3.16) we have
(3.22) 2
n
1x

x
> 2
k
(2
k
1)2

1x
(n2)
6 RANBER SINGH
(3.23) 2
n
1x

x
> 2
k
2
k1
2

1x
(n2)
(3.24) n
1x

x
> 2k 1 + n
1x
2
1x
(3.25)
1x
> k +
1
2
(
x
1)
It shows that
1x
has to be greater than k. Thus, each term except the last term
n
_

i
p

i
(n2)
i
+

j
p

j
(n2)
j
_
on the RHS of the above equation (3.16) is divisible
by 2
k+1
. It is a contradiction because the LHS of the above equation (3.16) is
divisible by 2
k+1
but the RHS is not divisible by 2
k+1
. It means that for n = 2
k
where k 2 integer, the equation
(3.26) (d
1
+ d
2
+ m)
2
k
= (d
1
+ m)
2
k
+ (d
2
+ m)
2
k
does not hold for any integer values of d
1
, d
2
and m. Thus, (d
1
+m)
2
k
+(d
2
+m)
2
k
cannot be an integer factor of (d
1
+ d
2
+ m)
2
k
for k 2.
Subcase 3.3: l 3 odd integer and k 2. We can rewrite the above equation
(3.11) as
[(d
1
+ d
2
+ m)
2
k
]
l
= [(d
1
+ m)
2
k
+ (d
2
+ m)
2
k
]{[(d
1
+ m)
2
k
]
l1
[(d
1
+ m)
2
k
]
l2
(d
2
+ m)
2
k
+[(d
1
+ m)
2
k
]
l3
[(d
2
+ m)
2
k
]
2
... [(d
1
+ m)
2
k
][(d
2
+ m)
2
k
]
l2
+[(d
2
+ m)
2
k
]
l1
}
However, we already proved above that (d
1
+ m)
2
k
+ (d
2
+ m)
2
k
is not an integer
factor of [(d
1
+d
2
+m)
2
k
] for k 2. Thus, (d
1
+m)
2
k
+(d
2
+m)
2
k
divides the RHS
but not the LHS of above equation. It is a contradiction. It means that integers d
1
and d
2
do not exist for n 4 even integers.
We have proved that for n 3 there exist no integers d
1
and d
2
which satisfy
the equation (3.10). Hence, the proof of main theorem.
References
[1] Paulo Ribenboim, 13 lectures on Fermats last theorem, Springer-Verlag New York Inc., New
York-Heidelberg, 1979.
[2] K. A. Ribet, From the Taniyama-Shimura conjecture to Fermats last theorem, Ann. Fac. Sci.
Toulouse Math. 11 (1990), 116139.
[3] Andrew Wiles, Modular elliptic curves and Fermats last theorem, Ann. Math. 141 (1995),
443551.
Institute of Physical Chemistry and Center for Computational Sciences, Johannes
Gutenberg University Mainz, Staudingerweg 9, D-55128 Mainz, Germany
E-mail address: ranber14@gmail.com