Pythagorean Triples

students, imagine a perfect right triangle built from whole numbers 🧮📐. That is the central idea of this lesson. A Pythagorean triple is a set of three positive integers $\left(a,b,c\right)$ such that $a^2+b^2=c^2$. These triples connect geometry, algebra, and number theory in a very direct way. In this lesson, you will learn what Pythagorean triples are, how to recognize them, how to generate them, and why they matter in Diophantine equations.

What is a Pythagorean triple?

A right triangle has one angle equal to $90^\circ$. If the two shorter sides are $a$ and $b$, and the longest side is $c$, then the Pythagorean theorem says $a^2+b^2=c^2$. When $a$, $b$, and $c$ are all integers, the triple is called a Pythagorean triple.

The most famous example is $\left(3,4,5\right)$ because $3^2+4^2=9+16=25=5^2$. This means a triangle with side lengths $3$, $4$, and $5$ is a right triangle. Another example is $\left(5,12,13\right)$ since $5^2+12^2=25+144=169=13^2$.

Not every triple of integers works. For example, $\left(2,3,4\right)$ is not a Pythagorean triple because $2^2+3^2=13$, and $4^2=16$. The equality fails, so the triangle is not right-angled.

A helpful vocabulary point: when $a$, $b$, and $c$ have no common factor greater than $1$, the triple is called primitive. The triple $\left(3,4,5\right)$ is primitive, but $\left(6,8,10\right)$ is not, because all three numbers are divisible by $2$.

Why number theory studies these triples

Pythagorean triples are a classic example of a Diophantine equation, which is an equation where we look for integer solutions. The equation $a^2+b^2=c^2$ asks for whole-number solutions, so it is a number theory problem as well as a geometry problem.

This makes Pythagorean triples important because they show how a simple equation can produce rich patterns. Number theorists ask questions like:

Which integers can appear in a Pythagorean triple?
How can we generate all primitive triples?
How are different triples related to one another?
Can a number be the hypotenuse in more than one way?

For example, $65$ appears in more than one triple:

$\left(16,63,65\right)$ because $16^2+63^2=65^2$
$\left(33,56,65\right)$ because $33^2+56^2=65^2$

This shows that one integer can play different roles in different triples. That kind of pattern is exactly what number theory likes to investigate 🔍.

Generating primitive triples

A major result is that every primitive Pythagorean triple can be generated by two positive integers $m$ and $n$ with $m>n$, using the formulas

$$a=m^2-n^2, \quad b=2mn, \quad c=m^2+n^2$$

or with $a$ and $b$ swapped.

To get a primitive triple, $m$ and $n$ must have no common factor greater than $1$, and one of them must be even while the other is odd. These conditions help avoid repeated factors in the triple.

Let’s test this with $m=2$ and $n=1$:

$$a=2^2-1^2=3, \quad b=2(2)(1)=4, \quad c=2^2+1^2=5$$

So we get $\left(3,4,5\right)$.

Now try $m=3$ and $n=2$:

$$a=3^2-2^2=5, \quad b=2(3)(2)=12, \quad c=3^2+2^2=13$$

So we get $\left(5,12,13\right)$.

Try $m=4$ and $n=1$:

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

This gives $\left(8,15,17\right)$, another primitive triple.

These formulas are powerful because they do not just find examples; they describe all primitive triples. That is a major idea in Diophantine equations: finding a complete pattern for all integer solutions.

Scaled triples and non-primitive triples

Once you know a primitive triple, you can create more triples by multiplying every side by the same positive integer $k$. If $\left(a,b,c\right)$ is a Pythagorean triple, then

$$\left(ka,kb,kc\right)$$

is also a Pythagorean triple, because

$$(ka)^2+(kb)^2=k^2a^2+k^2b^2=k^2\left(a^2+b^2\right)=k^2c^2=(kc)^2$$

For example, multiplying $\left(3,4,5\right)$ by $2$ gives $\left(6,8,10\right)$. Multiplying by $3$ gives $\left(9,12,15\right)$.

This explains why there are infinitely many Pythagorean triples. Once one triple is known, infinitely many more can be made by scaling. But scaling does not create new primitive triples, because the common factor $k$ makes the new triple non-primitive.

A good real-world example is construction. If a worker wants to mark a perfect right angle on the ground, the lengths $3$, $4$, and $5$ meters can be used to form a right triangle. Bigger versions such as $6$, $8$, and $10$ meters work too. This idea is practical because it lets people create right angles without a protractor 📏.

Properties and patterns of Pythagorean triples

Pythagorean triples have several important patterns.

First, in every primitive triple, one leg is even and the other is odd. The hypotenuse is always odd. For example:

$\left(3,4,5\right)$ has odd $3$, even $4$, odd $5$
$\left(5,12,13\right)$ has odd $5$, even $12$, odd $13$
$\left(8,15,17\right)$ has even $8$, odd $15$, odd $17$

Second, every primitive triple has $c$ odd and exactly one of $a$ and $b$ even. This follows from the formula above.

Third, not every number can be part of a triple in the same way. For instance, every primitive triple has a hypotenuse of the form $m^2+n^2$, so the study of squares plays a major role. This connects Pythagorean triples to the broader topic of sums of squares.

Here is another interesting observation: if $a$ and $b$ are both even, then the triple cannot be primitive because all three numbers will have a common factor $2$. If both legs were odd, then $a^2$ and $b^2$ would each be congruent to $1$ modulo $4$, so $a^2+b^2$ would be congruent to $2$ modulo $4$, but a square cannot be congruent to $2$ modulo $4$. That means two odd legs cannot form a Pythagorean triple. This kind of reasoning is typical in number theory.

Solving problems with Pythagorean triples

Let’s look at a few problem-solving examples.

Example 1: Is $\left(9,40,41\right)$ a Pythagorean triple?

Check the equation:

$$9^2+40^2=81+1600=1681$$

and

$$41^2=1681$$

So yes, it is a Pythagorean triple.

Example 2: Find a primitive triple with hypotenuse $c=29$

Try the formula with $m=5$ and $n=2$:

$$a=5^2-2^2=21, \quad b=2(5)(2)=20, \quad c=5^2+2^2=29$$

So $\left(20,21,29\right)$ is a primitive triple.

Example 3: Can $7$ be a leg of a primitive triple?

Yes. Use $m=4$ and $n=3$:

$$a=4^2-3^2=7, \quad b=2(4)(3)=24, \quad c=4^2+3^2=25$$

So $\left(7,24,25\right)$ is a primitive triple.

These examples show the value of formulas in number theory. Instead of guessing, you can use structure and reasoning to find solutions.

Pythagorean triples in the bigger picture of Diophantine equations

Pythagorean triples are one of the first major examples in the study of integer equations. The equation $a^2+b^2=c^2$ is simple to state, but finding all integer solutions requires deeper thinking. That is exactly the spirit of Diophantine equations.

They also introduce key number theory techniques, such as:

looking for patterns in integers
using parity, meaning odd and even reasoning
rewriting equations in a smarter form
building all solutions from a formula

These ideas appear again in more advanced problems, including sums of squares, equations of higher degree, and other classical problems. So Pythagorean triples are not just a topic by themselves. They are a gateway to the rest of Diophantine equations II.

Conclusion

Pythagorean triples are triples of positive integers $\left(a,b,c\right)$ that satisfy $a^2+b^2=c^2$. They describe integer right triangles and are a classic example of a Diophantine equation. Primitive triples, such as $\left(3,4,5\right)$ and $\left(5,12,13\right)$, can be generated by the formulas $a=m^2-n^2$, $b=2mn$, and $c=m^2+n^2$ with suitable choices of $m$ and $n$. Scaling a triple creates infinitely many more examples. In number theory, these triples matter because they reveal patterns about parity, squares, and integer solutions. students, mastering Pythagorean triples gives you a strong foundation for the rest of Diophantine equations II 🧠✨.

Study Notes

A Pythagorean triple is a triple of positive integers $\left(a,b,c\right)$ such that $a^2+b^2=c^2$.
The triple $\left(3,4,5\right)$ is the classic example.
A triple is primitive if $a$, $b$, and $c$ have no common factor greater than $1$.
Every primitive triple can be generated by

$$a=m^2-n^2, \quad b=2mn, \quad c=m^2+n^2$$

with $m>n$ and suitable parity and coprimality conditions.

If $\left(a,b,c\right)$ is a triple, then $\left(ka,kb,kc\right)$ is also a triple for any positive integer $k$.
In a primitive triple, one leg is even, one leg is odd, and the hypotenuse is odd.
Pythagorean triples are an important example of a Diophantine equation because they seek integer solutions.
They connect number theory to geometry, algebra, and real-world right-angle construction.