Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

While I was surfing the web, searching things about math, I read something about a particular theorem of Fermat. It said: let $a$ and $b$ be rational. Then $a^4-b^4$ cannot equal the square of a rational number, so $a^4-b^4\neq c^2$ with $c$ rational. My question is: did I understand the theorem? if not, what is the actual theorem? if yes, how can I proof this or is that too difficult?

share|cite|improve this question
Yes, this is a theorem of Fermat, in the equivalent version that there are no non-trivial integer solutions. The proof is by Fermat's Method of Infinite Descent, a version of strong induction. It is one of the few number theoretic assertions of Fermat for which he sketched enough of a proof for us to know for sure how he did it. – André Nicolas Oct 29 '12 at 15:39
See my speculative reconstruction of Fibonacci's Lost Theorem $= \rm FLT_4$. – Bill Dubuque Oct 29 '12 at 17:45
up vote 2 down vote accepted

Yes, that is a theorem, No, it's not too difficult to prove, and you can try in some analytic number theory book for the proof, say in

or in

share|cite|improve this answer
thank you for the links – Badshah Oct 29 '12 at 15:31

That's right, modulo a small precision: Fermat proved that there are no solutions other than the obvious ones, such as $(a,b,c)=(0,0,0)$, $(1,0,1)$, etc.. See for instance this wikipedia page.

share|cite|improve this answer

Yes you understand the theorem. The proof uses the method of "infinite descent" (a sibling of reductio ad absurdum, or proof by contradiction).

There is a walkthrough proof here:-

But did you maybe want just a hint instead??

share|cite|improve this answer

If $b\neq 0$, yes, it's true. It follows from the fact that $$ a^4-b^4=c^2 $$ has no integer solutions, under the assumptions $\gcd(a,b)=1$ and $b\neq 0$. On the other hand, if $c,d$ are two coprime integers such that $c^2+d^2$ is a square, say $e^2$, than $e$ is the sum of two coprime squares. This is the key step of the proof.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.