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

I would like to know any way of solving the diophantine equation $x^4+y^4=2z^2$. Or ideas that seem worth trying out.

By solving I mean fining all solutions and proving there are no more.

Keith Conrad showed how to reduce this equation to a different one which was solved by Fermat in his notes about Fermat descent, other than I have no ideas how to solve it. I tried to do descent on it directly but that seems completely impossible so I am interested in other techniques. Thanks very much.

share|cite|improve this question
page 451 of Number Theory: Analytic and modern tools by Henri Cohen shows how to reduce it to an elliptic curve. – quanta Mar 12 '11 at 22:05
up vote 3 down vote accepted

A quick spot of googling found Two fourths and a square.

Look at pattern six: the unique coprime solution is $1^4+1^4=2 \cdot 1^2 .$

share|cite|improve this answer
Strictly that is the unique coprime solution. So the complete solution is $(x,y,z) = (n, \pm n, \pm n^2)$ for any integer $n$ – Henry Mar 12 '11 at 20:16
@Henry: Yes, I meant coprime solution, though I should have stated it explicitly. – Derek Jennings Mar 12 '11 at 20:38

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.