Pythagorean prime

{{redirect|Pythagorean number|the field invariant related to sums of squares|Pythagoras number|elements of extension fields containing square roots of sums of squares|Pythagorean field}}

File:Squared right triangle.svgs with integer legs. The formulas show how to transform any right triangle with integer legs into another right triangle with integer legs whose hypotenuse is the square of the first triangle's hypotenuse.]]

A Pythagorean prime is a prime number of the {{nowrap|form $4n+1$ .}} Pythagorean primes are exactly the odd prime numbers that are the sum of two squares; this characterization is Fermat's theorem on sums of two squares.

Equivalently, by the Pythagorean theorem, they are the odd prime numbers $p$ for which $\sqrt p$ is the length of the hypotenuse of a right triangle with integer legs, and they are also the prime numbers $p$ for which $p$ itself is the hypotenuse of a primitive Pythagorean triangle. For instance, the number 5 is a Pythagorean prime; $\sqrt5$ is the hypotenuse of a right triangle with legs 1 and 2, and 5 itself is the hypotenuse of a right triangle with legs 3 and 4.

Values and density

The first few Pythagorean primes are

{{bi|left=1.6|5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, ... {{OEIS|id=A002144}}.}}

By Dirichlet's theorem on arithmetic progressions, this sequence is infinite. More strongly, for each $n$ , the numbers of Pythagorean and non-Pythagorean primes up to $n$ are approximately equal. However, the number of Pythagorean primes up to $n$ is frequently somewhat smaller than the number of non-Pythagorean primes; this phenomenon is known as {{nowrap|Chebyshev's bias.{{r|rubsar}}}} For example, the only values of $n$ up to 600000 for which there are more Pythagorean than non-Pythagorean odd primes less than or equal to n are 26861 {{nowrap|and 26862.{{r|gramar}}}}

Representation as a sum of two squares

The sum of one odd square and one even square is congruent to 1 mod 4, but there exist composite numbers such as 21 that are {{nowrap|1 mod 4}} and yet cannot be represented as sums of two squares. Fermat's theorem on sums of two squares states that the prime numbers that can be represented as sums of two squares are exactly 2 and the odd primes congruent to {{nowrap|1 mod 4.{{r|stewart}}}} The representation of each such number is unique, up to the ordering of the two squares.{{r|leveque}}

By using the Pythagorean theorem, this representation can be interpreted geometrically: the Pythagorean primes are exactly the odd prime numbers $p$ such that there exists a right triangle, with integer legs, whose hypotenuse has {{nowrap|length $\sqrt p$ .}} They are also exactly the prime numbers $p$ such that there exists a right triangle with integer sides whose hypotenuse has {{nowrap|length $p$ .}} For, if the triangle with legs $x$ and $y$ has hypotenuse length $\sqrt p$ (with $x>y$ ), then the triangle with legs $x^2-y^2$ and $2xy$ has hypotenuse {{nowrap|length $p$ .{{r|stillwell}}}}

Another way to understand this representation as a sum of two squares involves Gaussian integers, the complex numbers whose real part and imaginary part are both {{nowrap|integers.{{r|mazur}}}} The norm of a Gaussian integer $x+iy$ is the {{nowrap|number $x^2+y^2$ .}} Thus, the Pythagorean primes (and 2) occur as norms of Gaussian integers, while other primes do not. Within the Gaussian integers, the Pythagorean primes are not considered to be prime numbers, because they can be factored as

$p=(x+iy)(x-iy).$

Similarly, their squares can be factored in a different way than their integer factorization, as

$\begin{align}
p^2&=(x+iy)^2(x-iy)^2\\
&=(x^2-y^2+2ixy)(x^2-y^2-2ixy).\\
\end{align}$

The real and imaginary parts of the factors in these factorizations are the leg lengths of the right triangles having the given hypotenuses.

Quadratic residues

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 {{nowrap|mod $q$ }} if and only if $q$ is a quadratic residue {{nowrap|mod $p$ ;}} by contrast, if neither $p$ nor $q$ is Pythagorean, then $p$ is a quadratic residue {{nowrap|mod $q$ }} if and only if $q$ is not a quadratic residue {{nowrap|mod $p$ .{{r|leveque}}}}

In the finite field $\Z/p$ with $p$ a Pythagorean prime, the polynomial equation $x^2=-1$ has two solutions. This may be expressed by saying that $-1$ is a quadratic residue {{nowrap|mod $p$ .}} In contrast, this equation has no solution in the finite fields $\Z/p$ where $p$ is an odd prime but is not {{nowrap|Pythagorean.{{r|leveque}}}}

File:Paley13.svg

For every Pythagorean prime $p$ , there exists a Paley graph with $p$ vertices, representing the numbers {{nowrap|modulo $p$ ,}} with two numbers adjacent in the graph if and only if their difference is a quadratic residue. This definition produces the same adjacency relation regardless of the order in which the two numbers are subtracted to compute their difference, because of the property of Pythagorean primes that $-1$ is a quadratic {{nowrap|residue.{{r|chung}}}}

References

{{reflist|refs=

{{citation

| last = Chung | first = Fan R. K. | author-link = Fan Chung

| isbn = 9780821889367

| pages = 97–98

| publisher = American Mathematical Society

| series = CBMS Regional Conference Series

| title = Spectral Graph Theory

| url = https://books.google.com/books?id=YUc38_MCuhAC&pg=PA97

| volume = 92

| year = 1997}}

{{citation

| last1 = Granville | first1 = Andrew | author1-link = Andrew Granville

| last2 = Martin | first2 = Greg

| date=January 2006

| doi = 10.2307/27641834

| title = Prime number races

| journal = The American Mathematical Monthly

| volume = 113 | issue = 1 | pages = 1–33

| url = http://www.dms.umontreal.ca/%7Eandrew/PDF/PrimeRace.pdf

| jstor = 27641834}}

{{citation

| last = LeVeque | first = William Judson | author-link = William J. LeVeque

| isbn = 9780486689067

| pages = 100, 103, 183

| publisher = Dover

| title = Fundamentals of Number Theory

| url = https://books.google.com/books?id=F6aJtNcwyw8C&pg=PA183

| year = 1996}}

{{citation

| last = Mazur | first = Barry | author-link = Barry Mazur

| editor-last = Gowers | editor-first = Timothy | editor-link = Timothy Gowers

| contribution = Algebraic numbers [IV.I]

| isbn = 9781400830398

| pages = 315–332

| publisher = Princeton University Press

| title = The Princeton Companion to Mathematics

| year = 2010}} See in particular section 9, "Representations of Prime Numbers by Binary Quadratic Forms", [https://books.google.com/books?id=ZOfUsvemJDMC&pg=PA325 p. 325].

{{citation

| last1 = Rubinstein | first1 = Michael

| last2 = Sarnak | first2 = Peter

| doi = 10.1080/10586458.1994.10504289

| issue = 3

| journal = Experimental Mathematics

| pages = 173–197

| title = Chebyshev's bias

| volume = 3

| year = 1994}}

{{citation

| last = Stewart | first = Ian | author-link = Ian Stewart (mathematician)

| isbn = 9780465082377

| page = 264

| publisher = Basic Books

| title = Why Beauty is Truth: A History of Symmetry

| url = https://books.google.com/books?id=6akF1v7Ds3MC&pg=PA264

| year = 2008}}

{{citation

| last = Stillwell | first = John | author-link = John Stillwell

| isbn = 9780387955872

| page = 112

| publisher = Springer

| series = Undergraduate Texts in Mathematics

| title = Elements of Number Theory

| url = https://books.google.com/books?id=LiAlZO2ntKAC&pg=PA112

| year = 2003}}

}}

External links

{{citation|last=Eaves|first=Laurence|title=Pythagorean Primes: including 5, 13 and 137|url=http://www.numberphile.com/videos/pythagorean_primes.html|work=Numberphile|publisher=Brady Haran|authorlink=Laurence Eaves|access-date=2013-04-02|archive-url=https://web.archive.org/web/20160319164414/http://www.numberphile.com/videos/pythagorean_primes.html|archive-date=2016-03-19|url-status=dead}}
{{OEIS el|A007350|name=Where prime race 4n-1 vs. 4n+1 changes leader}}

Category:Classes of prime numbers

Category:Eponymous numbers in mathematics

Category:Squares in number theory