Pythagorean Triple Generator

JJ Ben-Joseph headshot Reviewed by: JJ Ben-Joseph

What This Pythagorean Triple Generator Does

This tool lists all Pythagorean triples whose hypotenuse c is less than or equal to a value you choose. You can optionally restrict the output to primitive triples only. It is designed for students, teachers, and developers who want a quick way to explore integer right triangles without writing code or doing repetitive calculations.

To use it, enter a positive integer in the Maximum hypotenuse value field. The calculator then finds every integer triple $(a, b, c)$ with a² + b² = c² and c less than or equal to your limit. If you check the Primitive only option, the results will include only triples where $a$ , $b$ , and $c$ have no common divisor greater than 1.

Typical uses include generating examples for classroom exercises, exploring number patterns, building lookup tables for programming projects, or checking work when solving geometry problems involving right triangles.

What Are Pythagorean Triples?

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

a^{2} + b^{2} = c^{2}

If you interpret $a$ , $b$ , and $c$ as the side lengths of a triangle, this equation tells you the triangle is a right triangle with hypotenuse $c$ . The most famous example is $(345)$ , because $3^{2} + 4^{2} = 9 + 16 = 25 = 5^{2}$ .

Pythagorean triples appear in many contexts:

Geometry and trigonometry: quick construction of right angles and distance checks on a grid.
Number theory: classic examples of integer solutions (Diophantine equations).
Computer graphics and game development: generating integer coordinate points for tiles and maps.
Education: illustrating the Pythagorean theorem with exact integer values.

Primitive vs. Non-Primitive Triples

A Pythagorean triple $(a, b, c)$ is called primitive if the three numbers do not share any common factor greater than 1. In other words, their greatest common divisor (gcd) is 1. If $gcd (a, b, c) > 1$ , the triple is non-primitive.

You can obtain a non-primitive triple by taking a primitive triple and multiplying all three sides by the same integer $k > 1$ . For example, starting from the primitive triple $(345)$ :

$k = 2$ gives $(6, 8, 10)$ .
$k = 3$ gives $(9, 12, 15)$ .

Both $(6, 8, 10)$ and $(9, 12, 15)$ are still Pythagorean triples, but they are non-primitive because all three sides share a common factor (2 or 3, respectively). When you check the Primitive only box in the generator, it filters out these scaled versions, leaving just the "building block" triples.

Euclid’s Formula and How the Generator Works

A remarkable fact from number theory is that every primitive Pythagorean triple can be produced from a pair of positive integers $m$ and $n$ with the following conditions:

$m > n > 0$ ,
$m$ and $n$ are coprime (no common factor greater than 1),
exactly one of $m$ and $n$ is even.

Given such a pair $(m, n)$ , Euclid’s formula defines a triple

a = m^{2} - n^{2}, b = 2 m n, c = m^{2} + n^{2}

The triple $(a, b, c)$ defined in this way always satisfies $a^{2} + b^{2} = c^{2}$ , and the conditions on $m$ and $n$ guarantee that the triple is primitive. Every primitive Pythagorean triple can be obtained from exactly one such pair $(m, n)$ , up to swapping $a$ and $b$ .

The generator effectively runs through suitable $(m, n)$ pairs, computes $(a, b, c)$ , and keeps only those with $c$ less than or equal to your chosen maximum hypotenuse value. If the "Primitive only" option is off, the tool can also include multiples of these primitive triples, such as $(6, 8, 10)$ from $(345)$ .

Worked Example with the Generator

Suppose you set the Maximum hypotenuse value to 30 and leave Primitive only checked. Behind the scenes, the tool searches for pairs $(m, n)$ that generate triples with $c \leq 30$ .

One such pair is $m = 4$ and $n = 1$ . Using Euclid’s formula:

$a = m^{2} - n^{2} = 4^{2} - 1^{2} = 16 - 1 = 15$
$b = 2 m n = 2 \times 4 \times 1 = 8$
$c = m^{2} + n^{2} = 4^{2} + 1^{2} = 16 + 1 = 17$

You can verify that

$15^{2} + 8^{2} = 225 + 64 = 289 = 17^{2}$ ,

so $(15, 8, 17)$ is a valid Pythagorean triple. Because 15, 8, and 17 have no common divisor greater than 1, this triple is primitive, and it appears in the output as long as 17 does not exceed your chosen hypotenuse limit.

If you uncheck Primitive only, the generator can also show non-primitive multiples, such as

$(30, 16, 34)$ when $k = 2$ ,
$(45, 24, 51)$ when $k = 3$ ,

provided that the resulting hypotenuse (34 or 51) is still within your specified maximum. This is why the meaning of the "Maximum hypotenuse value" field is important: it always refers to the largest allowed value of $c$ , regardless of whether the triple is primitive or not.

Interpreting the Inputs and Results

The form at the top of the page has two key controls:

Maximum hypotenuse value: this is an integer limit on $c$ . The list of results will include only those triples with hypotenuse $c$ satisfying $c \leq limit$ . For example, if you enter 100, you will see all triples the generator finds with $c$ from 1 up to 100.
Primitive only: when this option is selected, only primitive triples are shown. When it is not selected, the tool may also include non-primitive triples obtained by multiplying primitive ones by an integer factor.

In the results list or table, each row typically displays the three side lengths $a$ , $b$ , and $c$ . Some implementations may also show additional information, such as whether the triple is primitive, or the $(m, n)$ pair that generated it.

A few quick tips for using the results:

When teaching, you might restrict to primitive triples to avoid duplicates that differ only by a scaling factor.
For programming or simulation tasks, you may want non-primitive triples as well, especially if you are interested in all integer solutions in a particular range.
If you see the same shape but with larger numbers (for example, $(345)$ and $(6, 8, 10)$ ), remember that these represent similar triangles; their side ratios are identical.

Comparison: Primitive vs. Scaled Triples

The following table illustrates how primitive triples act as templates for whole families of non-primitive triples. When you generate triples on this page, you will see the same pattern in the output, especially when you set a larger maximum hypotenuse and allow non-primitive triples.

Primitive triple	Scaled by 2	Scaled by 3
3, 4, 5	6, 8, 10	9, 12, 15
5, 12, 13	10, 24, 26	15, 36, 39
7, 24, 25	14, 48, 50	21, 72, 75

In each row, the first triple is primitive. The other two are simple multiples, so they represent similar right triangles whose side lengths are scaled by a constant factor. When you interpret generator output, this helps you recognize when two triples describe the same basic shape at different sizes.

Applications and Use Cases

Pythagorean triple generators are useful in a range of practical and educational settings:

Classroom demonstrations: Quickly produce examples for worksheets, quizzes, or in-class explorations of the Pythagorean theorem. Focusing on primitive triples helps show variety without overwhelming students with scaled duplicates.
Problem checking: When solving right-triangle word problems by hand, you can use the generator to confirm that your proposed integer solution is indeed a Pythagorean triple.
Programming and game design: Developers can use tabulated triples to create integer coordinate layouts, level designs, or to test collision and distance routines where exact arithmetic is convenient.
Mathematical exploration: By setting a larger maximum hypotenuse, you can investigate patterns in how often certain types of triples appear, such as cases where $c$ is prime or where the legs differ by 1.

If you are working with other geometry tools, such as right triangle or distance calculators, these triples can provide quick exact test cases to compare against floating-point computations.

Limitations and Assumptions

Although the generator is designed to be accurate within the specified range, there are a few important limitations and assumptions to keep in mind when you choose parameters and interpret the output.

Interpretation of the limit: The "Maximum hypotenuse value" applies strictly to the hypotenuse $c$ . Only triples with $c \leq limit$ are included. Even if the legs $a$ and $b$ are small, a triple is excluded whenever its hypotenuse exceeds your limit.
Integer inputs only: The method assumes that the limit is a positive integer. Non-integer values are effectively rounded or rejected by the browser’s number input handling, and the tool is not intended to enumerate triples for non-integer bounds.
Search range and completeness: Within the chosen hypotenuse limit, the algorithm is designed to find all relevant integer triples consistent with your settings (primitive-only or including multiples). For extremely large limits, practical constraints such as processing time and browser performance may prevent listing every possible triple before a timeout or slowdown occurs.
Performance with large limits: The number of triples grows as the hypotenuse bound increases. Reasonable values (for example, limits up to a few thousand) should generate quickly in most modern browsers. Very large limits can result in long computation times and large output tables, which may impact responsiveness on some devices.
Ordering of results: Depending on the implementation, results may be ordered by hypotenuse, by one of the legs, or by the underlying $(m, n)$ parameters. This ordering does not affect correctness but may influence how easily you spot certain patterns.
Exact arithmetic: All computations are done with integer arithmetic, so there is no rounding error in checking whether $a^{2} + b^{2} = c^{2}$ . However, if you copy the triples into other tools that use floating-point arithmetic, very large values might be subject to typical floating-point limitations.

For most educational and exploratory purposes, choosing a moderate maximum hypotenuse and, if needed, restricting to primitive triples will provide fast, comprehensive, and easily interpretable results.

Enter a positive integer limit.

Pythagorean Triple Generator

What This Pythagorean Triple Generator Does

What Are Pythagorean Triples?

Primitive vs. Non-Primitive Triples

Euclid’s Formula and How the Generator Works

Worked Example with the Generator

Interpreting the Inputs and Results

Comparison: Primitive vs. Scaled Triples

Applications and Use Cases

Limitations and Assumptions

Embed this calculator

Related Calculators

Pythagorean Theorem Calculator - Solve Right Triangle Sides

Linear Diophantine Equation Solver - Find Integer Solutions

Polynomial GCD Calculator - Find Common Factors

GCD & LCM Calculator (Greatest Common Divisor)

Barycentric Coordinate Calculator - Explore Triangle Geometry

Scalar Triple Product Calculator - Determine Parallelepiped Volume