Classification of Pythagorean triples
Builds on Pythagorean tripleCoprime integers
Statement
Let and be coprime positive integers with and odd. Then is a primitive Pythagorean triple. Conversely, each primitive Pythagorean triple with even arises in this way from exactly one such pair . Each Pythagorean triple is for a positive integer and a primitive triple , up to the order of the first two entries.
Remarks
The formula is called Euclid's formula. For example, gives , and gives . One proof writes and uses unique factorization. Another uses the rational points on the unit circle.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Greatest common divisor definition
- Coprime integers definition
- Pythagorean triple definition
- Classification of Pythagorean triples statement
Further reading
- Web https://en.wikipedia.org/wiki/Pythagorean_triple, Generating a triple
About this page
| Tag | 0KF3J2KAER |
|---|---|
| URI | m2://0KF3J2KAER |
| Aliases | euclid-formula |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11D09 |
| Status | This copy of the site has no build data. Run m2 status 0KF3J2KAER. |
| Uses | Pythagorean triple, Coprime integers |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.