Fermat's Two-Squares Theorem

The characterization that a prime p can be expressed as a sum of two integer squares precisely when p = 2 or p ≡ 1 (mod 4); extended to integers: an integer n is a sum of two squares iff every prime congruent to 3 (mod 4) appears with even exponent in n's prime factorization.