Pythagorean Triples
Verify whether any three positive integers satisfy the Pythagorean theorem a^2 + b^2 = c^2, or generate primitive and non-primitive triples using Euclid's generalized formula with step-by-step results.
About This Calculator
The Pythagorean Triples Calculator helps you explore one of the most fascinating concepts in number theory and geometry. A Pythagorean triple consists of three positive integers (a, b, c) that satisfy the equation a^2 + b^2 = c^2 -- the same relationship described by the Pythagorean theorem for right triangles. The best-known example is (3, 4, 5), where 9 + 16 = 25.
This calculator supports two modes. In Check triple mode, enter any three positive integers and the calculator will verify whether they form a Pythagorean triple. It sorts the numbers, computes their squares, and checks if the sum of the squares of the two smaller numbers equals the square of the largest number. In Generate triple mode, use Euclid's generalized formula with parameters m, n, and k to produce new Pythagorean triples. The formula a = (m^2 - n^2) x k, b = 2mn x k, c = (m^2 + n^2) x k generates every possible Pythagorean triple. The calculator also determines whether the generated triple is primitive -- meaning its three numbers share no common divisor greater than 1.
Pythagorean triples have been studied since ancient times, with the Babylonians documenting them on clay tablets (Plimpton 322) over 3,800 years ago. Today they appear in construction (the 3-4-5 rule for squaring corners), navigation, computer graphics, and cryptography. This free online tool is ideal for students learning number theory, teachers demonstrating the Pythagorean theorem, math enthusiasts exploring integer sequences, and professionals needing quick right-triangle verification.
Frequently Asked Questions
What is a Pythagorean triple?
A Pythagorean triple is a set of three positive integers (a, b, c) that satisfy a^2 + b^2 = c^2. These numbers represent the side lengths of a right triangle, where c is the hypotenuse.
How do I check if three numbers form a Pythagorean triple?
Sort the three numbers in ascending order. Square the two smaller numbers, add them, and compare the result to the square of the largest number. If they are equal, the numbers form a Pythagorean triple.
What is the most common Pythagorean triple?
The most well-known Pythagorean triple is (3, 4, 5), also called the Egyptian Triangle. Other common examples include (5, 12, 13), (6, 8, 10), (8, 15, 17), and (7, 24, 25).
How do I generate Pythagorean triples using Euclid's formula?
Choose positive integers m > n and a multiplier k. Compute a = (m^2 - n^2) x k, b = 2mn x k, and c = (m^2 + n^2) x k. For example, m = 2, n = 1, and k = 1 generates the triple (3, 4, 5).
What is a primitive Pythagorean triple?
A primitive Pythagorean triple has no common factor greater than 1 among its three numbers. For example, (3, 4, 5) is primitive because their GCD is 1, while (6, 8, 10) is not primitive since their GCD is 2.
Are there infinitely many Pythagorean triples?
Yes, there are infinitely many Pythagorean triples. Starting from any known triple, multiplying each number by any positive integer k generates another triple. There are also infinitely many primitive triples.
What real-world applications use Pythagorean triples?
Pythagorean triples are used in construction for right-angle verification (e.g., the 3-4-5 rule for squaring corners), in navigation for distance calculations, in computer graphics for coordinate systems, and in pure number theory research.