Fermat's Theorem on Sums of Two Squares

Fermat’s theorem on sums of two squares is a precise statement about which whole numbers can be written as the sum of two perfect square integers. In its classic form it says that an odd prime number can be expressed as the sum of two squares if and only if when you divide the prime by four the remainder is one; in other words the prime leaves a remainder of one when divided by four. More generally any positive integer whose prime factors of this congruence type appear with even exponent can also be written as a sum of two squares.

The importance of the theorem lies in how it links an algebraic property—being representable as a geometric figure made from two perpendicular unit lengths—to a purely arithmetic condition involving modular arithmetic. It opened the way for using complex numbers that have integer real and imaginary parts, now called Gaussian integers, to study ordinary whole numbers, and it illustrates the deeper principle that prime factorisation in extended number systems can explain classical Diophantine questions.

You will find this theorem resurfacing whenever mathematicians count lattice points on circles, classify quadratic forms, or explore the structure of algebraic integer rings. It is a cornerstone example in elementary introductions to algebraic number theory and appears in proofs about prime distribution, cryptographic constructions that rely on sums of squares, and even in certain physics problems where energy levels are modeled by two‑dimensional harmonic oscillators.