# Short Proof of FLT

## Main Question or Discussion Point

I've been enormously impressed with the core members of this forum, especially hurkyl. There was a guy who claimed to have a proof of FLT, and hurkyl and others gave him a lot of time over two weeks and were much more fair to him than he deserved. Since I'm hoping to get a fair hearing for my own claim, I decided to post here.

I have a proof, using only high school algebra and elementary number theory, that I believe to be valid for all odd values of n, n being the common exponent. It's clear, simple, and perhaps even a bit elegant. It took me far too long to find, but hey, it's a tough problem.

I'd like to share it with everyone here and invite intelligent comments. However, I'd prefer to post the proof on my own blog, and then discuss specific details here if necessary. Does that sound like a good way to do it?

Related Linear and Abstract Algebra News on Phys.org
if you actually have a proof like that, just post it wherever you want.

Hey there, I have a proof that I believe works for $n=3$ and is equally elegant, though I failed to extend it to all odd numbers of $n$ (especially since $n=1$ of FLT is obviously false, i.e. $x^1+y^1=a^1$ has solutions). Here it goes:

Proof of Fermat's Last Theorem for $n=3$

Suppose $x$, $y$, and $a$ are some natural number solutions to the equation $x^3+y^3=a^3$.
Let $b=x+y$ for some natural number $b$ ($x$ and $y$ are by assumption both natural numbers, which are closed under addition). Then $y=-x+b$.

$x^3+y^3=a^3$
$x^3+(-x+b)^3=a^3$
$x^3-x^3+3x^2b-3xb^2+b^3=a^3$
$3bx^2-3b^2x+(b^3-a^3)=0$

By the quadratic formula (solving in terms of $b$ and $a$):

$x=\frac{3b^2\pm\sqrt{9b^4-12b^4+12ba^3}}{6b}$=$\frac{3b^2\pm\sqrt{-3b^4+12ba^3}}{6b}$

We now seek to express b and a in the expression above once again in terms of $x$ and $y$.

$-3b^4=-3(x+y)^4=-3(x^4+4x^3y+6x^2y^2+4xy^3+y^4)$
$=-3x^4-12x^3y-18x^2y^2-12xy^3-3y^4$

$12ba^3=12x^4+12x^3y+12xy^3+12y^4$

$-3b^4+12ba^3=9x^4-18x^2y^2+9y^4=3^2(x^2-y^2)^2$

We rewrite the first expression for x above as follows:

$x=\frac{3(x^2+y^2 )\pm\sqrt{3^2(x^2-y^2)^2}}{6(x+y)}$=$\frac{3(x^2+y^2)\pm3(x^2-y^2)}{6(x+y)}$=$\frac{(x^2+y^2)\pm(x^2-y^2)}{2(x+y)}$

The two solutions then are $x=\frac{x^2}{(x+y)}$ and $x=\frac{y^2}{(x+y)}$.

The first reduces to $x^2+xy=x^2$ or simply $xy=0$. However, $x$ and $y$ must be natural numbers, neither being 0, so there are no solutions from this first equation which fit our assumption.

The second reduces to $x^2+xy-y^2=0$. By applying the quadratic formula again, solving for $x$ in terms of $y$, we have $x=\frac{-y\pm\sqrt{5x^2}}{2}$.

This reduces to $x=(\frac{(-1+\sqrt{5})}{2})y$ and $(\frac{(-1-\sqrt{5})}{2})y$.

Clearly, both $x$ and $y$ cannot be natural numbers if one is an irrational expression, for an irrational expression times a natural number expression produces an irrational product.

Since we assumed $x$, $y$, and $a$ to be natural number solutions to the equation $x^3+y^3=a^3$, but found that they could not be such, we are forced to conclude that the equation $x^n+y^n=a^n$ has no natural number solutions for $n=3$.

Last edited:
HallsofIvy
Homework Helper
Fermat himself produced a proof for n= 3. And, I believe, the proof for n odd is also old.

Fermat himself produced a proof for n= 3. And, I believe, the proof for n odd is also old.
Hmm, Fermat proved the case n=4. It was Euler who proved n=3, but his proof contained a major gap.
It can easily be shown that FLT only needs to be proven for odd primes (since if n=de is composite and if $x^n+y^n=z^n$, then $(x^d)^e+(y^d)^e=(z^d)^e$. So the proof for odd primes is the hardest part and was only completed by Wiles.

We rewrite the first expression for x above as follows:

$x=\frac{3(x^2+y^2 )\pm\sqrt{3^2(x^2-y^2)^2}}{6(x+y)}$=$\frac{3(x^2+y^2)\pm3(x^2-y^2)}{6(x+y)}$=$\frac{(x^2+y^2)\pm(x^2-y^2)}{2(x+y)}$
This is incorrect. You have said that $3b^2=3(x^2+y^2)$ which is of course false.

Fermat himself produced a proof for n= 3. And, I believe, the proof for n odd is also old.

No, Fermat produced a proof for n=4. Euler was the first to prove it for n=3.

There's no old proof for all odd n, only some for specific or limited values of n.

Wiles' proof is newer, and claims to be valid for all n>2. (I've read that he had to prove 3 and 4 as special cases, with his general proof being sufficient for 5 and above.)

This is incorrect. You have said that $3b^2=3(x^2+y^2)$ which is of course false.
Thanks for pointing that out! I don't have time at the moment, but I'll see if I can still obtain an answer after fixing it.

No, Fermat produced a proof for n=4. Euler was the first to prove it for n=3.

There's no old proof for all odd n, only some for specific or limited values of n.

Wiles' proof is newer, and claims to be valid for all n>2. (I've read that he had to prove 3 and 4 as special cases, with his general proof being sufficient for 5 and above.)
There have definitely been many proofs of the first few $n$s, but it would be amazing we could all agree if a simpler proof than Wiles's could be found.

Thanks for pointing that out! I don't have time at the moment, but I'll see if I can still obtain an answer after fixing it.

There have definitely been many proofs of the first few $n$s, but it would be amazing we could all agree if a simpler proof than Wiles's could be found.
I checked it out, and with that error remedied, my proof doesn't amount to anything. (You just get 0=0). Sorry I missed that mistake and thanks for correcting it for me :/

See, Middle C? These guys are great. That's why I came here.

By the way, I also have a complete elementary proof for Case 1, in which none of x,y, or z are divisible by n. I'd forgotten about that one.

I'll be posting a link soon.

By the way, I also have a complete elementary proof for Case 1, in which none of x,y, or z are divisible by n. I'd forgotten about that one.
I forgot about that proof for good reason. It's a proof of case 1 for n=3, which is nothing extraordinary. I did use congruences, though, which I thought was interesting.

As I said, I'll be posting a link to my other proof soon.

See, Middle C? These guys are great. That's why I came here.
You've got that right (yourself included).

I have always believed that a "simple" proof of FLT should exist (be able to be developed) - a page or two, say, that anyone can understand.
But, if someone here has developed such a proof, would it not be a momentous article worthy of publication and fanfare!? It seems that such a proof should first be published in a pretigious journal. Anyone's thoughts?

Last edited:
I have always believed that a "simple" proof of FLT should exist (be able to be developed) - a page or two, say, that anyone can understand.
But, if someone here has developed such a proof, would it not be a momentous article worthy of publication and fanfare!? It seems that such a proof should first be published in a pretigious journal. Anyone's thoughts?
Fermat's claim dates from 1637. In my opinion it's incredibly unlikely that the greatest mathematicians in the world missed an elementary proof for 374 years. It's just not a credible possibility.

It will be interesting to see how Wiles's proof gets boiled down and streamlined over the next few years and decades. But a proof based on elementary algebraic manipulations is just not possible. Someone would have found it.

I have always believed that a "simple" proof of FLT should exist (be able to be developed) - a page or two, say, that anyone can understand.
But, if someone here has developed such a proof, would it not be a momentous article worthy of publication and fanfare!? It seems that such a proof should first be published in a pretigious journal. Anyone's thoughts?
Read "Rational points on elliptic curves" by Silverman and Tate. That ought to convince you that Fermat's last theorem is far from a trivial statement. Thus the proof should be expected to be far from trivial too!!

... Thus the proof should be expected to be far from trivial too!!
So, to my question, you're implying that it would be a momentous finding worthy of prestigious publication.

So, to my question, you're implying that it would be a momentous finding worthy of prestigious publication.
If you would find an elementary proof of FLT, then you will become a world-famous mathematician instantly, yes. But I'm quite certain that such an elementary proof does not exist.

I don't know if this is the right place to post this or if this should be in a new topic, but it relates to someone claiming to have rediscovered Fermat's original proof or, at least, making a short proof with only the mathematics known in Fermat's time.

A user of Youtube by the name of michaelcweir claims to have proven Fermat's Last Theorem using Diophantine equations. His video is http://www.youtube.com/watch?v=gwbHORdjcbQ", for everything.

Could anyone verify that this is, indeed, a valid proof of Fermat's Last Theorem, or, if not, tell me what's wrong with it?

Last edited by a moderator:
tell me what's wrong with it?
A quick look at the proposed proof: I see a statement in his proof, "a whole number raised to a non-whole number is an non-number number." Hmm. I think he means a non-whole number. Let me see. 4 is a whole number. 1/2 is a non-whole number. If I raise 4 to 1/2 I usually get 2, a whole number. So this part of the proposed proof is rather doubtful. I didn't study the whole proof, but this point makes me not want to bother. Maybe there is something in the context that makes his statement true in that interpretation ????.

I don't know if this is the right place to post this or if this should be in a new topic, but it relates to someone claiming to have rediscovered Fermat's original proof or, at least, making a short proof with only the mathematics known in Fermat's time.

A user of Youtube by the name of michaelcweir claims to have proven Fermat's Last Theorem using Diophantine equations. His video is http://www.youtube.com/watch?v=gwbHORdjcbQ", for everything.

Could anyone verify that this is, indeed, a valid proof of Fermat's Last Theorem, or, if not, tell me what's wrong with it?
The proof is wrong. First of all, he starts by assuming $n\geq 3$, but then he draws his number line and does all his calculations for n=1 and n=2. This doesn't make much sense to me...

Also, he proceeds by contradiction, and he assumes that $x^n+y^n=z^n$, but he never actually does something with this... This is a big indication that it's just nonsense.

And also, he never uses Diophantine equations in his proof... And fourth, Fermat's original idea was to prove this by infinite descent, since the guy doesn't use infinite descent here, this cannot be the original proof of Fermat.

Last edited by a moderator: