Pythagorean prime: Difference between revisions
2 is prime, and is the sum of two squares, but is not Pythagorean |
Srich32977 (talk | contribs) Adding/removing external link(s) |
||
| Line 12: | Line 12: | ||
In the field Z/p with p a Pythagorean prime, the polynomial x^2 = -1 has two solutions. |
In the field Z/p with p a Pythagorean prime, the polynomial x^2 = -1 has two solutions. |
||
==External links== |
|||
* {{cite web|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}} |
|||
[[Category:Classes of prime numbers]] |
[[Category:Classes of prime numbers]] |
||
Revision as of 04:58, 2 April 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 (and from this derives the name in reference to the famous pythagorean theorem.)
The first few Pythagorean primes are
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.
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. |