Pythagorean triple

Definition and basic classification

Triples are classified as primitive or non-primitive. A primitive Pythagorean triple has entries that share no common divisor greater than 1 (gcd(a,b,c)=1). Non-primitive triples are integer multiples of primitive ones. In every primitive triple one leg is even, the other leg is odd, and the hypotenuse is odd. A triple made entirely of even numbers must therefore be non-primitive. For background on whole numbers used here see integers.

Euclid's formula and generation

All primitive Pythagorean triples can be generated by Euclid's formula: for positive integers m and n with m > n set a = m^2 - n^2, b = 2mn, c = m^2 + n^2. When m and n are coprime and not both odd this produces a primitive triple; multiplying a, b and c by a common factor yields every non-primitive triple. This parametrization also corresponds to rational parametrizations of the unit circle and to algebraic constructions using Gaussian integers. For a focused account see Euclid's formula.

Examples and infinite families

• The smallest primitive triple is (3, 4, 5).
• Other well known primitives: (5, 12, 13), (8, 15, 17), (7, 24, 25).
• Scaling a primitive triple yields an infinite family: for example 2×(3,4,5) = (6,8,10), 3×(3,4,5) = (9,12,15), and so on.

There are infinitely many Pythagorean triples because Euclid's formula provides infinitely many choices of (m,n) that meet the requirements. Many systematic generation methods exist, including tree-based procedures that produce every primitive triple exactly once.

Arithmetical properties

Primitive triples satisfy simple parity and divisibility constraints: exactly one leg is even and the hypotenuse is odd. The legs and hypotenuse have algebraic relations coming from the parametrization; for instance c = m^2 + n^2 is the sum of two squares. There is a one-to-one correspondence between primitive triples (up to ordering of the legs) and reduced rational points on the unit circle x^2 + y^2 = 1, obtained by dividing a and b by c.

History and development

Integer right triangles were known well before classical Greece: practical examples appear in Mesopotamian clay tablets, and the triple (3,4,5) was used in ancient surveying. The association with Pythagoras reflects the geometric theorem about right triangles, and Euclid recorded a general construction in his Elements. The modern, algebraic study of these triples connects with quadratic forms, complex integers and modular arithmetic.

Applications and further reading

Pythagorean triples are useful in elementary geometry, construction, surveying and any application where integer approximations to right triangles are desired. They also serve as introductory examples in algebraic number theory and Diophantine analysis. For introductory accounts and further references consult standard encyclopedic entries and surveys of Diophantine equations at encyclopedic sources and treatments of Euclid's parametrization at Euclid's formula. Algorithms and computational approaches for listing triples are described in algorithmic literature and number theory texts; for a general discussion of the underlying integers see integers and for the Diophantine perspective see Diophantine equation.

Notes

Many variations and refinements exist: alternative parametrizations, matrix-based generation trees that enumerate primitives without repetition, and connections with Gaussian integers. These viewpoints provide different proofs and constructions but all agree on the basic classification and on the infinite nature of Pythagorean triples.