A Pythagorean triple is a set of three positive integers (a,b,c)(a,b,c) that satisfy a2+b2=c2a^2 + b^2 = c^2. In plain language, the three numbers are whole-number side lengths of a right triangle, and cc is the hypotenuse. The classic example is (3,4,5)(3,4,5) because 32+42=523^2 + 4^2 = 5^2.

a2+b2=c2a^2 + b^2 = c^2

When you use this method

Reach for triples when you want whole-number side lengths of a right triangle, not just any solution. Many right triangles satisfy the Pythagorean theorem, but only some give integer side lengths. Triples are most useful in right-triangle geometry, coordinate geometry, and introductory number theory, and for checking quickly whether three whole numbers can form a right triangle. In proof-based math, they are a standard example of a Diophantine equation: an equation where you look for integer solutions instead of all real-number solutions.

A few triples show up often enough to recognize on sight:

  • (3,4,5)(3,4,5)
  • (5,12,13)(5,12,13)
  • (8,15,17)(8,15,17)
  • (7,24,25)(7,24,25)

Their multiples work too. Doubling (3,4,5)(3,4,5) gives (6,8,10)(6,8,10), and

62+82=36+64=100=1026^2 + 8^2 = 36 + 64 = 100 = 10^2

That is why many non-primitive triples are just scaled copies of smaller ones.

The procedure, step by step

There are two reliable ways to produce triples. Pick whichever fits the situation.

Step 1 — Decide what you need. A plain triple only has to satisfy a2+b2=c2a^2+b^2=c^2 with positive integers. A primitive triple additionally has no common factor greater than 11.

Step 2a — Scale a triple you already know. If (a,b,c)(a,b,c) is a Pythagorean triple and kk is a positive integer, then (ka,kb,kc)(ka,kb,kc) is also one, because

(ka)2+(kb)2=k2a2+k2b2=k2(a2+b2)=k2c2=(kc)2(ka)^2 + (kb)^2 = k^2a^2 + k^2b^2 = k^2(a^2+b^2) = k^2c^2 = (kc)^2

This is the fastest way to build examples such as (9,12,15)(9,12,15) or (10,24,26)(10,24,26).

Step 2b — Use Euclid's formula. If mm and nn are integers with m>n>0m > n > 0, then

a=m2n2,b=2mn,c=m2+n2a = m^2 - n^2,\quad b = 2mn,\quad c = m^2 + n^2

gives a Pythagorean triple. For a primitive triple, mm and nn must also be coprime and not both odd.

Step 3 — Verify. Substitute back into a2+b2=c2a^2 + b^2 = c^2 to confirm.

A full example through every step

Take m=4m = 4 and n=1n = 1. Since m>n>0m > n > 0, Euclid's formula applies. Then

a=4212=15,b=2(4)(1)=8,c=42+12=17a = 4^2 - 1^2 = 15,\quad b = 2(4)(1) = 8,\quad c = 4^2 + 1^2 = 17

So (8,15,17)(8,15,17) is a Pythagorean triple. Verify it directly:

82+152=64+225=289=1728^2 + 15^2 = 64 + 225 = 289 = 17^2

Now scale it by 22 and you get (16,30,34)(16,30,34). The right-triangle shape stays the same, but the side lengths double. This example shows both ideas at once: Euclid's formula creates a triple, and scaling creates more.

Where each step tends to break

At the "what do I need" step, students forget the whole-number condition. The equation a2+b2=c2a^2+b^2=c^2 has many real-number solutions, but a triple requires all three values to be positive integers. Self-check: are aa, bb, cc all whole numbers?

At the primitive step, the trap is calling every valid triple primitive. (6,8,10)(6,8,10) is a valid triple, but it is not primitive because all three numbers share a common factor of 22. Self-check: do the three numbers share a factor greater than 11?

When applying Euclid's formula, the trap is confusing "triple" and "primitive triple." A triple only needs a2+b2=c2a^2+b^2=c^2 with positive integers; the coprime and not-both-odd conditions on mm and nn matter only when you want the result primitive.

At the verification step, watch the ordering: in (a,b,c)(a,b,c), cc is the hypotenuse, so it must be the largest number.

Build the skill on a new case

Use m=5m = 5 and n=2n = 2 in Euclid's formula, then verify the result in a2+b2=c2a^2 + b^2 = c^2. Run each step above: produce the triple, check whether it is primitive, then confirm by substitution. For one more step, see the Pythagorean Theorem to watch the same relationship used to solve for missing side lengths.

Frequently Asked Questions

What is a Pythagorean triple?
A Pythagorean triple is a set of three positive integers a, b, and c that satisfy a squared plus b squared equals c squared. The three numbers are whole-number side lengths of a right triangle with c as the hypotenuse. The classic example is 3, 4, 5, since 9 plus 16 equals 25.
What are the most common Pythagorean triples?
The ones worth recognizing on sight are 3-4-5, 5-12-13, 8-15-17, and 7-24-25. Their multiples also work, so doubling 3-4-5 gives 6-8-10, which still satisfies the equation because 36 plus 64 equals 100. Many larger triples are just scaled copies of these small ones.
What makes a Pythagorean triple primitive?
A primitive triple has no common factor greater than 1. For example, 3-4-5 is primitive, but 6-8-10 is not because all three numbers are divisible by 2. Every non-primitive triple comes from scaling a primitive one, so understanding the primitive triples explains the whole family.
How does Euclid's formula generate Pythagorean triples?
Pick integers m and n with m greater than n greater than 0, then set a equal to m squared minus n squared, b equal to 2mn, and c equal to m squared plus n squared. This always gives a Pythagorean triple. To get a primitive one, m and n must also be coprime and not both odd.
Are multiples of a Pythagorean triple still triples?
Yes. If a, b, c is a Pythagorean triple and k is any positive integer, then ka, kb, kc is also a triple, because the factor k squared appears on both sides of the equation. This scaling trick is the fastest way to build examples such as 9-12-15 or 10-24-26.

Need help with a problem?

Upload your question and get a verified, step-by-step solution in seconds.

Open GPAI Solver →