A Pythagorean triple consists of three positive integersa, b, and c, such that a^{2} + b^{2} = c^{2}. Such a triple is commonly written (a, b, c), 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 triangle whose side lengths are a Pythagorean triple is a right triangle and called a Pythagorean triangle.
A primitive Pythagorean triple is one in which a, b and c are coprime (that is, they have no common divisor larger than 1).^{[1]} For example, (3, 4, 5) is a primitive Pythagorean triple whereas (6, 8, 10) is not. Every Pythagorean triple can be scaled to a unique primitive Pythagorean triple by dividing (a, b, c) by their greatest common divisor. Conversely, every Pythagorean triple can be obtained by multiplying the elements of a primitive Pythagorean triple by a positive integer (the same for the three elements).
The name is derived from the Pythagorean theorem, stating that every right triangle has side lengths satisfying the formula $a^{2}+b^{2}=c^{2))$; thus, Pythagorean triples describe the three integer side lengths of a right triangle. However, right triangles with non-integer sides do not form Pythagorean triples. For instance, the triangle with sides $a=b=1$ and $c={\sqrt {2))$ is a right triangle, but $(1,1,{\sqrt {2)))$ is not a Pythagorean triple because ${\sqrt {2))$ is not an integer. Moreover, $1$ and ${\sqrt {2))$ do not have an integer common multiple because ${\sqrt {2))$ is irrational.
Pythagorean triples have been known since ancient times. The oldest known record comes from Plimpton 322, a Babylonian clay tablet from about 1800 BC, written in a sexagesimal number system. It was discovered by Edgar James Banks shortly after 1900, and sold to George Arthur Plimpton in 1922, for $10 (equivalent to $182 now).^{[2]}^{[3]}
When searching for integer solutions, the equationa^{2} + b^{2} = c^{2} is a Diophantine equation. Thus Pythagorean triples are among the oldest known solutions of a nonlinear Diophantine equation.
Examples
There are 16 primitive Pythagorean triples of numbers up to 100:
(3, 4, 5)
(5, 12, 13)
(8, 15, 17)
(7, 24, 25)
(20, 21, 29)
(12, 35, 37)
(9, 40, 41)
(28, 45, 53)
(11, 60, 61)
(16, 63, 65)
(33, 56, 65)
(48, 55, 73)
(13, 84, 85)
(36, 77, 85)
(39, 80, 89)
(65, 72, 97)
Other small Pythagorean triples such as (6, 8, 10) are not listed because they are not primitive; for instance (6, 8, 10) is a multiple of (3, 4, 5).
Each of these points (with their multiples) forms a radiating line in the scatter plot to the right.
Additionally, these are the remaining primitive Pythagorean triples of numbers up to 300:
Euclid's formula^{[4]} is a fundamental formula for generating Pythagorean triples given an arbitrary pair of integers m and n with m > n > 0. The formula states that the integers
The triple generated by Euclid's formula is primitive if and only if m and n are coprime and exactly one of them is even. When both m and n are odd, then a, b, and c will be even, and the triple will not be primitive; however, dividing a, b, and c by 2 will yield a primitive triple when m and n are coprime.^{[5]}
Every primitive triple arises (after the exchange of a and b, if a is even) from a unique pair of coprime numbers m, n, one of which is even. It follows that there are infinitely many primitive Pythagorean triples. This relationship of a, b and c to m and n from Euclid's formula is referenced throughout the rest of this article.
Despite generating all primitive triples, Euclid's formula does not produce all triples—for example, (9, 12, 15) cannot be generated using integer m and n. This can be remedied by inserting an additional parameter k to the formula. The following will generate all Pythagorean triples uniquely:
where m, n, and k are positive integers with m > n, and with m and n coprime and not both odd.
That these formulas generate Pythagorean triples can be verified by expanding a^{2} + b^{2} using elementary algebra and verifying that the result equals c^{2}. Since every Pythagorean triple can be divided through by some integer k to obtain a primitive triple, every triple can be generated uniquely by using the formula with m and n to generate its primitive counterpart and then multiplying through by k as in the last equation.
Choosing m and n from certain integer sequences gives interesting results. For example, if m and n are consecutive Pell numbers, a and b will differ by 1.^{[6]}
Many formulas for generating triples with particular properties have been developed since the time of Euclid.
Proof of Euclid's formula
That satisfaction of Euclid's formula by a, b, c is sufficient for the triangle to be Pythagorean is apparent from the fact that for positive integers m and n, m > n, the a, b, and c given by the formula are all positive integers, and from the fact that
A proof of the necessity that a, b, c be expressed by Euclid's formula for any primitive Pythagorean triple is as follows.^{[7]} All such primitive triples can be written as (a, b, c) where a^{2} + b^{2} = c^{2} and a, b, c are coprime. Thus a, b, c are pairwise coprime (if a prime number divided two of them, it would be forced also to divide the third one). As a and b are coprime, at least one of them is odd. If we suppose that a is odd, then b is even and c is odd (if b were odd, c would be even, and c^{2} would be a multiple of 4, while a^{2} + b^{2} would be congruent to 2 modulo 4, as an odd square is congruent to 1 modulo 4).
From $a^{2}+b^{2}=c^{2))$ assume a is odd. We obtain $c^{2}-a^{2}=b^{2))$ and hence $(c-a)(c+a)=b^{2))$. Then ${\tfrac {(c+a)}{b))={\tfrac {b}{(c-a)))$. Since ${\tfrac {(c+a)}{b))$ is rational, we set it equal to ${\tfrac {m}{n))$ in lowest terms. Thus ${\tfrac {(c-a)}{b))={\tfrac {n}{m))$, being the reciprocal of ${\tfrac {(c+a)}{b))$. Then solving
As ${\tfrac {m}{n))$ is fully reduced, m and n are coprime, and they cannot both be even. If they were both odd, the numerator of ${\tfrac {m^{2}-n^{2)){2mn))$ would be a multiple of 4 (because an odd square is congruent to 1 modulo 4), and the denominator 2mn would not be a multiple of 4. Since 4 would be the minimum possible even factor in the numerator and 2 would be the maximum possible even factor in the denominator, this would imply a to be even despite defining it as odd. Thus one of m and n is odd and the other is even, and the numerators of the two fractions with denominator 2mn are odd. Thus these fractions are fully reduced (an odd prime dividing this denominator divides one of m and n but not the other; thus it does not divide m^{2} ± n^{2}). One may thus equate numerators with numerators and denominators with denominators, giving Euclid's formula
$a=m^{2}-n^{2},\ \,b=2mn,\ \,c=m^{2}+n^{2))$ with m and n coprime and of opposite parities.
A longer but more commonplace proof is given in Maor (2007)^{[8]} and Sierpiński (2003).^{[9]} Another proof is given in Diophantine equation § Example of Pythagorean triples, as an instance of a general method that applies to every homogeneous Diophantine equation of degree two.
Interpretation of parameters in Euclid's formula
Suppose the sides of a Pythagorean triangle have lengths m^{2} − n^{2}, 2mn, and m^{2} + n^{2}, and suppose the angle between the leg of length m^{2} − n^{2} and the hypotenuse of length m^{2} + n^{2} is denoted as β. Then $\tan {\tfrac {\beta }{2))={\tfrac {n}{m))$ and the full-angle trigonometric values are $\sin {\beta }={\tfrac {2mn}{m^{2}+n^{2))))$, $\cos {\beta }={\tfrac {m^{2}-n^{2)){m^{2}+n^{2))))$, and $\tan {\beta }={\tfrac {2mn}{m^{2}-n^{2))))$.^{[10]}
A variant
The following variant of Euclid's formula is sometimes more convenient, as being more symmetric in m and n (same parity condition on m and n).
If m and n are two odd integers such that m > n, then
are three integers that form a Pythagorean triple, which is primitive if and only if m and n are coprime. Conversely, every primitive Pythagorean triple arises (after the exchange of a and b, if a is even) from a unique pair m > n > 0 of coprime odd integers.
Not exchanging a and b
In the presentation above, it is said that all Pythagorean triples are uniquely obtained from Euclid's formula "after the exchange of a and b, if a is even". Euclid's formula and the variant above can be merged as follows to avoid this exchange, leading to the following result.
Every primitive Pythagorean triple can be uniquely written
where m and n are positive coprime integers, and $\varepsilon ={\frac {1}{2))$ if m and n are both odd, and $\varepsilon =1$ otherwise. Equivalently, $\varepsilon ={\frac {1}{2))$ if a is odd, and $\varepsilon =1$ if a is even.
Elementary properties of primitive Pythagorean triples
General properties
The properties of a primitive Pythagorean triple (a, b, c) with a < b < c (without specifying which of a or b is even and which is odd) include:
${\tfrac {(c-a)(c-b)}{2))$ is always a perfect square.^{[11]} As it is only a necessary condition but not a sufficient one, it can be used in checking if a given triple of numbers is not a Pythagorean triple. For example, the triples {6, 12, 18} and {1, 8, 9} each pass the test that (c − a)(c − b)/2 is a perfect square, but neither is a Pythagorean triple.
When a triple of numbers a, b and c forms a primitive Pythagorean triple, then (c minus the even leg) and one-half of (c minus the odd leg) are both perfect squares; however this is not a sufficient condition, as the numbers {1, 8, 9} pass the perfect squares test but are not a Pythagorean triple since 1^{2} + 8^{2} ≠ 9^{2}.
At most one of a, b, c is a square.^{[12]}
The area of a Pythagorean triangle cannot be the square^{[13]}^{: p. 17 } or twice the square^{[13]}^{: p. 21 } of an integer.
Exactly one of a, b is divisible by 2 (is even), and the hypotenuse c is always odd.^{[14]}
Exactly one of a, b is divisible by 3, but never c.^{[15]}^{[9]}^{: 23–25 }
Exactly one of a, b is divisible by 4,^{[9]} but never c (because c is never even).
Exactly one of a, b, c is divisible by 5.^{[9]}
The largest number that always divides abc is 60.^{[16]}
Any odd number of the form 2m+1, where m is an integer and m>1, can be the odd leg of a primitive Pythagorean triple. See almost-isosceles primitive Pythagorean triples section below. However, only even numbers divisible by 4 can be the even leg of a primitive Pythagorean triple. This is because Euclid's formula for the even leg given above is 2mn and one of m or n must be even.
The hypotenuse c (which is always odd) is the sum of two squares. This requires all of its prime factors to be primes of the form 4n + 1.^{[17]} Therefore, c is of the form 4n + 1. A sequence of possible hypotenuse numbers for a primitive Pythagorean triple can be found at (sequence A008846 in the OEIS).
The area (K = ab/2) is a congruent number^{[18]} divisible by 6.
In every Pythagorean triangle, the radius of the incircle and the radii of the three excircles are positive integers. Specifically, for a primitive triple the radius of the incircle is r = n(m − n), and the radii of the excircles opposite the sides m^{2} − n^{2}, 2mn, and the hypotenuse m^{2} + n^{2} are respectively m(m − n), n(m + n), and m(m + n).^{[19]}
As for any right triangle, the converse of Thales' theorem says that the diameter of the circumcircle equals the hypotenuse; hence for primitive triples the circumdiameter is m^{2} + n^{2}, and the circumradius is half of this and thus is rational but non-integer (since m and n have opposite parity).
When the area of a Pythagorean triangle is multiplied by the curvatures of its incircle and 3 excircles, the result is four positive integers w > x > y > z, respectively. Integers −w, x, y, z satisfy Descartes's Circle Equation.^{[20]} Equivalently, the radius of the outer Soddy circle of any right triangle is equal to its semiperimeter. The outer Soddy center is located at D, where ACBD is a rectangle, ACB the right triangle and AB its hypotenuse.^{[20]}^{: p. 6 }
Only two sides of a primitive Pythagorean triple can be simultaneously prime because by Euclid's formula for generating a primitive Pythagorean triple, one of the legs must be composite and even.^{[21]} However, only one side can be an integer of perfect power $p\geq 2$ because if two sides were integers of perfect powers with equal exponent $p$ it would contradict the fact that there are no integer solutions to the Diophantine equation$x^{2p}\pm y^{2p}=z^{2))$, with $x$, $y$ and $z$ being pairwise coprime.^{[22]}
There are no Pythagorean triangles in which the hypotenuse and one leg are the legs of another Pythagorean triangle; this is one of the equivalent forms of Fermat's right triangle theorem.^{[13]}^{: p. 14 }
Each primitive Pythagorean triangle has a ratio of area, K, to squared semiperimeter, s, that is unique to itself and is given by^{[23]}
In addition, special Pythagorean triples with certain additional properties can be guaranteed to exist:
Every integer greater than 2 that is not congruent to 2 mod 4 (in other words, every integer greater than 2 which is not of the form 4k + 2) is part of a primitive Pythagorean triple. (If the integer has the form 4k, one may take n = 1 and m = 2k in Euclid's formula; if the integer is 2k + 1, one may take n = k and m = k + 1.)
Every integer greater than 2 is part of a primitive or non-primitive Pythagorean triple. For example, the integers 6, 10, 14, and 18 are not part of primitive triples, but are part of the non-primitive triples (6, 8, 10), (14, 48, 50) and (18, 80, 82).
There exist infinitely many Pythagorean triples in which the hypotenuse and the longest leg differ by exactly one. Such triples are necessarily primitive and have the form (2n + 1, 2n^{2} + 2n, 2n^{2} + 2n +1). This results from Euclid's formula by remarking that the condition implies that the triple is primitive and must verify (m^{2} + n^{2}) - 2mn = 1. This implies (m – n)^{2} = 1, and thus m = n + 1. The above form of the triples results thus of substituting m for n + 1 in Euclid's formula.
There exist infinitely many primitive Pythagorean triples in which the hypotenuse and the longest leg differ by exactly two. They are all primitive, and are obtained by putting n = 1 in Euclid's formula. More generally, for every integer k > 0, there exist infinitely many primitive Pythagorean triples in which the hypotenuse and the odd leg differ by 2k^{2}. They are obtained by putting n = k in Euclid's formula.
There exist infinitely many Pythagorean triples in which the two legs differ by exactly one. For example, 20^{2} + 21^{2} = 29^{2}; these are generated by Euclid's formula when ${\tfrac {m-n}{n))$ is a convergent to ${\sqrt {2))$.
For each positive integer k, there exist k Pythagorean triples with different hypotenuses and the same area.
For each positive integer k, there exist at least k different primitive Pythagorean triples with the same leg a, where a is some positive integer (the length of the even leg is 2mn, and it suffices to choose a with many factorizations, for example a = 4b, where b is a product of k different odd primes; this produces at least 2^{k} different primitive triples).^{[9]}^{: 30 }
For each positive integer k, there exist at least k different Pythagorean triples with the same hypotenuse.^{[9]}^{: 31 }
If c = p^{e} is a prime power, there exists a primitive Pythagorean triple a^{2} + b^{2} = c^{2} if and only if the prime p has the form 4n + 1; this triple is unique up to the exchange of a and b.
More generally, a positive integer c is the hypotenuse of a primitive Pythagorean triple if and only if each prime factor of c is congruent to 1 modulo 4; that is, each prime factor has the form 4n + 1. In this case, the number of primitive Pythagorean triples (a, b, c) with a < b is 2^{k−1}, where k is the number of distinct prime factors of c.^{[26]}
There exist infinitely many Pythagorean triples with square numbers for both the hypotenuse c and the sum of the legs a + b. According to Fermat, the smallest such triple^{[27]} has sides a = 4,565,486,027,761; b = 1,061,652,293,520; and c = 4,687,298,610,289. Here a + b = 2,372,159^{2} and c = 2,165,017^{2}. This is generated by Euclid's formula with parameter values m = 2,150,905 and n = 246,792.
There exist non-primitive Pythagorean triangles with integer altitude from the hypotenuse.^{[28]}^{[29]} Such Pythagorean triangles are known as decomposable since they can be split along this altitude into two separate and smaller Pythagorean triangles.^{[24]}
In fact, a point in the Cartesian plane with coordinates (x, y) belongs to the unit circle if x^{2} + y^{2} = 1. The point is rational if x and y are rational numbers, that is, if there are coprime integersa, b, c such that
By multiplying both members by c^{2}, one can see that the rational points on the circle are in one-to-one correspondence with the primitive Pythagorean triples.
Euclid's formula for Pythagorean triples and the inverse relationship t = y / (x + 1) mean that, except for (−1, 0), a point (x, y) on the circle is rational if and only if the corresponding value of t is a rational number. Note that t = y / (x + 1) = b / (a + c) = n / m is also the tangent of half of the angle that is opposite the triangle side of length b.
This establishes that each rational point of the x-axis goes over to a rational point of the unit circle. The converse, that every rational point of the unit circle comes from such a point of the x-axis, follows by applying the inverse stereographic projection. Suppose that P(x, y) is a point of the unit circle with x and y rational numbers. Then the point P′ obtained by stereographic projection onto the x-axis has coordinates
$\left({\frac {x}{1-y)),0\right)$
which is rational.
In terms of algebraic geometry, the algebraic variety of rational points on the unit circle is birational to the affine line over the rational numbers. The unit circle is thus called a rational curve, and it is this fact which enables an explicit parameterization of the (rational number) points on it by means of rational functions.
Pythagorean triangles in a 2D lattice
A 2D lattice is a regular array of isolated points where if any one point is chosen as the Cartesian origin (0, 0), then all the other points are at (x, y) where x and y range over all positive and negative integers. Any Pythagorean triangle with triple (a, b, c) can be drawn within a 2D lattice with vertices at coordinates (0, 0), (a, 0) and (0, b). The count of lattice points lying strictly within the bounds of the triangle is given by ${\tfrac {(a-1)(b-1)-\gcd {(a,b)}+1}{2));$^{[30]} for primitive Pythagorean triples this interior lattice count is ${\tfrac {(a-1)(b-1)}{2)).$ The area (by Pick's theorem equal to one less than the interior lattice count plus half the boundary lattice count) equals ${\tfrac {ab}{2))$ .
The first occurrence of two primitive Pythagorean triples sharing the same area occurs with triangles with sides (20, 21, 29), (12, 35, 37) and common area 210 (sequence A093536 in the OEIS). The first occurrence of two primitive Pythagorean triples sharing the same interior lattice count occurs with (18108, 252685, 253333), (28077, 162964, 165365) and interior lattice count 2287674594 (sequence A225760 in the OEIS). Three primitive Pythagorean triples have been found sharing the same area: (4485, 5852, 7373), (3059, 8580, 9109), (1380, 19019, 19069) with area 13123110. As yet, no set of three primitive Pythagorean triples have been found sharing the same interior lattice count.
Enumeration of primitive Pythagorean triples
By Euclid's formula all primitive Pythagorean triples can be generated from integers $m$ and $n$ with $m>n>0$, $m+n$ odd and $\gcd(m,n)=1$. Hence there is a 1 to 1 mapping of rationals (in lowest terms) to primitive Pythagorean triples where ${\tfrac {n}{m))$ is in the interval $(0,1)$ and $m+n$ odd.
The reverse mapping from a primitive triple $(a,b,c)$ where $c>b>a>0$ to a rational ${\tfrac {n}{m))$ is achieved by studying the two sums $a+c$ and $b+c$. One of these sums will be a square that can be equated to $(m+n)^{2))$ and the other will be twice a square that can be equated to $2m^{2))$. It is then possible to determine the rational ${\tfrac {n}{m))$.
In order to enumerate primitive Pythagorean triples the rational can be expressed as an ordered pair $(n,m)$ and mapped to an integer using a pairing function such as Cantor's pairing function. An example can be seen at (sequence A277557 in the OEIS). It begins
holds, where the T denotes the matrix transpose. Since ξ and -ξ produce the same Pythagorean triple, the vector ξ can be considered a spinor (for the Lorentz group SO(1, 2)). In abstract terms, the Euclid formula means that each primitive Pythagorean triple can be written as the outer product with itself of a spinor with integer entries, as in (1).
The modular group Γ is the set of 2×2 matrices with integer entries
with determinant equal to one: αδ − βγ = 1. This set forms a group, since the inverse of a matrix in Γ is again in Γ, as is the product of two matrices in Γ. The modular group acts on the collection of all integer spinors. Furthermore, the group is transitive on the collection of integer spinors with relatively prime entries. For if [mn]^{T} has relatively prime entries, then
where u and v are selected (by the Euclidean algorithm) so that mu + nv = 1.
By acting on the spinor ξ in (1), the action of Γ goes over to an action on Pythagorean triples, provided one allows for triples with possibly negative components. Thus if A is a matrix in Γ, then
$2(A\xi )(A\xi )^{T}=AXA^{T}\,$
(2)
gives rise to an action on the matrix X in (1). This does not give a well-defined action on primitive triples, since it may take a primitive triple to an imprimitive one. It is convenient at this point (per Trautman 1998) to call a triple (a,b,c)standard if c > 0 and either (a,b,c) are relatively prime or (a/2,b/2,c/2) are relatively prime with a/2 odd. If the spinor [mn]^{T} has relatively prime entries, then the associated triple (a,b,c) determined by (1) is a standard triple. It follows that the action of the modular group is transitive on the set of standard triples.
Alternatively, restrict attention to those values of m and n for which m is odd and n is even. Let the subgroup Γ(2) of Γ be the kernel of the group homomorphism
where SL(2,Z_{2}) is the special linear group over the finite fieldZ_{2} of integers modulo 2. Then Γ(2) is the group of unimodular transformations which preserve the parity of each entry. Thus if the first entry of ξ is odd and the second entry is even, then the same is true of Aξ for all A ∈ Γ(2). In fact, under the action (2), the group Γ(2) acts transitively on the collection of primitive Pythagorean triples (Alperin 2005).
The group Γ(2) is the free group whose generators are the matrices
By a result of Berggren (1934), all primitive Pythagorean triples can be generated from the (3, 4, 5) triangle by using the three linear transformations T_{1}, T_{2}, T_{3} below, where a, b, c are sides of a triple:
new side a
new side b
new side c
T_{1}:
a − 2b + 2c
2a − b + 2c
2a − 2b + 3c
T_{2}:
a + 2b + 2c
2a + b + 2c
2a + 2b + 3c
T_{3}:
−a + 2b + 2c
−2a + b + 2c
−2a + 2b + 3c
In other words, every primitive triple will be a "parent" to three additional primitive triples.
Starting from the initial node with a = 3, b = 4, and c = 5, the operation T_{1} produces the new triple
and similarly T_{2} and T_{3} produce the triples (21, 20, 29) and (15, 8, 17).
The linear transformations T_{1}, T_{2}, and T_{3} have a geometric interpretation in the language of quadratic forms. They are closely related to (but are not equal to) reflections generating the orthogonal group of x^{2} + y^{2} − z^{2} over the integers.^{[31]}
Relation to Gaussian integers
Alternatively, Euclid's formulae can be analyzed and proved using the Gaussian integers.^{[32]} Gaussian integers are complex numbers of the form α = u + vi, where u and v are ordinary integers and i is the square root of negative one. The units of Gaussian integers are ±1 and ±i. The ordinary integers are called the rational integers and denoted as 'Z'. The Gaussian integers are denoted as Z[i]. The right-hand side of the Pythagorean theorem may be factored in Gaussian integers:
A primitive Pythagorean triple is one in which a and b are coprime, i.e., they share no prime factors in the integers. For such a triple, either a or b is even, and the other is odd; from this, it follows that c is also odd.
The two factors z := a + bi and z* := a − bi of a primitive Pythagorean triple each equal the square of a Gaussian integer. This can be proved using the property that every Gaussian integer can be factored uniquely into Gaussian primes up tounits.^{[33]} (This unique factorization follows from the fact that, roughly speaking, a version of the Euclidean algorithm can be defined on them.) The proof has three steps. First, if a and b share no prime factors in the integers, then they also share no prime factors in the Gaussian integers. (Assume a = gu and b = gv with Gaussian integers g, u and v and g not a unit. Then u and v lie on the same line through the origin. All Gaussian integers on such a line are integer multiples of some Gaussian integer h. But then the integer gh ≠ ±1 divides both a and b.) Second, it follows that z and z* likewise share no prime factors in the Gaussian integers. For if they did, then their common divisor δ would also divide z + z* = 2a and z − z* = 2ib. Since a and b are coprime, that implies that δ divides 2 = (1 + i)(1 − i) = i(1 − i)^{2}. From the formula c^{2} = zz*, that in turn would imply that c is even, contrary to the hypothesis of a primitive Pythagorean triple. Third, since c^{2} is a square, every Gaussian prime in its factorization is doubled, i.e., appears an even number of times. Since z and z* share no prime factors, this doubling is also true for them. Hence, z and z* are squares.
For any primitive Pythagorean triple, there must be integers m and n such that these two equations are satisfied. Hence, every Pythagorean triple can be generated from some choice of these integers.
As perfect square Gaussian integers
If we consider the square of a Gaussian integer we get the following direct interpretation of Euclid's formula as representing the perfect square of a Gaussian integer.
$(m+ni)^{2}=(m^{2}-n^{2})+2mni.$
Using the facts that the Gaussian integers are a Euclidean domain and that for a Gaussian integer p $|p|^{2))$ is always a square it is possible to show that a Pythagorean triple corresponds to the square of a prime Gaussian integer if the hypotenuse is prime.
If the Gaussian integer is not prime then it is the product of two Gaussian integers p and q with $|p|^{2))$ and $|q|^{2))$ integers. Since magnitudes multiply in the Gaussian integers, the product must be $|p||q|$, which when squared to find a Pythagorean triple must be composite. The contrapositive completes the proof.
Distribution of triples
There are a number of results on the distribution of Pythagorean triples. In the scatter plot, a number of obvious patterns are already apparent. Whenever the legs (a,b) of a primitive triple appear in the plot, all integer multiples of (a,b) must also appear in the plot, and this property produces the appearance of lines radiating from the origin in the diagram.
Within the scatter, there are sets of parabolic patterns with a high density of points and all their foci at the origin, opening up in all four directions. Different parabolas intersect at the axes and appear to reflect off the axis with an incidence angle of 45 degrees, with a third parabola entering in a perpendicular fashion. Within this quadrant, each arc centered on the origin shows that section of the parabola that lies between its tip and its intersection with its semi-latus rectum.
These patterns can be explained as follows. If $a^{2}/4n$ is an integer, then (a, $|n-a^{2}/4n|$, $n+a^{2}/4n$) is a Pythagorean triple. (In fact every Pythagorean triple (a, b, c) can be written in this way with integer n, possibly after exchanging a and b, since $n=(b+c)/2$ and a and b cannot both be odd.) The Pythagorean triples thus lie on curves given by $b=|n-a^{2}/4n|$, that is, parabolas reflected at the a-axis, and the corresponding curves with a and b interchanged. If a is varied for a given n (i.e. on a given parabola), integer values of b occur relatively frequently if n is a square or a small multiple of a square. If several such values happen to lie close together, the corresponding parabolas approximately coincide, and the triples cluster in a narrow parabolic strip. For instance, 38^{2} = 1444, 2 × 27^{2} = 1458,
3 × 22^{2} = 1452, 5 × 17^{2} = 1445 and 10 × 12^{2} = 1440; the corresponding parabolic strip around n ≈ 1450 is clearly visible in the scatter plot.
The angular properties described above follow immediately from the functional form of the parabolas. The parabolas are reflected at the a-axis at a = 2n, and the derivative of b with respect to a at this point is –1; hence the incidence angle is 45°. Since the clusters, like all triples, are repeated at integer multiples, the value 2n also corresponds to a cluster. The corresponding parabola intersects the b-axis at right angles at b = 2n, and hence its reflection upon interchange of a and b intersects the a-axis at right angles at a = 2n, precisely where the parabola for n is reflected at the a-axis. (The same is of course true for a and b interchanged.)
Albert Fässler and others provide insights into the significance of these parabolas in the context of conformal mappings.^{[34]}^{[35]}
Special cases and related equations
The Platonic sequence
The case n = 1 of the more general construction of Pythagorean triples 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 that which was obtained by the other method.
It can be shown that all Pythagorean triples can be obtained, with appropriate rescaling, from the basic Platonic sequence (a, (a^{2} − 1)/2 and (a^{2} + 1)/2) by allowing a to take non-integer rational values. If a is replaced with the fraction m/n in the sequence, the result is equal to the 'standard' triple generator (2mn, m^{2} − n^{2},m^{2} + n^{2}) after rescaling. It follows that every triple has a corresponding rational a value which can be used to generate a similar triangle (one with the same three angles and with sides in the same proportions as the original). For example, the Platonic equivalent of (56, 33, 65) is generated by a = m/n = 7/4 as (a, (a^{2} –1)/2, (a^{2}+1)/2) = (56/32, 33/32, 65/32). The Platonic sequence itself can be derived^{[clarification needed]} by following the steps for 'splitting the square' described in Diophantus II.VIII.
and was first solved by Euler as $a,b,c,d=133,59,158,134$. Since he showed this is a rational point in an elliptic curve, then there is an infinite number of solutions. In fact, he also found a 7th degree polynomial parameterization.
where {x, y} are the solutions to the Pell equation$x^{2}-2y^{2}=-1$.
If a, b, c are the sides of this type of primitive Pythagorean triple then the solution to the Pell equation is given by the recursive formula
$a_{n}=6a_{n-1}-a_{n-2}+2$ with $a_{1}=3$ and $a_{2}=20$
$b_{n}=6b_{n-1}-b_{n-2}-2$ with $b_{1}=4$ and $b_{2}=21$
$c_{n}=6c_{n-1}-c_{n-2))$ with $c_{1}=5$ and $c_{2}=29$.^{[37]}
This sequence of primitive Pythagorean triples forms the central stem (trunk) of the rooted ternary tree of primitive Pythagorean triples.
When it is the longer non-hypotenuse side and hypotenuse that differ by one, such as in
$5^{2}+12^{2}=13^{2))$
$7^{2}+24^{2}=25^{2))$
then the complete solution for the primitive Pythagorean triple a, b, c is
$a=2m+1,\quad b=2m^{2}+2m,\quad c=2m^{2}+2m+1$
and
$(2m+1)^{2}+(2m^{2}+2m)^{2}=(2m^{2}+2m+1)^{2))$
where integer $m>0$ is the generating parameter.
It shows that all odd numbers (greater than 1) appear in this type of almost-isosceles primitive Pythagorean triple. This sequence of primitive Pythagorean triples forms the right hand side outer stem of the rooted ternary tree of primitive Pythagorean triples.
Another property of this type of almost-isosceles primitive Pythagorean triple is that the sides are related such that
$a^{b}+b^{a}=Kc$
for some integer $K$. Or in other words $a^{b}+b^{a))$ is divisible by $c$ such as in
$(5^{12}+12^{5})/13=18799189$.^{[38]}
Fibonacci numbers in Pythagorean triples
Starting with 5, every second Fibonacci number is the length of the hypotenuse of a right triangle with integer sides, or in other words, the largest number in a Pythagorean triple, obtained from the formula
is a Pythagorean n-tuple for any tuple of positive integers (m_{1}, ..., m_{n}) with m^{2} _{1} > m^{2} _{2} + ... + m^{2} _{n}. The Pythagorean n-tuple can be made primitive by dividing out by the largest common divisor of its values.
Furthermore, any primitive Pythagorean n-tuple a^{2} _{1} + ... + a^{2} _{n} = c^{2} can be found by this approach. Use (m_{1}, ..., m_{n}) = (c + a_{1}, a_{2}, ..., a_{n}) to get a Pythagorean n-tuple by the above formula and divide out by the largest common integer divisor, which is 2m_{1} = 2(c + a_{1}). Dividing out by the largest common divisor of these (m_{1}, ..., m_{n}) values gives the same primitive Pythagorean n-tuple; and there is a one-to-one correspondence between tuples of setwise coprime positive integers (m_{1}, ..., m_{n}) satisfying m^{2} _{1} > m^{2} _{2} + ... + m^{2} _{n} and primitive Pythagorean n-tuples.
Examples of the relationship between setwise coprime values ${\vec {m))$ and primitive Pythagorean n-tuples include:^{[40]}
and v ≥ 5 is any integer not divisible by 2 or 3. For the smallest case v = 5, hence k = 25, this yields the well-known cannonball-stacking problem of Lucas,
In addition, if in a Pythagorean n-tuple (n ≥ 4) all addends are consecutive except one, one can use the equation,^{[43]}
$F(k,m)+p^{2}=(p+1)^{2))$
Since the second power of p cancels out, this is only linear and easily solved for as $p={\tfrac {F(k,m)-1}{2))$ though k, m should be chosen so that p is an integer, with a small example being k = 5, m = 1 yielding,
$1^{2}+2^{2}+3^{2}+4^{2}+5^{2}+27^{2}=28^{2))$
Thus, one way of generating Pythagorean n-tuples is by using, for various x,^{[44]}
A generalization of the concept of Pythagorean triples is the search for triples of positive integers a, b, and c, such that a^{n} + b^{n} = c^{n}, 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 because it took longer than any other conjecture by Fermat to be proved or disproved. The first proof was given by Andrew Wiles in 1994.
Another generalization is searching for sequences of n + 1 positive integers for which the nth power of the last is the sum of the nth powers of the previous terms. The smallest sequences for known values of n are:
For the n = 3 case, in which $x^{3}+y^{3}+z^{3}=w^{3},$ called the Fermat cubic, a general formula exists giving all solutions.
A slightly different generalization allows the sum of (k + 1)nth powers to equal the sum of (n − k)nth powers. For example:
(n = 3): 1^{3} + 12^{3} = 9^{3} + 10^{3}, made famous by Hardy's recollection of a conversation with Ramanujan about the number 1729 being the smallest number that can be expressed as a sum of two cubes in two distinct ways.
There can also exist n − 1 positive integers whose nth powers sum to an nth power (though, by Fermat's Last Theorem, not for n = 3); these are counterexamples to Euler's sum of powers conjecture. The smallest known counterexamples are^{[45]}^{[46]}^{[16]}
A Heronian triangle is commonly defined as one with integer sides whose area is also an integer. The lengths of the sides of such a triangle form a Heronian triple(a, b, c) for a ≤ b ≤ c.
Every Pythagorean triple is a Heronian triple, because at least one of the legs a, b must be even in a Pythagorean triple, so the area ab/2 is an integer. Not every Heronian triple is a Pythagorean triple, however, as the example (4, 13, 15) with area 24 shows.
If (a, b, c) is a Heronian triple, so is (ka, kb, kc) where k is any positive integer; its area will be the integer that is k^{2} times the integer area of the (a, b, c) triangle.
The Heronian triple (a, b, c) is primitive provided a, b, c are setwise coprime. (With primitive Pythagorean triples the stronger statement that they are pairwise coprime also applies, but with primitive Heronian triangles the stronger statement does not always hold true, such as with (7, 15, 20).) Here are a few of the simplest primitive Heronian triples that are not Pythagorean triples:
(4, 13, 15) with area 24
(3, 25, 26) with area 36
(7, 15, 20) with area 42
(6, 25, 29) with area 60
(11, 13, 20) with area 66
(13, 14, 15) with area 84
(13, 20, 21) with area 126
By Heron's formula, the extra condition for a triple of positive integers (a, b, c) with a < b < c to be Heronian is that
^Mitchell, Douglas W. (July 2001), "An Alternative Characterisation of All Primitive Pythagorean Triples", The Mathematical Gazette, 85 (503): 273–5, doi:10.2307/3622017, JSTOR3622017, S2CID126059099
^This follows immediately from the fact that ab is divisible by twelve, together with the definition of congruent numbers as the areas of rational-sided right triangles. See e.g. Koblitz, Neal (1993), Introduction to Elliptic Curves and Modular Forms, Graduate Texts in Mathematics, vol. 97, Springer, p. 3, ISBN9780387979663.
^Baragar, Arthur (2001), A Survey of Classical and Modern Geometries: With Computer Activities, Prentice Hall, Exercise 15.3, p. 301, ISBN9780130143181
^ ^{a}^{b}Bernhart, Frank R.; Price, H. Lee (2005), Heron's formula, Descartes circles, and Pythagorean triangles, arXiv:math/0701624
^Goehl, John F., Jr., "Triples, quartets, pentads", Mathematics Teacher 98, May 2005, p. 580.
^Kim, Scott (May 2002), "Bogglers", Discover: 82, The equation w^{4} + x^{4} + y^{4} = z^{4} is harder. In 1988, after 200 years of mathematicians' attempts to prove it impossible, Noam Elkies of Harvard found the counterexample, 2,682,440^{4} + 15,365,639^{4} + 18,796,760^{4} = 20,615,673^{4}.