Pythagorean Triple Calculator

Pythagorean Triple Calculator Tool

What Is a Pythagorean Triple?

A Pythagorean triple is a set of three positive integers (a, b, c) that satisfy the Pythagorean equation:

In this relationship, a and b represent the integer lengths of the perpendicular legs of a right triangle, while c represents the integer length of the hypotenuse (the longest side opposite the right angle).

Classic examples of Pythagorean triples include:

• (3, 4, 5): 3² + 4² = 9 + 16 = 25 = 5²
• (5, 12, 13): 5² + 12² = 25 + 144 = 169 = 13²
• (7, 24, 25): 7² + 24² = 49 + 576 = 625 = 25²
• (8, 15, 17): 8² + 15² = 64 + 225 = 289 = 17²

Crucially, a Pythagorean triple requires all three side lengths to be exact positive integers. Non-integer right triangle side combinations (such as 1, 1, √2) satisfy the general Pythagorean theorem but are not Pythagorean triples.

Pythagorean Triple Formula

The defining mathematical formula for integer triples is derived directly from right-triangle geometry:

Where:

• a: First integer leg length (perpendicular side)
• b: Second integer leg length (base side)
• c: Integer hypotenuse length (longest side, where c > a and c > b)
• Positive Integers: Whole numbers without decimals or fractions

This formula enforces two simultaneous constraints: geometric right-angle alignment and exact integer closure.

How the Pythagorean Triple Calculator Works

The Pythagorean Triple Calculator provides four specialized computational modes to work with integer triples:

How to Check Whether Three Numbers Form a Pythagorean Triple

Follow this 5-step procedure to determine if three given numbers form a valid Pythagorean triple:

1. Verify Integer Status: Ensure that all three numbers a, b, and c are positive whole numbers (1, 2, 3...) in Euclidean geometry. If any value is a decimal or fraction, it is not a Pythagorean triple.
2. Identify the Largest Value: Assign the largest number to candidate hypotenuse c. Assign the remaining two smaller values to legs a and b.
3. Square the Legs: Calculate a² and b², then sum them: a² + b².
4. Square the Candidate Hypotenuse: Calculate c².
5. Compare Sums: If a² + b² = c², the three numbers form a valid Pythagorean triple.

Common Pythagorean Triples

Pythagorean triples are integer side combinations that satisfy right-triangle geometry (a² + b² = c²). Below are the four most famous primitive parent triples, followed by an interactive reference list up to hypotenuse c = 100:

Interactive Pythagorean Triple Reference Table

Filter by primitive or scaled status, or click Test on any row to load the triple into the calculator:

Primitive Pythagorean Triples

A primitive Pythagorean triple is a triple (a, b, c) where the three side lengths share no common factor greater than 1. Formally, their greatest common divisor is 1:

Key properties of primitive Pythagorean triples:

• Exactly one leg (a or b) is even, and the other leg is odd.
• The hypotenuse c is always an odd integer.
• Primitive triples form the core building blocks from which all non-primitive triples are generated by integer scaling.
• Examples: (3, 4, 5), (5, 12, 13), (7, 24, 25), (8, 15, 17), (9, 40, 41).

Non-Primitive Pythagorean Triples

A non-primitive Pythagorean triple is an integer triple (a, b, c) whose side lengths share a common divisor k > 1. Formally:

Every non-primitive triple can be simplified by dividing each side by k, resulting in its underlying primitive parent triple (a/k, b/k, c/k).

Examples of non-primitive triples derived from (3, 4, 5):

• (6, 8, 10): 2 × (3, 4, 5) — common factor k = 2.
• (9, 12, 15): 3 × (3, 4, 5) — common factor k = 3.
• (12, 16, 20): 4 × (3, 4, 5) — common factor k = 4.
• (15, 20, 25): 5 × (3, 4, 5) — common factor k = 5.

Primitive vs. Non-Primitive Pythagorean Triples

The following table summarizes the structural differences between primitive and non-primitive triples:

How to Generate Pythagorean Triples

The primary mathematical method for generating Pythagorean triples is Euclid's formula. Given any two arbitrary positive integers m and n with m > n > 0, Euclid's formula computes a valid triple (a, b, c) using:

Generating Primitive Pythagorean Triples

To ensure that Euclid's formula generates a primitive Pythagorean triple (where gcd(a,b,c) = 1), the parameters m and n must satisfy three exact conditions:

1. Strict Inequality: m > n > 0
2. Coprimality: gcd(m, n) = 1 (m and n share no common prime factors)
3. Opposite Parity: One parameter is even, and the other is odd (meaning m - n is odd).

If m and n are both odd, or if gcd(m,n) > 1, Euclid's formula produces a non-primitive triple that can be scaled down by a factor of 2 or gcd(m,n)².

Scaling a Pythagorean Triple

If (a, b, c) is a valid Pythagorean triple, then multiplying all three numbers by any positive integer scaling factor k produces a new valid Pythagorean triple:

Proof by substitution:

(k × a)² + (k × b)² = k²a² + k²b² = k²(a² + b²) = k²c² = (k × c)²

When k = 1, the triple retains its primitive status. When k > 1, the resulting triple is non-primitive with a common divisor of k.

Pythagorean Triple Multiples

Scaling primitive triples creates infinite "families" or series of integer multiples. Below is the 3-4-5 family scaled up to multiplier k = 10:

Pythagorean Triple With a Given Hypotenuse

A given integer hypotenuse c may correspond to zero, one, or multiple distinct Pythagorean triples, depending on its prime factorization:

• Hypotenuse c = 5: Exactly 1 triple → (3, 4, 5)
• Hypotenuse c = 13: Exactly 1 triple → (5, 12, 13)
• Hypotenuse c = 25: Exactly 2 triples → Primitive (7, 24, 25) and Non-primitive (15, 20, 25)
• Hypotenuse c = 65: Exactly 4 triples → Primitive (33, 56, 65), (16, 63, 65), and Non-primitive (39, 52, 65), (25, 60, 65)

According to Fermat's theorem on sums of two squares, the number of primitive triples with hypotenuse c depends on the number of distinct prime factors of c of the form 4k + 1.

Pythagorean Triples With a Given Leg

Every odd integer leg length a = 2k + 1 (for k ≥ 1) forms a primitive triple using:

Examples of multiple triples containing the same leg length:

• Leg length 15: Belongs to (9, 12, 15), (15, 20, 25), (15, 36, 39), and (15, 112, 113).
• Leg length 24: Belongs to (7, 24, 25), (10, 24, 26), (18, 24, 30), (24, 32, 40), (24, 45, 51), (24, 70, 74), and (24, 143, 145).

Are All Right Triangles Pythagorean Triples?

No. While every right triangle satisfies the geometric relation a² + b² = c², only right triangles with three positive integer side lengths form Pythagorean triples.

Pythagorean Triple vs. Pythagorean Theorem

Although closely connected, the Pythagorean theorem and Pythagorean triples represent distinct concepts in geometry and number theory:

For general right-triangle calculations involving decimals or irrational side lengths, visit our primary Pythagorean Theorem Calculator.

Pythagorean Triple Calculator vs. Pythagorean Triple Checker

Understanding the operational difference between calculator and checker tools:

Pythagorean Triple vs. Standard Pythagorean Calculator

A standard Pythagorean Calculator solves for side c given any arbitrary legs a and b (e.g. a = 3.5, b = 4.2 → c ≈ 5.467). In contrast, this Pythagorean Triple Calculator restricts solutions strictly to positive integer side combinations and evaluates primitive GCD factors.

Pythagorean Triple Calculation Examples

Here are five detailed mathematical examples demonstrating triple checking, side solving, scaling, and Euclid generation:

Pythagorean Triple Input Requirements

To ensure mathematical validity and accurate calculator output, enforce these input rules:

• Checking Mode: Require three positive integer inputs (a, b, c). Zero, negative numbers, or decimal values are invalid.
• Side Solver Mode: Require positive integer inputs. Known legs must be smaller than the hypotenuse (c > a and c > b).
• Generator Mode: Search limit maximum hypotenuse must be a positive integer c ≥ 5.
• Euclid Mode: Require parameters m and n satisfying m > n > 0 with integer inputs.

Pythagorean Triple Accuracy and Integer Handling

Integer accuracy is essential when working with Pythagorean triples. Floating-point arithmetic in computers can introduce subtle rounding inaccuracies (e.g. 4.999999999999999 instead of 5).

Our calculator uses exact BigInt and integer-check algorithms (Number.isInteger()) to guarantee that non-integers are never misclassified as Pythagorean triples. Approximate tolerances are strictly avoided so that values like 3, 4, 5.0000001 are correctly flagged as non-triples.

Common Pythagorean Triple Mistakes

Avoid these 12 common misconceptions when studying or working with Pythagorean triples:

1. Assuming every right triangle is a Pythagorean triple: Forgetting that all three side lengths must be integers.
2. Treating decimal or radical solutions as triples: Classifying (1, 1, √2) or (3, 4, 5.1) as triples.
3. Failing to identify the largest value as hypotenuse c: Testing 3² + 5² = 4² instead of 3² + 4² = 5².
4. Checking raw addition instead of squared sums: Mistakenly checking a + b = c (3 + 4 = 7 ≠ 5) instead of a² + b² = c².
5. Forgetting to square values: Adding raw side lengths before extracting square roots.
6. Mistaking non-primitive triples for primitive ones: Labelling (6, 8, 10) as primitive despite gcd(6,8,10) = 2.
7. Assuming each hypotenuse has only one unique triple: Overlooking that c = 25 is shared by (7, 24, 25) and (15, 20, 25).
8. Ignoring scaled multiples: Failing to realize that multiplying a primitive triple yields a new valid triple.
9. Using invalid parameters in Euclid's formula: Entering n ≥ m or negative parameters.
10. Expecting non-primitive output from Euclid's coprimality rules: Forgetting that gcd(m,n) = 1 and opposite parity generate primitive triples.
11. Rounding intermediate values prematurely: Using floating-point approximations prior to testing integer equality.
12. Generating duplicate permutations: Treating (3, 4, 5) and (4, 3, 5) as separate distinct triples instead of using canonical a < b < c order.

Pythagorean Triples in Mathematics and Geometry

Pythagorean triples hold a central place across mathematics, geometry, and computer science:

• Number Theory & Diophantine Equations: Triples represent non-trivial integer solutions to the Diophantine equation x² + y² = z². Fermat's Last Theorem expanded on this by proving that xⁿ + yⁿ = zⁿ has no integer solutions for n > 2.
• Trigonometry & Exact Ratios: Triples provide exact rational values for sine, cosine, and tangent angles without radical signs (e.g. sin(θ) = 3/5, cos(θ) = 4/5).
• Computer Graphics & Integer Rasterization: Triples enable exact integer grid calculations for vector rotation and 2D rendering without floating-point drift.

Pythagorean Triples and Integer Coordinates

Pythagorean triples describe right triangles whose vertices land precisely on integer Cartesian grid coordinates (x, y):

Pythagorean Triple Calculator FAQ