Possible Duplicate:
Prove that $n$ is a sum of two squares?
Fermat’s theorem on sums of two squares
Is there any elementary proof for this theorem: A number $n$ is a sum of two squares if and only if all prime factors of of the form $4k+3$ have even exponent in the prime factorization of $n$.