Uploaded March 2019 | Updated November 2026, 3 hours ago
FLT for powers of n odd, n greater than 2
X(n) + Y(n) = Z(n)
We can construct a right triangle with legs X(n/2), Y(n/2), Z(n/2)
We can label z(n/2) =C
So C(2) = Z(n) By re-arranging the formula we get Z=C(2)/Z(n-1) where C(2) and Z(n-1) are integer.
The claim is that Z must be irrational.
The proof of that is to claim Z is rational and prove a contradiction.
The proof is modeled after the proof that square root of 3 is irrational.
First, Z=C(2)/Z(n-1) is in simplest form.
Amuse Z(n-1), Z are even, then C(2) must also be even. This is a contradiction that Z. Z(n-1) , C(2) are simplest for, as the equation can be divided by 2 again.
Now assume that
Z(n-1), Z are odd, then C(2) must also be odd
Let C(2) = 2h +1 and Z(n-1) = 2k +1 where h,k are integer
(2h +1) = Z(2) ( 2k +1)
Now square the the entire equation
(2h +1) (2)= Z(4) ( 2k +1)(2)
expanding equation becomes
4h(2) + 4 h +1 = Z(4)(4k(2) + 4k + 1)
expanding rhs
4h(2) + 4 h +1 = Z(4)(4k(2) +Z(2) 4k + Z(2)
Subtract 1 from both sides
4h(2) + 4 h = Z(4)(4k(2) +Z(4) 4k + Z(4) – 1
Both LHS and RHS are even so we divide both sides by 2
2h(2) + 2 h = Z(2)(2k(2) +Z(2) 2k + (Z(2) – 1)/2
(Z(2) – 1)/2 IS ODD , SINCE Z(4) – 1 IS EVEN
But now it is apparent that LHS is even, but RHS is odd
So the assumption that Z is integer is false.
It should now be evident that the proof also works when the power n , when positive, also works.
This proves FLT, just as Fermat was able to prove for himself.
FLT for powers of n odd, n greater than 2
X(n) + Y(n) = Z(n)
We can construct a right triangle with legs X(n/2), Y(n/2), Z(n/2)
We can label z(n/2) =C
So C(2) = Z(n) By re-arranging the formula we get Z=C(2)/Z(n-1) where C(2) and Z(n-1) are integer.
The claim is that Z must be irrational.
The proof of that is to claim Z is rational and prove a contradiction.
The proof is modeled after the proof that square root of 3 is irrational.
First, Z=C(2)/Z(n-1) is in simplest form.
Amuse Z(n-1), Z are even, then C(2) must also be even. This is a contradiction that Z. Z(n-1) , C(2) are simplest for, as the equation can be divided by 2 again.
Now assume that
Z(n-1), Z are odd, then C(2) must also be odd
Let C(2) = 2h +1 and Z(n-1) = 2k +1 where h,k are integer
(2h +1) = Z(2) ( 2k +1)
Now square the the entire equation
(2h +1) (2)= Z(4) ( 2k +1)(2)
expanding equation becomes
4h(2) + 4 h +1 = Z(4)(4k(2) + 4k + 1)
expanding rhs
4h(2) + 4 h +1 = Z(4)(4k(2) +Z(2) 4k + Z(2)
Subtract 1 from both sides
4h(2) + 4 h = Z(4)(4k(2) +Z(4) 4k + Z(4) – 1
Both LHS and RHS are even so we divide both sides by 2
2h(2) + 2 h = Z(2)(2k(2) +Z(2) 2k + (Z(2) – 1)/2
(Z(2) – 1)/2 IS ODD , SINCE Z(4) – 1 IS EVEN
But now it is apparent that LHS is even, but RHS is odd
So the assumption that Z is integer is false.
It should now be evident that the proof also works when the power n , when positive, also works.
This proves FLT, just as Fermat was able to prove for himself.










