Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Another Project Euler problem has me checking the internet again. Among other conditions, four of my variables satisfy:

$$a^2+b^2+c^2=d^2 .$$

According to Wikipedia, this is known as a Pythagorean Quadruple. It goes on to say all quadruples can be generated from an odd value of $a$ and an even value of $b$ as:

$$c=\frac{a^2+b^2-p^2}{2}, \quad d=\frac{a^2+b^2+p^2}{2} ,$$

where $p$ is any factor of $a^2+b^2$ that satisfies $p^2<a^2+b^2$.

However, I can't see how or why this works. I also can't seem to see how this works for $\lbrace 4,4,7,9 \rbrace$. Am I missing something here?

share|cite|improve this question
If you've copied it correctly, then Wikipedia is wrong. Shocking, I know. – Gerry Myerson Oct 29 '11 at 9:20
A proof of a very similar expression of Pythagorean quadruples is given in Andreescu et al.: An Introduction to Diophantine Equations, Theorem 2.2.3, p.79. (They use the parametrization based on the two numbers from the quadruple which are even.) – Martin Sleziak Oct 29 '11 at 10:51
up vote 3 down vote accepted

I think $c$ and $d$ should have been $$ \begin{split} c &= \frac{a^2+b^2-p^2}{2 p}\qquad\qquad d &= \frac{a^2+b^2+p^2}{2 p} \end{split} $$

share|cite|improve this answer
I think that makes more sense. And it appears to work. Now to see if I can put that to use. Thanks. – Mike Oct 29 '11 at 14:11

According to this document a set of Pythagorean Quadruples is given by:





where $m,n,p$ are integers such that:

$m+n+p \equiv 1 (\mod 2) \land gcd(m,n,p)=1$

share|cite|improve this answer


I thought of extremely simple derivation of the parametrization of three squares which sum to square.

Suppose $a^2 + b^2 + c^2 = d^2$

then $a^2 + b^2 = d^2 - c^2$

As is well known, any number which is the sum of two squares is the product of only primes which are the sum of two squares.

We can thus easily derive from complex number arithmetic the parametrization of composite numbers which are the sum of two squares.

$$(a_1 + i b_1)(a_1-i b_1)(a_2 + i b_2)(a_2 - i b_2) = (a_1 + i b_1)(a_2 + i b_2) (a_1 - i b_1) (a_2 - i b_2)$$

$$(a_1^2 + b_1^2) (a_2^2 + b_2^2) = ( (a_1 a_2 - b_1 b_2) + i (a_1 b_2 + b_1 a_2) )( (a_1 a_2 - b_1 b_2) - i (a_1 b_2 + b_1 a_2) )$$

$$(a_1^2 + b_1^2) (a_2^2 + b_2^2) = (a_1 a_2 - b_1 b_2)^2 + (a_1 b_2 + b_1 a_2)^2$$

Also, since the product of two numbers if the difference of the squares of half their sum and half their difference,

$$(a_1^2 + b_1^2)(a_2^2 + b_2^2) = ((a_1^2 + b_1^2 + a_2^2 + b_2^2)/2)^2 - ((a_1^2 + b_1^2 - a_1^2 -b_1^2)/2)^2$$

Thus $$(a_1 a_2 - b_1 b_2)^2 + (a_1 b_2 + b_1 a_2)^2 = ((a_1^2 + b_1^2 + a_2^2 + b_2^2)/2)^2 - ((a_1^2 + b_1^2 - a_1^2 -b_1^2)/2)^2$$

$$(a_1 a_2 - b_1 b_2)^2 + (a_1 b_2 + b_1 a_2)^2 + ((a_1^2 + b_1^2 - a_1^2 -b_1^2)/2)^2 = ((a_1^2 + b_1^2 + a_2^2 + b_2^2)/2)^2$$

$(a_1 a_2 - b_1 b_2)^2 + (a_1 b_2 + b_1 a_2)^2$ not have remainder 2 when divided by 4.

That is why it is required that not both $(a_1 a_2 - b_1 b_2)$ and $(a_1 b_2 + b_1 a_2)$ be odd.


share|cite|improve this answer
Do you know that you can use TeX here? I added dollar signs and underscores so I could read what you wrote - I hope I put them all in the right places. – Gerry Myerson Aug 13 '12 at 3:02

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.