]> Number Fields - Pythagorean Triples

Pythagorean Triples

We wish to solve x 2 +y 2 =z 2 over the integers. Without loss of generality assume x,y,z have no common factor. This implies that z is odd (consider the equation modulo 4).

First we move to [i]:

(x+yi)(xyi)=z 2

Claim: x+yi=ua 2 where u is a unit and a[i].

Proof: Suppose a prime p divides x+yi. Then p divides z, thus p 2 must divide both sides. If p also divides xyi, then it must also divide their sum 2 x. But 2 x and z are coprime, implying p is a unit, which is a contradiction.

Hence we may write x+yi=u(m+ni) 2 , from which we obtain all solutions

{x,y,z}={±(m 2 n 2 ),±2 mn,±(m 2 +n 2 )}