Prove that if a prime number is a sum of three squares of different primes, then one of the primes must be equal to 3.

Printable View

- April 22nd 2010, 09:14 AMtarheelbornSum of three squares
Prove that if a prime number is a sum of three squares of different primes, then one of the primes must be equal to 3.

- April 22nd 2010, 11:26 AMundefined
I'm pretty sure the proof will rely on the properties of sums of two squares. Euler showed that an odd prime is the sum of two squares if and only if it is congruent to 1 (mod 4). Another result shows that the product of two numbers that can be expressed as a sum of two squares is itself a sum of two squares; that is, the set of such numbers is closed under multiplication. Combining these, a positive integer is expressible as a sum of two squares if an only if all of its prime factors that are congruent to 3 (mod 4) have even exponent.

EDIT: Since the numbers being squared are restricted to distinct primes, possibly the above isn't part of the proof. I forgot that restriction momentarily. - April 22nd 2010, 01:51 PMtarheelborn
Can you be more specific? Your answer was somewhat confusing. Sorry! I do appreciate your effort.