A Pythagorean triple consists of three positive integers a, b, and c, such that a^{2} + b^{2} = c^{2}. Such a triple is commonly written (a, b, c), and a wellknown 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 (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. A triangle whose sides form a Pythagorean triple is called a Pythagorean triangle, and is necessarily a right triangle.
The name is derived from the Pythagorean theorem, stating that every right triangle has side lengths satisfying the formula ; thus, Pythagorean triples describe the three integer side lengths of a right triangle. However, right triangles with noninteger sides do not form Pythagorean triples. For instance, the triangle with sides and is a right triangle, but is not a Pythagorean triple because is not an integer. Moreover, and do not have an integer common multiple because 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.^{[2]}
When searching for integer solutions, the equation a^{2} + b^{2} = c^{2} is a Diophantine equation. Thus Pythagorean triples are among the oldest known solutions of a nonlinear Diophantine equation.
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) 
Each of these points forms a radiating line in the scatter plot. 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).
Additionally these are the remaining primitive Pythagorean triples of numbers up to 300:
(20, 99, 101)  (60, 91, 109)  (15, 112, 113)  (44, 117, 125) 
(88, 105, 137)  (17, 144, 145)  (24, 143, 145)  (51, 140, 149) 
(85, 132, 157)  (119, 120, 169)  (52, 165, 173)  (19, 180, 181) 
(57, 176, 185)  (104, 153, 185)  (95, 168, 193)  (28, 195, 197) 
(84, 187, 205)  (133, 156, 205)  (21, 220, 221)  (140, 171, 221) 
(60, 221, 229)  (105, 208, 233)  (120, 209, 241)  (32, 255, 257) 
(23, 264, 265)  (96, 247, 265)  (69, 260, 269)  (115, 252, 277) 
(160, 231, 281)  (161, 240, 289)  (68, 285, 293) 
Euclid's formula^{[3]} 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
form a Pythagorean triple. The triple generated by Euclid's formula is primitive if and only if m and n are coprime and 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.^{[4]}
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.^{[5]}
Many formulas for generating triples with particular properties have been developed since the time of Euclid.
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.^{[6]} 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, so we may suppose that a is odd, by exchanging, if needed, a and b. This implies that 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 we obtain and hence . Then . Since is rational, we set it equal to in lowest terms. Thus , being the reciprocal of . Then solving
for and gives
As is fully reduced, m and n are coprime, and they cannot both be even. If they were both odd, the numerator of 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 longer but more commonplace proof is given in Maor (2007)^{[7]} and Sierpiński (2003).^{[8]} 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.
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 and the fullangle trigonometric values are , , and .^{[9]}
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.
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:
In addition, special Pythagorean triples with certain additional properties can be guaranteed to exist:
Euclid's formula for a Pythagorean triple
can be understood in terms of the geometry of rational points on the unit circle (Trautman 1998).
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 integers a, b, c such that
By multiplying both members by c^{2}, one can see that the rational points on the circle are in onetoone correspondence with the primitive Pythagorean triples.
The unit circle may also be defined by a parametric equation
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.
There is a correspondence between points on the unit circle with rational coordinates and primitive Pythagorean triples. At this point, Euclid's formulae can be derived either by methods of trigonometry or equivalently by using the stereographic projection.
For the stereographic approach, suppose that P′ is a point on the xaxis with rational coordinates
Then, it can be shown by basic algebra that the point P has coordinates
This establishes that each rational point of the xaxis 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 xaxis, 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 xaxis has coordinates
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.
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 ^{[28]} for primitive Pythagorean triples this interior lattice count is The area (by Pick's theorem equal to one less than the interior lattice count plus half the boundary lattice count) equals .
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.
By Euclid's formula all primitive Pythagorean triples can be generated from integers and with , odd and . Hence there is a 1 to 1 mapping of rationals (in lowest terms) to primitive Pythagorean triples where is in the interval and odd.
The reverse mapping from a primitive triple where to a rational is achieved by studying the two sums and . One of these sums will be a square that can be equated to and the other will be twice a square that can be equated to . It is then possible to determine the rational .
In order to enumerate primitive Pythagorean triples the rational can be expressed as an ordered pair 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
Pythagorean triples can likewise be encoded into a square matrix of the form
A matrix of this form is symmetric. Furthermore, the determinant of X is
which is zero precisely when (a,b,c) is a Pythagorean triple. If X corresponds to a Pythagorean triple, then as a matrix it must have rank 1.
Since X is symmetric, it follows from a result in linear algebra that there is a column vector ξ = [m n]^{T} such that the outer product

(1) 
holds, where the T denotes the matrix transpose. The vector ξ is called 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 [m n]^{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) 
gives rise to an action on the matrix X in (1). This does not give a welldefined 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 [m n]^{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 field Z_{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
Consequently, every primitive Pythagorean triple can be obtained in a unique way as a product of copies of the matrices U and L.
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.^{[29]}
Alternatively, Euclid's formulae can be analyzed and proved using the Gaussian integers.^{[30]} 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 righthand 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 to units.^{[31]} (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.
Thus, the first factor can be written
The real and imaginary parts of this equation give the two formulas:
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.
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.
Using the facts that the Gaussian integers are a Euclidean domain and that for a Gaussian integer p 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 and integers. Since magnitudes multiply in the Gaussian integers, the product must be , which when squared to find a Pythagorean triple must be composite. The contrapositive completes the proof.
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 semilatus rectum.
These patterns can be explained as follows. If is an integer, then (a, , ) 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 and a and b cannot both be odd.) The Pythagorean triples thus lie on curves given by , that is, parabolas reflected at the aaxis, 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 aaxis 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 baxis at right angles at b = 2n, and hence its reflection upon interchange of a and b intersects the aaxis at right angles at a = 2n, precisely where the parabola for n is reflected at the aaxis. (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.^{[32]}^{[33]}
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.
In equation form, this becomes:
a is odd (Pythagoras, c. 540 BC):
a is even (Plato, c. 380 BC):
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 noninteger 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.
The equation,
is equivalent to the special Pythagorean triple,
There is an infinite number of solutions to this equation as solving for the variables involves an elliptic curve. Small ones are,
One way to generate solutions to is to parametrize a, b, c, d in terms of integers m, n, p, q as follows:^{[34]}
Given two sets of Pythagorean triples,
the problem of finding equal products of a nonhypotenuse side and the hypotenuse,
is easily seen to be equivalent to the equation,
and was first solved by Euler as . 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.
For the case of Descartes' circle theorem where all variables are squares,
Euler showed this is equivalent to three simultaneous Pythagorean triples,
There is also an infinite number of solutions, and for the special case when , then the equation simplifies to,
with small solutions as and can be solved as binary quadratic forms.
No Pythagorean triples are isosceles, because the ratio of the hypotenuse to either other side is √2, but √2 cannot be expressed as the ratio of 2 integers.
There are, however, rightangled triangles with integral sides for which the lengths of the nonhypotenuse sides differ by one, such as,
and an infinite number of others. They can be completely parameterized as,
where {x, y} are the solutions to the Pell equation .
If a, b, c are the sides of this type of primitive Pythagorean triple (PPT) then the solution to the Pell equation is given by the recursive formula
This sequence of PPTs forms the central stem (trunk) of the rooted ternary tree of PPTs.
When it is the longer nonhypotenuse side and hypotenuse that differ by one, such as in
then the complete solution for the PPT a, b, c is
and
where integer is the generating parameter.
It shows that all odd numbers (greater than 1) appear in this type of almostisosceles PPT. This sequence of PPTs forms the right hand side outer stem of the rooted ternary tree of PPTs.
Another property of this type of almostisosceles PPT is that the sides are related such that
for some integer . Or in other words is divisible by such as in
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
The middle side of each of these triangles is the sum of the three sides of the preceding triangle.^{[37]}
There are several ways to generalize the concept of Pythagorean triples.
The expression
is a Pythagorean ntuple for any tuple of positive integers (m_{1}, ..., m_{n}) with m^{2}
_{1} > m^{2}
_{2} + ... + m^{2}
_{n}. The Pythagorean ntuple can be made primitive by dividing out by the largest common divisor of its values.
Furthermore, any primitive Pythagorean ntuple 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 ntuple by the above formula and divide out by the largest common integer divisor, which is 2(c + a_{1}). Dividing out by the largest common divisor of these (m_{1}, ..., m_{n}) values gives the same primitive Pythagorean ntuple; and there is a onetoone 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 ntuples.
Examples of the relationship between setwise coprime values and primitive Pythagorean ntuples include:^{[38]}
Since the sum F(k,m) of k consecutive squares beginning with m^{2} is given by the formula,^{[39]}
one may find values (k, m) so that F(k,m) is a square, such as one by Hirschhorn where the number of terms is itself a square,^{[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 wellknown cannonballstacking problem of Lucas,
a fact which is connected to the Leech lattice.
In addition, if in a Pythagorean ntuple (n ≥ 4) all addends are consecutive except one, one can use the equation,^{[41]}
Since the second power of p cancels out, this is only linear and easily solved for as though k, m should be chosen so that p is an integer, with a small example being k = 5, m = 1 yielding,
Thus, one way of generating Pythagorean ntuples is by using, for various x,^{[42]}
where q = n–2 and where
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 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:
There can also exist n − 1 positive integers whose nth powers sum to an nth power (though, by Fermat's Last Theorem, not for {{{1}}}; these are counterexamples to Euler's sum of powers conjecture. The smallest known counterexamples are^{[43]}^{[44]}^{[15]}
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:
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
or equivalently
be a nonzero perfect square divisible by 16.
Primitive Pythagorean triples have been used in cryptography as random sequences and for the generation of keys.^{[45]}
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}.