BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 10 definitions for Pythagorean.

Pythagorean prime

Print-Friendly
About 1 pages (213 words)

Bookmark and Share Know this topic well? Help others and get FREE products!

A Pythagorean prime is prime number of the form 4n + 1. These are exactly the primes that can be the hypotenuse of a Pythagorean triangle. The first few Pythagorean primes are

5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113

(sequence A002144 in 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 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. -1 is a quadratic residue mod p if and only if p is a Pythagorean prime (or 2).

View More Summaries on Pythagorean prime
 
Ask any question on Pythagorean prime and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Pythagorean prime from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy