Safekipedia
Arithmetic problems of plane geometryDiophantine equationsPythagorean theoremSquares in number theory

Pythagorean triple

Adapted from Wikipedia · Discoverer experience

A graph showing the relationship between Pythagorean triples, helping us understand special sets of numbers in geometry.

A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. One well-known example is (3, 4, 5). These special sets of numbers help describe the side lengths of right triangles, making them very useful in geometry and many real-world applications.

If (a, b, c) is a Pythagorean triple, then multiplying each number by the same positive integer gives another Pythagorean triple. A primitive Pythagorean triple is one where a, b, and c share no common divisor larger than 1. For example, (3, 4, 5) is primitive, while (6, 8, 10) is not because all three numbers can be divided by 2.

Animation demonstrating the smallest Pythagorean triple, 32 + 42 = 52

The name comes from the Pythagorean theorem, which tells us that for any right triangle, the square of the longest side (the hypotenuse) equals the sum of the squares of the other two sides. Pythagorean triples are special because they give us integer side lengths that follow this rule perfectly. Not all right triangles have integer sides, so Pythagorean triples are quite rare and valuable for solving certain math problems.

These triples have been known since ancient times. The oldest known record appears on Plimpton 322, a Babylonian clay tablet from around 1800 BC, showing that people were studying these number patterns thousands of years ago. When looking for integer solutions to the equation a2 + b2 = c2, we call it a Diophantine equation, and Pythagorean triples are some of the earliest known examples of solving such equations.

Examples

There are 16 basic Pythagorean triples using numbers up to 100. A Pythagorean triple is a set of three numbers that fit the rule a² + b² = c². An example is (3, 4, 5) because 3² + 4² = 9 + 16 = 25, which is 5². Some other triples, like (6, 8, 10), come from multiplying each number in (3, 4, 5) by 2. This means they are not basic triples, but they still work for the rule. When you plot these triples on a graph, each one and its multiples make straight lines spreading out from the center.

Scatter plot of the legs (a, b) of the first Pythagorean triples with a and b less than 6000. Negative values are included to illustrate the parabolic patterns. The "rays" are a result of the fact that if (a, b, c) is a Pythagorean triple, then so is (2a, 2b, 2c), (3a, 3b, 3c) and, more generally, (ka, kb, kc) for any positive integer k.
(3, 4, 5)(5, 12, 13)(8, 15, 17)(7, 24, 25)
(20, 21, 29)(12, 35, 37)(9, 40, 41)(28, 45, 53)
(11, 60, 61)(16, 63, 65)(33, 56, 65)(48, 55, 73)
(13, 84, 85)(36, 77, 85)(39, 80, 89)(65, 72, 97)
(20, 99, 101)(60, 91, 109)(15, 112, 113)(44, 117, 125)
(88, 105, 137)(17, 144, 145)(24, 143, 145)(51, 140, 149)
(85, 132, 157)(119, 120, 169)(52, 165, 173)(19, 180, 181)
(57, 176, 185)(104, 153, 185)(95, 168, 193)(28, 195, 197)
(84, 187, 205)(133, 156, 205)(21, 220, 221)(140, 171, 221)
(60, 221, 229)(105, 208, 233)(120, 209, 241)(32, 255, 257)
(23, 264, 265)(96, 247, 265)(69, 260, 269)(115, 252, 277)
(160, 231, 281)(161, 240, 289)(68, 285, 293)

Generating a triple

Main article: Formulas for generating Pythagorean triples

Euclid's formula is a key way to create Pythagorean triples. If you have two numbers, m and n, where m is bigger than n and both are positive, you can find a triple like this:

  • a = m² − n²
  • b = 2mn
  • c = m² + n²
A plot of triples generated by Euclid's formula maps out part of the z2 = x2 + y2 cone. A constant m or n traces out part of a parabola on the cone.

For example, if m is 2 and n is 1, you get the triple (3, 4, 5). This works because 3² + 4² = 5² (or 9 + 16 = 25).

This formula creates the simplest kinds of triples, called primitive triples. To get all possible triples, you can also multiply each part of a primitive triple by any whole number k. This means every Pythagorean triple can be found this way.

Euclid's formula
m =2
n =1:
a =3
b =4
c =5

Not exchanging a and b

Every simple Pythagorean triple can be written in one special way using two numbers, m and n, that have no common factors other than 1. The formula avoids switching the positions of a and b, making it easier to understand. The numbers a, b, and c are found using these rules, depending on whether m and n are both odd or one is odd and the other even. This method helps us see clearly how all such triples are formed without extra steps.

Elementary properties of primitive Pythagorean triples

A Pythagorean triple is a set of three whole numbers (a, b, and c) that fit the rule a² + b² = c². A famous example is (3, 4, 5), because 3² + 4² = 9 + 16 = 25, which is 5². If you multiply each number in a Pythagorean triple by the same number, you get another triple. For example, multiplying (3, 4, 5) by 2 gives (6, 8, 10), which also works because 6² + 8² = 36 + 64 = 100 = 10².

Some special rules apply to what are called "primitive" Pythagorean triples, where the numbers have no common factor other than 1. In these triples, one of the two smaller numbers is always even (divisible by 2), and the largest number (the hypotenuse) is always odd. Also, one of the smaller numbers is divisible by 3, but the hypotenuse is never divisible by 3. These patterns help mathematicians find and understand these special number sets.

Geometry of Euclid's formula

Euclid's formula helps us understand Pythagorean triples using geometry. A Pythagorean triple consists of three numbers (a, b, c) that fit the rule a2 + b2 = c2. Euclid's formula shows these triples are linked to points on a unit circle — a circle with radius 1.

Points on this circle have coordinates (x, y) where x2 + y2 = 1. When x and y are rational numbers (fractions), they correspond to Pythagorean triples. This connection lets us use simple math to find many triples and study their patterns.

Pythagorean triangles in a 2D lattice

A 2D lattice is a grid of points where you can place a triangle with sides that form a Pythagorean triple. For example, if your triple is (a, b, c), you can draw a triangle with vertices at (0, 0), (a, 0), and (0, b). These triangles can be placed on the lattice grid, and we can study how many grid points lie inside them.

One interesting fact is that the area of such a triangle is always half the product of the two shorter sides, or ab/2. There are also special cases where different Pythagorean triples have the same area. For example, the triangles (20, 21, 29) and (12, 35, 37) both have an area of 210.

Enumeration of primitive Pythagorean triples

A Pythagorean triple is a set of three whole numbers that fit the formula a2 + b2 = c2. One well-known example is (3, 4, 5).

Using a special rule from ancient math, we can create all the most basic Pythagorean triples by picking two smaller whole numbers, m and n, with certain conditions: m must be bigger than n, both m + n must be odd, and they share no common factors except 1. This rule helps us find all the simplest sets of numbers that work together in the Pythagorean formula. Some of these triples include (3, 4, 5), (5, 12, 13), and (8, 15, 17).

Spinors and the modular group

Pythagorean triples can be connected to special kinds of number patterns using something called matrices, which are like square grids of numbers. For a triple (a, b, c), there is a special matrix that shows a relationship between the numbers. When this matrix has a certain property, it tells us that (a, b, c) is a Pythagorean triple.

There is also a group of special matrices called the modular group. This group can move around and change Pythagorean triples in organized ways. By using these matrices, we can generate and understand all the different Pythagorean triples in a structured manner. This helps show the deep connections between numbers and patterns in mathematics.

X = 2 [ m n ] [ m   n ] = 2 ξ ξ T {\displaystyle X=2{\begin{bmatrix}m\\n\end{bmatrix}}[m\ n]=2\xi \xi ^{T}\,} 1
2 ( A ξ ) ( A ξ ) T = A X A T {\displaystyle 2(A\xi )(A\xi )^{T}=AXA^{T}\,} 2

Parent/child relationships

Main article: Tree of Pythagorean triples

You can create new Pythagorean triples from the basic triple (3, 4, 5) using special math rules called transformations. These rules let you find more triples, like (5, 12, 13), (21, 20, 29), and (15, 8, 17), starting from the first one. This helps show how all the basic triples are connected to each other.

new side anew side bnew side c
T1:a − 2b + 2c2ab + 2c2a − 2b + 3c
T2:a + 2b + 2c2a + b + 2c2a + 2b + 3c
T3:a + 2b + 2c−2a + b + 2c−2a + 2b + 3c

Relation to Gaussian integers

A Pythagorean triple is a set of three whole numbers that fit the Pythagorean theorem. One well-known example is (3, 4, 5). When we multiply each number in a Pythagorean triple by the same whole number, we get another Pythagorean triple.

Gaussian integers are special numbers that include both whole numbers and the square root of negative one. They help us understand Pythagorean triples better. By using Gaussian integers, we can show that every Pythagorean triple comes from squaring a special combination of whole numbers. This gives us a neat way to generate all possible Pythagorean triples.

Distribution of triples

When we look at Pythagorean triples on a scatter plot, we see clear patterns. The points form lines that spread out from the origin, showing how multiples of a basic triple also appear as triples. These points also form curved patterns called parabolas, which open in all four directions from the origin. These parabolas cross each other at the axes and reflect off them at 45-degree angles.

These patterns happen because Pythagorean triples follow special math rules. For any number n, if a certain calculation gives a whole number, then we can find a triple. The triples line up along these curves, and when n is a square number or closely related to one, many triples appear close together, forming tight groups that look like thin curved strips on the plot.

Special cases and related equations

The case where n equals 1 in creating Pythagorean triples has been known for a long time. Ancient mathematicians like Proclus described methods attributed to Plato and Pythagoras. Pythagoras used odd numbers to form the sides of right triangles, while Plato used even numbers. These methods show how to find sets of three numbers (a, b, c) where a² + b² = c², which are called Pythagorean triples. For example, the triple (3, 4, 5) follows these rules.

Another interesting equation related to Pythagorean triples is the Jacobi–Madden equation. This equation connects four numbers in a special way and leads to Pythagorean triples. There are many solutions to this equation, showing the deep connections between different areas of mathematics. One famous example of a Pythagorean triple is (3, 4, 5), and many others can be found using similar methods.

Main article: Jacobi–Madden equation

Starting with 5, every second Fibonacci number can be the longest side (hypotenuse) of a right triangle with whole-number sides. For example, the triangles (3, 4, 5), (5, 12, 13), (16, 30, 34), and (39, 80, 89) all follow this pattern. The middle number in each of these triangles is the sum of the three numbers from the triangle before it.

Generalizations

There are several ways to expand the idea of Pythagorean triples. A Pythagorean triple consists of three numbers (a, b, c) where a² + b² = c². For example, (3, 4, 5) is a well-known triple because 3² + 4² = 5².

One way to generalize this idea is through something called a Pythagorean n-tuple. This involves more than three numbers and follows a similar rule but with higher dimensions. For example, in a Pythagorean 4-tuple (m₁, m₂, m₃, m₄), a special formula connects their squares. There are known examples, like (1) which works for a single number, or (2, 1) which relates to the classic (3, 4, 5) triple.

Another interesting area is Fermat’s Last Theorem, which asks whether we can find three numbers where aⁿ + bⁿ = cⁿ for any number n greater than 2. This famous problem was finally solved years later, proving that no such numbers exist for n > 2.

This article is a child-friendly adaptation of the Wikipedia article on Pythagorean triple, available under CC BY-SA 4.0.

Images from Wikimedia Commons. Tap any image to view credits and license.