Fermat's Last Theorem, Simple Proof with Base Conversion?

by Tim Wuu

2 2
3 3
4 4
,
converting to base , [ ] [ ] [ ]
for 2, [ ] [100] [ ]
for 3, [ ] [1000] [ ]
for 4, [ ] [10000] [ ]
+ = >
+ =
= + =
= + =
= + =
n n n
n n n
y y y
y y y
y y y
y y y
x y z x y
y x y z
n x z
n x z
n x z


{ }
{ } { }
2
2 1 0 2 1 0 2
2
2 2
2 1 0
2 2
2
2 2 2 2 2
2 1 0 2 1 0 2 1 0
2 2
2 1 0
2 2
2 1 0
2
assuming has 3 digits in base ,
then [ ] , 0
let 2,
( )
[ ] 2[ ]
2[ ]
2 2[ ]
if 0
= = + + >
= = + A
= + + + A

= + + + + + A + A + +
= + + A + A
= A + + A + A
>
y
x y
x a a a a y a y a a
n z x
z a y a y a
z x
a y a y a a y a y a a y a y a
a y a y a
a y a y a
a
2 2 2
2 1 0
2 1 0
3 2 3
2 1 0
2
2
1 0
, 2 2[ ]
must equal to 0, so [ ]
let 3,
[( ) ]
for the same reason, 0
so [ ] for any
A + + A + A >
=
= = + A
= + + + A
=
= <
y
y
a y a y a y
a x a a
n z x
z a y a y a
a
x a a n x y


1 0 1 0 1 1
2 2 2 2 2 2 2
1 1 1 0 1 0 0 0
2 2 2 2 2
1 1 1 0 0 1 0 0
2 2 2 2 2
1 1 1 0 0 1 0 0
2 2
1 1 0
assuming converting to base , [ ] , [ ] ,
let 2
( ) 2( ) ( )
( ) (2 )
(( ) ) (2 )
(2 )
= = = + A
=
= + +
= + +
= + A + +
= A + A
y y
y x a a z b b b a
n
z x b a y b b a a y b a
b a y a a y a b b b
a a y a a y a b b b
a y a a y a
2 2
0 1 0 0
2 2 2 2 2
1 1 0 0 1 0 0
2 2 2 2 2 2
0 0
1 0
(2 )
+ ( ) ( ) (2 )
if 1, 0, 0, such that
must equal to 0, so [ ]
+ +
= A A + A + +
A > A > A > >
A =
y
b b b
a y a y y a y a b b b
y a y a z x y
z a b


We can notice that with base y, x and z has two digits. The highest digit of x and z are the same.
So basically there are only 3 unknown variables with at least (n+1) equations. It would be
difficult to find a solution for n>2.

3 3 2 2 3
3 3 2 2 3
3 2 2 3 3 2 2 3
2 2 3 2 2 3
2 2 3 2
if 3
[ ] [ ] [ ] [ (3 )(3 ) ]
[ ] [ ] [ ] [ (3 )(3 ) ]
[ (3 )(3 ) ] [1000] [ (3 )(3 ) ]
[(3 )(3 ) ] [1000] [(3 )(3 ) ]
[1(3 )(3 ) ] [(3 )(3
=
= =
= =
+ =
+ =
=
y y y y
y y y y
y y y
y y y
y
n
x ab ab ab a a b ab b
z ac ac ac a a c ac c
a a b ab b a a c ac c
a b ab b a c ac c
a b ab b a c
{ } { }
{ } { }
{ } { }
{ }
2 3
3 2 2 2 3 2 2 2 3
3 2 2 2 3 2 2 2 2 3 2
3 2 2 2 3 3 2 2 2 3 3
3 2 2 2 3 4 2 2
) ]
(3 ) (3 ) mod (3 ) (3 ) mod
(3 ) (3 ) mod (3 ) (3 ) mod
(3 ) (3 ) mod (3 ) (3 ) mod
(3 ) (3 ) mod (3 ) (
+ + + = + +
+ + + = + +
+ + + = + +
+ + + = +
y
ac c
y a b y ab y b y a c y ac y c y
y a b y ab y b y a c y ac y c y
y a b y ab y b y a c y ac y c y
y a b y ab y b y a c y
{ }
{ } { }
{ } { }
{ } { }
{ } { }
2 3 4
3 3
2 3 2 2 3 2
2 2 2 3 3 2 2 2 3 3
3 2 2 2 3 4 2 2 2 3 4
3 ) mod
mod mod
(3 ) mod (3 ) mod
(3 ) (3 ) mod (3 ) (3 ) mod
(3 ) (3 ) mod (3 ) (3 ) mod
4 equations with 3 variables
+
=
+ = +
+ + = + +
+ + + = + +
ac y c y
b y c y
ab y b y ac y c y
a b y ab y b y a c y ac y c y
y a b y ab y b y a c y ac y c y