Jump to content

Pythagorean prime

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 07:57, 5 March 2013 (2 is prime, and is the sum of two squares, but is not Pythagorean). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Pythagorean prime is a prime number of the form 4n + 1. Pythagorean primes are exactly the odd prime numbers that are the sum of two squares (and from this derives the name in reference to the famous pythagorean theorem.)

The first few Pythagorean primes are

5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, … (sequence A002144 in the OEIS).

Fermat's theorem on sums of two squares states that these primes can be represented as sums of two squares uniquely (up to order), and that no other primes can be represented this way, aside from 2=12+12. Thus these primes (and 2) occur as norms of Gaussian integers, while other primes do not.

The law of quadratic reciprocity says that if p and q are distinct odd primes, at least one of which is Pythagorean, then p is a quadratic residue mod q if and only if q is a quadratic residue mod p; by contrast, if neither p nor q is Pythagorean, then p is a quadratic residue mod q if and only if q is not a quadratic residue mod p.

In the field Z/p with p a Pythagorean prime, the polynomial x^2 = -1 has two solutions.