Pythagorean triple

Encyclopedia : P : PY : PYT : Pythagorean triple

---

A Pythagorean triple consists of three positive integers a, b, and c, such that a² + b² = c². Such a triple is commonly written (a, b, c), and a well-known example is (3, 4, 5). If (a, b, c) is a Pythagorean triple, then so is (ka, kb, kc) for any positive integer k. A primitive Pythagorean triple is one in which a, b and c are coprime.

The name is derived from the Pythagorean theorem, of which every Pythagorean triple is a solution. The converse is not true. For instance, the triangle with sides a = b = 1 and c = √2 is right, but (1, 1, √2) is not a Pythagorean triple because √2 is not an integer. Moreover, 1 and √2 don't have an integer common multiple because √2 is irrational.

There are 16 primitive Pythagorean triples with c ≤ 100:

(3, 4, 5)	(20, 21, 29)	(11, 60, 61)	(13, 84, 85)
(5, 12, 13)	(12, 35, 37)	(16, 63, 65)	(36, 77, 85)
(8, 15, 17)	(9, 40, 41)	(33, 56, 65)	(39, 80, 89)
(7, 24, 25)	(28, 45, 53)	(48, 55, 73)	(65, 72, 97)

Generating Pythagorean triples

An effective way to generate Pythagorean triples is based on the observation that if m and n are two positive integers with m > n, then

[a = m^2 - n^2,\,]

[b= 2mn,\,]

[c = m^2 + n^2,\,]

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. This formula was given by Euclid (c. 300 B.C.) in his book Elements and is referred to as Euclid's formula.

An alternate form of the Euclid formula eliminates the negative sign by making use of the relation m = p + q and n = p:

[a = q(2p + q) \,]

[b = 2p(p+q) \,]

[c = (p + q)^2 + p^2 \,]

Also, it is easy to notice that the complex number [m+in] when squared gives [a+ib] as a result. Since [|z^2|=|z|^2], [\sqrt=m^2+n^2=c] is an integer.

Properties of Pythagorean triples

The properties of primitive Pythagorean triples include:

• Exactly one of a, b is odd; c is odd.
• The area (A = ab/2) is an integer.
• Exactly one of a, b is divisible by 3.
• Exactly one of a, b is divisible by 4.
• Exactly one of a, b, c is divisible by 5.
• For any Pythagorean triple, ab is divisible by 12, and abc is divisible by 60.
• Exactly one of a, b, (a + b), (a − b) is divisible by 7.
• At most one of a, b is a square.
• Every integer greater than 2 is part of a Pythagorean triple.
• There exist infinitely many Pythagorean triples whose hypotenuses are squares of natural numbers.
• There exist infinitely many Pythagorean triples in which one of the legs is the square of a natural number.
• For each natural number n, there exist n Pythagorean triples with different hypotenuses and the same area.
• For each natural number n, there exist at least n different Pythagorean triples with the same leg a, where a is some natural number
• For each natural number n, there exist at least n different triangles with the same hypotenuse.
• In every Pythagorean triple, the radius of the incircle and the radii of the three excircles are natural numbers.
• There is no Pythagorean triple in which the hypotenuse and one leg are the legs of another Pythagorean triple.

Some relationships

If [ a^2 + b^2 = c^2 ] is a primitive Pythagorean triple, where a is odd, then

[\frac=\frac,\,]

[ \frac= \frac\,]

[ b/(c-a)= m/n \,]

[(a+c-b)/(a+b-c)= m/n \,]

where each fraction is reduced to lowest terms and m>n.

It can also be shown that

[ b(m^2-n^2) = a(2mn)\,]

[ (m/n)b - a = c \,]

[ (n/m)b + a = c \,]

Additional relationships among the sides:

[ c - b = (m - n)^2 \,]

[ c + b = (m + n)^2 \,]

[ a^2 = c^2 - b^2 = (c - b)(c + b)\,]

[ c - a = (m^2 + n^2) - (m^2 - n^2) = 2n^2\,]

[ c = a + (m^2 + n^2) - (m^2 - n^2) = a + 2n^2\,]

[ a = c - (m^2 + n^2) - (m^2 - n^2) = c- 2n^2 \,]

The radius, r, of the inscribed circle can be found by:

[r = ab/(a+b+c) \,]

where

[a = 2r +1 \, ]

[b = 2r(r+1)\, ]

[c = 2r^2 + 2r + 1\,]

[r = n (m-n) \, ]

[ n/m = \frac-1} \ ]

The unknown sides of a triple can be calculated directly from the radius of the incircle, r, and the value of a single known side, a.

k = a − 2r

b = 2r + (2 r²/k)

c = b+ k = 2r + (2r² /k) + k

The perimeter P and area L of a primitive Pythagorean triple triangle are 

P = a + b + c = 2m(m + n)

L = ab/2 = mn(m² − n²)

The shortest side will be a if one of the following conditions is met:

[a < b \,\!]

[m^2 - n^2 < 2mn \,\!]

[(m - n)^2 < 2n^2 \,\!]

[m - n < n \sqrt \,\!]

[m < n (1 + \sqrt)\,\!]

Unit circle relationships

An arbitrary rational slope, t on the unit circle can be written t = n/m where m and n are integers and m > n. Other unit circle relationships are shown below:

[\cos\theta\ = = = ]

[\sin\theta\ = = = ]

[\tan\theta\ = = = ]

[x^2 + y^2 = 1 \,]

Half-angle relationships

[\tan\left(\right) = ,]

[\tan\left(\right) = .]

A special case: the Platonic sequence

-->

-->

The case n = 1 of the above has been known for a long time. Proclus, in his commentary to the 47th Proposition of the first book of Euclid's Elements, describes it as follows:

Certain methods for the discovery of triangles of this kind are handed down, one which they refer to Plato, and another to Pythagoras. (The latter) starts from odd numbers. For it makes the odd number the smaller of the sides about the right angle; then it takes the square of it, subtracts unity and makes half the difference the greater of the sides about the right angle; lastly it adds unity to this and so forms the remaining side, the hypotenuse.
...
For the method of Plato argues from even numbers. It takes the given even number and makes it one of the sides about the right angle; then, bisecting this number and squaring the half, it adds unity to the square to form the hypotenuse, and subtracts unity from the square to form the other side about the right angle. ... Thus it has formed the same triangle as that which was obtained by the other method.

In equation form, this becomes:

a is odd:

side a = a : side b =[(a^2-1)/2 ] : side c=[ (a^2 +1)/2 ]

a is even:

side a = a : side b =[(a/2)^2-1 ] : side c=[ (a/2)^2 +1]

In number theory, one modern mathematical generalization of this sequence is

[(b, c) = \left(\frac\right)^2(1+a\bmod2)\mp\frac.\,]

That is to say, using modular arithmetic any natural number greater than 2 ("[a]" on the right hand side) can give us two complementary numbers ("[b]" and "[c]" on the left hand side) which together are a Pythagorean triple [(a, b, c)].

Generalizations

A set of four positive integers a, b, c and d such that a² + b²+ c² = d² is called a Pythagorean quadruple.

A generalization of the concept of Pythagorean triples is the search for triples of positive integers a, b, and c, such that aⁿ + bⁿ = cⁿ, for some n strictly greater than 2. Pierre de Fermat in 1637 claimed that no such triple exists, a claim that came to be known as Fermat's last theorem, though it was far from the last theorem Fermat discovered. The first proof was given by Andrew Wiles in 1994.

Other formulas for generating triples

I: Pythagoras (c. 540 B.C.) presented this formula for generating triples:

[a =m \,:\, b = (m^2 - 1)/2 \,:\, c= (m^2 + 1)/2,]

where m must be odd.

I(a): Declan O'Loughlin, Ireland, presented this formula for generating triples:

[a =m \,:\, b = (m^2 - 4)/4 \,:\, c= (m^2 + b^2),]

where m must be even.

II: Plato (c. 380 B. C.) is attributed with a second formula:

[ a =2m \,:\, b= (m^2 - 1) \,:\, c= (m^2 + 1), ]

where m is any natural number. Plato's formula will not directly produce triples whose longer side and hypotenuse differ by one, but can generate all primitive triples by dividing those triples that have a common factor of 2 by 2.

The methods below appear in various places, but without attribution as to their origin:

III. Given an integer n, the triple can be generated by the following two procedures:

[ a= 2n + 1 \,:\, b=2n(n + 1) \,:\, c = 2n(n + 1) + 1 ]

Example: When n = 2 the triple produced is 5, 12, and 13 (This formula is actually the same as method I, substituting m with 2n + 1.)

IV. Given the integers n and x,

[ a= 2x^2 + 2nx \,:\, b= 2nx + n^2 \,:\, c=2x^2 + 2nx + n^2 ]

Example: For n = 3 and x = 5, a = 80, b = 39, c = 89.

V. Triples can be calculated using this formula: [2xy = z^2 ], x,y,z > 0 where the following relations hold:

x = c − b, y = c − a, z = a + b − c and a = x + z, b = y + z, c = x + y + z and r = z/2 , where x, y, and z are the three sides of the triple and r is the radius of the inscribed circle.

Pythagorean triples can then be generated by choosing any even integer z.

x and y are any two factors of [ z^2/2 ].

Example: Choose z = 6. Then [ z^2/2 =18. ] The three factor-pairs of 18 are: (18, 1), (2, 9), and (6, 3). All three factor pairs will produce triples using the above equations.

z = 6, x = 18, y = 1 produces the triple a = 18 + 6 = 24, b = 1 + 6 = 7, c = 18 + 1 + 6 = 25.

z = 6, x = 2, y = 9 produces the triple a = 2 + 6 = 8, b = 9 + 6 = 15, c = 2 + 9 + 6 = 17.

z = 6, x = 6, y = 3 produces the triple a = 6 + 6 = 12, b = 3 + 6 = 9, c = 6 + 3 + 6 = 15.

VI. An infinite matrix M of Pythagorean triples (PNTs) with some particularly desirable properties can be generated by taking:

[a(r,k) = 4rk + 2k(k-1)\,]

[b(r, k) = 4r(r+k-1) - 2k + 1\,]

[c(r,k) = 4r(r+k-1) + 2k(k-1) + 1\,]

where r is the row number and k is the column number. Each row is a family of PNTs with the hypotenuse c of each PNT in row r exceeding the even side a by the square of the rth odd number.

Each column is a family of PNTs with the hypotenuse of each PNT in column k exceeding the odd side b by twice the square of k. For example M(6,4) = 241 − 120 = 121, the square of 11, and 241 − 209 = 32, which is twice the square of 4.

Below is a small portion of the matrix. If the column number is a power of 2, the PNTs in that column are all relatively prime (primitive). For every odd prime factor p of the column number, the middle row of each group of p rows will contain a PNT which is not relatively prime. In the table below these are indicated by angle brackets.

column-> 1                2                3                4                5
row   a    b    c      a    b    c      a    b    c      a    b    c      a    b    c
1    4    3    5     12    5   13     24    7   25     40    9   41     60   11   61
2    8   15   17     20   21   29    <36   27   45>    56   33   65     80   39   89
3   12   35   37     28   45   53     48   55   73     72   65   97   <100   75  125>
4   16   63   65     36   77   85     60   91  109     88  105  137    120  119  169
5   20   99  101     44  117  125    <72  135  153>   104  153  185    140  171  221
6   24  143  145     52  165  173     84  187  205    120  209  241    160  231  281

The a's of each column k are an arithmetic sequence with difference 4k, and the b's of each row r are an arithmetic sequence with difference 4r-2.

If the two legs of a PNT differ by 1, the longer leg and the hypotenuse form the coordinates of a larger PNT in M the legs of which differ by 1. M(1,1) = . M(4,5) = . M(120,169) = , etc.

VII. Generalized Fibonacci Series: A pythagorean triple can be generated by using any two arbitrary integers, a and b using the following procedures:

a. select any two integers a and b

b. define c = a+b

c. define d = b+c

The integers a,b,c,d are a generalized Fibonacci series. The sides of the triple are computed as follows:

side 1 = [ 2*b*c ]

side 2 = [ a*d ]

hypotenuse = [ b^2 + c^2 ]

example let a = 69 and b = 75, then c = 69+75 =144 and d= 75+144=219

side 1 = [ 2*75*144=21600 ]

side 2 = [ 69*219 = 15111 ]

hypotenuse = [ 75^2 + 144^2 = 26361 ]

Proof: [ sqr(21600^2 + 15111^2 ) = 26361 ]

http://www.mcs.surrey.ac.uk/Personal/R.Knott/Pythag/pythag.html

Parent Child Relationships

All primitive Pythagorean triples can be generated from the 3-4-5 triangle by using the 3 linear transformations below, where a,b,c are sides of a triple:

column->               1                 2               3
new side a        new side b      new side c
a - 2b + 2c       2a - b + 2c     2a - 2b + 3c
a + 2b + 2c       2a + b + 2c     2a + 2b + 3c
-a + 2b + 2c      -2a + b + 2c    -2a + 2b + 3c

If one begins with 3,4,5 then all other primitive triples will eventually be produced. In other words, every primitive triple will be a “parent” to 3 additional primitive triples. example: Let a=3 b =4 c = 5

column->

new  side a          new side b           new side c
3-(2*4)+(2*5)=5     (2*3)-4+(2*5)=12   (2*3)-(2*4)+(3*5)=13
3+(2*4)+(2*5)=21    (2*3)+4+(2*5)=20   (2*3)+(2*4)+(3*5)=29
-3+(2*4)+(2*5)=15   -(2*3)+4+(2*5)=8   -(2*3)+(2*4)+(3*5)=17

For further discussion of parent-child relationships in triples, see: http://mathworld.wolfram.com/PythagoreanTriple.html and “The Modular Tree of Pythagoras”, Robert Alperin, Department of Mathematics and Computer Science, San Jose State University, San Jose California) http://www.math.sjsu.edu/~alperin/pt.pdf and http://www.faust.fr.bw.schule.de/mhb/pythagen.htm

See also

• Heronian triangle
• Pythagorean prime
• Modular arithmetic
• Trigonometric identity
• Tangent half-angle formula

References

• Thomas L. Heath, The Thirteen Books of Euclid's Elements Vol. 1 (Books I and II), Dover Publications; 2nd edition (June 1, 1956) ISBN 0486600882

• Waclaw Sierpinski, Pythagorean Triangles, Dover Publications, 2003. ISBN 0-486-43278-5

External links

• http://mathworld.wolfram.com/PythagoreanTriple.html has an extensive discussion of Pythagorean triples.
• http://nrich.maths.org/mathsf/journalf/jul01/inspire1 discusses the radius of the incircle
• http://www.math.clemson.edu/~rsimms/neat/math/pyth/ provides a Javascript calculator for the (m² − n², 2mn, m² + n²) 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] at cut-the-knot
• [The Trinary Tree(s) underlying Primitive Pythagorean Triples] at cut-the-knot
• [Fermat's Last Theorem Blog] Covers topics in the history of Fermat's Last Theorem from Pythagorean triples to Wiles' proof.
• http://www.geocities.com/fredlb37/node2.html http://www.geocities.com/fredlb37/node1.html
• http://math.nmsu.edu/~history/book/euclidpt.pdf
• http://nrich.maths.org/askedNRICH/edited/1276.html Shows how to generate new triples by multiplication of two triples.
• http://mathforum.org/dr.math/faq/faq.pythag.triples.html
• http://www.mcs.surrey.ac.uk/Personal/R.Knott/Pythag/pythag.html Links to several on-line Triple calculators; discussion of the incircle formula
• http://www.math.rutgers.edu/~erowland/pythagoreantriples.html
• http://nrich.maths.org/public/viewer.php?obj_id=1332&part=index&refpage=monthindex.php
• http://depts.gallaudet.edu/mathcs/papers/baseslopegenpt.htm contains a method for calculating the unknown sides of a triple when given only a single side.
• http://www.faust.fr.bw.schule.de/mhb/pythagen.htm Description of how to transform a triple into 3 new triples.

Sloane's Online Encyclopedia of Integer Sequences contains over 160 lists associated with pythagorean triples

• http://www.research.att.com/~njas/sequences/?q=pythagorean+triples&language=english
• http://www.jacobdrummond.co.uk/maths/pages/generator.php A Pythagorean Triple Generator and Sequencer. Displays results in table structure.

 

---

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.

Search Titles

0

1

2

3

4

5

6

7

8

9

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

?