|
|
Pythagorean TripleA Pythagorean triple consists of three positive integers a, b, c such that a2 + b2 = c2. The name comes from the Pythagorean theorem, which states that any right triangle with integer side lengths yields a Pythagorean triple. The converse is also true: every Pythagorean triple determines a right triangle with the given side lengths. For example: a b c 3n 4n 5n 5n 12n 13n 7n 24n 25n 8n 15n 17n 9n 40n 41n If (a, b, c) is a Pythagorean triple so is (da, db, dc) for any positive integer d; the number d is then a common divisor of the three numbers da, db, dc in the triple. A primitive Pythagorean triple is one in which a, b and c are coprime. The triangles described by non-primitive Pythagorean triples are always similar to the triangle described by a smaller primitive Pythagorean triple. If m > n are positive integers, then - a = m2 − n2,
- b = 2mn,
- c = m2 + n2
is a Pythagorean triple. It is primitive if and only if m and n are coprime and one of them is even (if both n and m are odd, then a, b, and c will be even, and so the Pythagorean triple will not be primitive). Not every Pythagorean triple can be generated in this way, but every primitive triple (possibly after exchanging a and b) arises in this fashion from a unique pair of coprime numbers m > n. This shows that there are infinitely many primitive Pythagorean triples. A good starting point for exploring Pythagorean triples is to recast the original equation in the form: - a2 = (c − b)(c + b)
It is interesting to note that there are more than one primitive Pythagorean triple with the same lowest integer, the first example is for 20, which is the lowest integer of two primitive triples: 20 21 29 and 20 99 101. By contrast the number 1229779565176982820 is the lowest integer in exactly 15386 primitive triples, the smallest and largest triples it is part of are: 1229779565176982820
1230126649417435981
1739416382736996181
and 1229779565176982820
378089444731722233953867379643788099
378089444731722233953867379643788101. For the curious, consider the prime factorisation - 1229779565176982820 = 22 × 3 × 5 × 7 × 11 × 13 × 17 × 19 × 23 × 29 × 31 × 37 × 41 × 43 × 47.
The number of prime factors is related to the large number of primitive Pythagorean triples. Note that there are larger integers that are the lowest integer in an even greater number of primitive Pythagorean triples. Fermat's last theorem states that non-trivial triples analogous to Pythagorean triples but with exponents higher than 2 don't exist. External links - http://mathworld.wolfram.com/PythagoreanTriple.html has an extensive discussion of Pythagorean triples.
- http://www.math.clemson.edu/~rsimms/neat/math/pyth/ provides a Javascript calculator for the (m2 − n2, 2mn, m2 + n2) formula, and shows how to derive the formula.
- http://www.faust.fr.bw.schule.de/mhb/pythagen.htm a JavaScript calculator which illustrates the 3-fold tree structure of the set of all primitive Pythagorean triples.
- Pythagorean Triples Where the formula comes from: interactive Java illustartion.
- The Trinary Tree(s) underlying Primitive Pythagorean Triples by H. Andres Lnnemo
|
 |