Pythagorean prime: Difference between revisions
m →Representation as a sum of two squares: but we do need odd here |
re-illustrate; expand Gaussian integers |
||
| Line 1: | Line 1: | ||
{{Refimprove|date=November 2007}} |
{{Refimprove|date=November 2007}} |
||
{{redirect|Pythagorean number|the field invariant related to sums of squares|Pythagoras number}} |
{{redirect|Pythagorean number|the field invariant related to sums of squares|Pythagoras number}} |
||
[[File:Squared right triangle.svg|thumb|360px|The Pythagorean prime 5 and its square root are both hypotenuses of integer-sided [[right triangle]]s.]] |
|||
| ⚫ | |||
A '''Pythagorean prime''' is a [[prime number]] of the form 4''n'' + 1. Pythagorean primes are exactly the odd prime numbers that are the sum 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 sides, and they are also the prime numbers ''p'' for which ''p'' itself is the hypotenuse of a [[Pythagorean triangle]]. For instance, the number 5 is a Pythagorean prime; {{sqrt|5}} is the hypotenuse of a right triangle with sides 1 and 2, and 5 itself is the hypotenuse of a right triangle with sides 3 and 4. |
||
==The sequence of Pythagorean primes== |
==The sequence of Pythagorean primes== |
||
| Line 8: | Line 11: | ||
==Representation as a sum of two squares== |
==Representation as a sum of two squares== |
||
[[Fermat's theorem on sums of two squares]] states that these primes can be represented as sums of two squares uniquely (up to |
[[Fermat's theorem on sums of two squares]] states that these primes can be represented as sums of two squares uniquely (up to the ordering of the two squares), and that no other primes can be represented this way, aside from 2 = 1<sup>2</sup> + 1<sup>2</sup>. |
||
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 sides, whose [[hypotenuse]] has length {{sqrt|''p''}}. They are also exactly the prime numbers ''p'' such that there exists a right triangle with integer sides whose hypotenuse has length ''p''. For, if the triangle with sides ''x'' and ''y'' has hypotenuse length {{sqrt|''p''}} (with ''x'' > ''y''), then the triangle with sides ''x''<sup>2</sup> − ''y''<sup>2</sup> and 2''xy'' has hypotenuse length ''p''. |
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 sides, whose [[hypotenuse]] has length {{sqrt|''p''}}. They are also exactly the prime numbers ''p'' such that there exists a right triangle with integer sides whose hypotenuse has length ''p''. For, if the triangle with sides ''x'' and ''y'' has hypotenuse length {{sqrt|''p''}} (with ''x'' > ''y''), then the triangle with sides ''x''<sup>2</sup> − ''y''<sup>2</sup> and 2''xy'' has hypotenuse length ''p''. |
||
Another way to understand this representation as a sum of two squares involves [[Gaussian integer]]s, the [[complex number]]s whose real part and imaginary part are both integers. |
|||
The norm of a Gaussian integer ''x'' + ''yi'' is the number ''x''<sup>2</sup> + ''y''<sup>2</sup>. |
|||
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'' + ''yi'')(''x'' − ''yi''). |
|||
Similarly, their squares can be factored in a different way than their integer factorization, as |
|||
:''p''<sup>2</sup> = (''x'' + ''yi'')<sup>2</sup>(''x'' − ''yi'')<sup>2</sup> = (''x''<sup>2</sup> − ''y''<sup>2</sup> + 2''xyi'')(''x''<sup>2</sup> − ''y''<sup>2</sup> − 2''xyi''). |
|||
The real and imaginary parts of the factors in these factorizations are the side lengths of the right triangles having the given hypotenuses. |
|||
==Quadratic residues== |
==Quadratic residues== |
||
Revision as of 23:01, 14 November 2013
 | This article needs additional citations for verification. (November 2007) |
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.
Equivalently, by the Pythagorean theorem, they are the odd prime numbers p for which √p is the length of the hypotenuse of a right triangle with integer sides, and they are also the prime numbers p for which p itself is the hypotenuse of a Pythagorean triangle. For instance, the number 5 is a Pythagorean prime; √5 is the hypotenuse of a right triangle with sides 1 and 2, and 5 itself is the hypotenuse of a right triangle with sides 3 and 4.
The sequence of Pythagorean primes
The first few Pythagorean primes are
Representation as a sum of two squares
Fermat's theorem on sums of two squares states that these primes can be represented as sums of two squares uniquely (up to the ordering of the two squares), and that no other primes can be represented this way, aside from 2 = 12 + 12.
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 sides, whose hypotenuse has length √p. They are also exactly the prime numbers p such that there exists a right triangle with integer sides whose hypotenuse has length p. For, if the triangle with sides x and y has hypotenuse length √p (with x > y), then the triangle with sides x2 − y2 and 2xy has hypotenuse length p.
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 integers. The norm of a Gaussian integer x + yi is the number x2 + y2. 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 + yi)(x − yi).
Similarly, their squares can be factored in a different way than their integer factorization, as
- p2 = (x + yi)2(x − yi)2 = (x2 − y2 + 2xyi)(x2 − y2 − 2xyi).
The real and imaginary parts of the factors in these factorizations are the side 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 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 finite field Z/p with p a Pythagorean prime, the polynomial equation x2 =&nsbp;−1 has two solutions. This may be expressed by saying that −1 is a quadratic residue mod p. In contrast, this equation has no solution in the finite fields Z/p where p is a prime but is not Pythagorean.
For every Pythagorean prime p, there exists a Paley graph with p vertices, representing the numbers 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 numbers are subtracted to compute their difference, because of the property of Pythagorean primes that −1 is a quadratic residue.
External links
- Eaves, Laurence. "Pythagorean Primes: including 5, 13 and 137". Numberphile. Brady Haran.
 | This number theory-related article is a stub. You can help Wikipedia by expanding it. |