Pythagorean Triples Calculator

Pythagorean triples are sets of three positive integers (a, b, c) that satisfy the Pythagorean theorem: a² + b² = c². The most famous example is (3, 4, 5), where 9 + 16 = 25. These triples define right triangles where all sides have integer lengths.

A primitive triple has no common factors other than 1 — meaning gcd(a,b,c) = 1. For example, (3, 4, 5) is primitive, but (6, 8, 10) is not because it equals 2 × (3, 4, 5). Every Pythagorean triple is a multiple of a primitive triple.

Use the Euclidean formula: for positive integers m > n, set a = m² − n², b = 2mn, c = m² + n². This generates all primitive triples when m and n are coprime and not both odd. Different (m, n) pairs produce different triples.

If you know a leg a, find all factor pairs (d, e) of a² where d < e and d and e have the same parity. Then b = (e − d)/2 and c = (e + d)/2. If you know the hypotenuse c, find all factor pairs (d, e) of c² where d < e and d, e have the same parity, then a = (e − d)/2 and b = (e + d)/2.

The smallest primitive triple is (3, 4, 5) with hypotenuse c = 5. The next primitive triples in order of hypotenuse are (5, 12, 13) with c = 13, (8, 15, 17) with c = 17, and (7, 24, 25) with c = 25.

Yes, there are infinitely many. The Euclidean formula generates infinitely many primitive triples as m and n vary. There are also infinitely many non-primitive triples obtained by scaling primitive ones (multiplying all sides by any positive integer).

No. In any Pythagorean triple, the hypotenuse c is always strictly greater than both legs. If a = b, then c = a√2, which is irrational, so a, b, c cannot all be integers simultaneously.

Check if the largest number squared equals the sum of the squares of the other two. For integers (a, b, c) with c being the largest, verify a² + b² = c². If the equation holds, it is a valid Pythagorean triple.

The most common primitive triples include (3, 4, 5), (5, 12, 13), (8, 15, 17), (7, 24, 25), (20, 21, 29), (12, 35, 37), and (9, 40, 41). Multiples like (6, 8, 10) and (9, 12, 15) are also frequently encountered.

No. Pythagorean triples specifically describe right triangles where all sides are integers. For non-right triangles, you would use the law of cosines (c² = a² + b² − 2ab cos C) instead of the Pythagorean theorem.

Builders use the 3-4-5 rule to verify right angles. By measuring 3 units along one wall and 4 units along another, the diagonal should be exactly 5 units if the angle is 90°. Larger multiples like 6-8-10 and 9-12-15 are used for bigger projects.

The Pythagorean theorem states a² + b² = c² for right triangles. Pythagorean triples are the integer solutions to this equation. Every Pythagorean triple satisfies the theorem, and the theorem is the foundation for generating and verifying triples.

Yes. If (a, b, c) is a Pythagorean triple, then (ka, kb, kc) is also a triple for any positive integer k. For example, scaling (3, 4, 5) by 2 gives (6, 8, 10), by 3 gives (9, 12, 15), and so on. These scaled versions are non-primitive.

Use the Euclidean formula with m > n > 0, gcd(m,n) = 1, and m and n not both odd. Generate all valid (m,n) pairs where m² + n² ≤ N, and compute the corresponding triples. Each valid pair produces exactly one primitive triple.

No. In a primitive Pythagorean triple, exactly one leg is even (b = 2mn), so at least one side is even. Since the only even prime is 2, and b = 2mn ≥ 4 for m ≥ 2, no side can be 2. Therefore, no triple has all prime sides.

Pythagorean triples are related to the Farey sequence through rational approximations of √2. The ratios a/c and b/c of Pythagorean triples provide rational approximations to irrational numbers, connecting number theory to geometry.

The 3-4-5 triple is used in construction to verify right angles (carpenters' square), in surveying to measure distances, in astronomy to calculate parallax, in education to teach the Pythagorean theorem, and in engineering for structural alignment.

Yes. A Pythagorean quadruple satisfies a² + b² + c² = d², and Pythagorean n-tuples satisfy a₁² + a₂² + ... + aₙ₋₁² = aₙ². These generalize the concept to higher-dimensional right simplices and have applications in lattice theory.

Pythagorean triples relate to Gaussian integers. If z = a + bi is a Gaussian integer, then |z|² = a² + b². Finding Gaussian integers with integer norm connects complex number theory to the study of Pythagorean triples.

The number of primitive Pythagorean triples with hypotenuse ≤ N is approximately N/(2π). This means triples become more common as N increases, but they remain relatively sparse among all integers. About 1 in every 2π integers near N is the hypotenuse of a primitive triple.

Set c = m² + n² = k² for some integer k. This requires solving a Diophantine equation. Examples include (3, 4, 5) where 5 is prime, but also (20, 21, 29) where 29 is prime. Finding c = perfect square is rarer and requires specific (m, n) pairs.

The Pythagorean Triples Calculator uses standard mathematical formulas validated against authoritative references. The specific formula is displayed in the calculator interface with a detailed explanation of each variable.

Each calculator includes a step-by-step worked example showing exactly how the formula is applied. You can follow these steps with pen and paper to verify any result.

The Pythagorean Triples Calculator accepts numeric inputs including integers and decimals. Invalid inputs (letters, special characters) are rejected with clear error messages.