Pythagorean triples are classified according to whether their three entries share a common factor. A triple (a, b, c) is primitive if gcd(a, b, c) = 1. For example, (3, 4, 5) is primitive because the greatest common divisor of 3, 4, and 5 is 1. The triple (6, 8, 10) is non-primitive because all three entries are divisible by 2. Every non-primitive Pythagorean triple can be obtained by multiplying a primitive Pythagorean triple by a positive integer greater than 1. Euclid's formula provides a systematic method for generating primitive triples. For positive integers m > n, the triple (m² − n², 2mn, m² + n²) is primitive precisely when gcd(m, n) = 1 and m − n is odd. These conditions ensure that the generated entries have no common factor. Understanding this classification helps avoid duplicate triples and reveals the underlying structure of integer right triangles.
Primitive and Non-Primitive Pythagorean Triples
A primitive Pythagorean triple is a triple of positive integers satisfying a² + b² = c² whose three entries have greatest common divisor 1. A non-primitive triple has a common divisor greater than 1.
Primitive ⇔ gcd(a, b, c) = 1. Non-primitive ⇔ gcd(a, b, c) > 1.
Explanation
Variables
A
The first leg of a Pythagorean triple.
B
The second leg of a Pythagorean triple.
C
The hypotenuse.
M, n
Positive integers used in Euclid's formula, where m > n.
Gcd(a, b, c)
The greatest common divisor shared by all three entries.
Example or application
Problem
Classify the triples (3, 4, 5) and (9, 12, 15).
Solution
For (3, 4, 5), gcd(3, 4, 5) = 1, so it is primitive. For (9, 12, 15), gcd(9, 12, 15) = 3, so it is non-primitive. Dividing the second triple by 3 gives the primitive triple (3, 4, 5).
Answer
(3, 4, 5) is primitive, while (9, 12, 15) is non-primitive.
Text
Primitiveness is determined by the greatest common divisor of all three entries, not simply by whether the numbers are small. A primitive triple cannot be reduced by dividing all three entries by a common integer greater than 1.
Key Points
A primitive Pythagorean triple has no common divisor greater than 1.
A non-primitive triple has a common divisor greater than 1.
Every non-primitive triple is a positive integer multiple of a primitive triple.
Euclid's formula generates primitive triples when gcd(m, n) = 1 and m − n is odd.
For a primitive triple, exactly one leg is even and the hypotenuse is odd.
Every primitive triple has relatively prime legs.
Classifying triples by primitiveness prevents repeated representations of the same basic triple.
Properties
If (a, b, c) is primitive, then gcd(a, b) = gcd(a, c) = gcd(b, c) = 1.
The two legs of a primitive Pythagorean triple have opposite parity.
The hypotenuse of a primitive Pythagorean triple is odd.
Multiplying a primitive triple by an integer greater than 1 produces a non-primitive triple.
Dividing a non-primitive triple by its common greatest divisor produces a primitive triple.
A primitive triple cannot have all three entries even or all three entries odd.
Formula Details
| Name | Formula | Description |
|---|---|---|
Primitive Triple Generation | a = m² − n², b = 2mn, c = m² + n² | Produces a primitive triple when m > n > 0, gcd(m, n) = 1, and m − n is odd. |
Non-Primitive Triple Generation | (ka, kb, kc), where k > 1 | Produces a non-primitive triple by multiplying a primitive triple by a positive integer greater than 1. |
Applications
Classifying integer right triangles.
Generating Pythagorean triples without unnecessary repetitions.
Studying relatively prime integers.
Exploring parity and divisibility properties.
Investigating the structure of quadratic Diophantine equations.
Learning Outcomes
Define primitive and non-primitive Pythagorean triples.
Use the greatest common divisor to classify a triple.
Explain how non-primitive triples are generated from primitive triples.
Apply Euclid's conditions for generating primitive triples.
Recognize parity properties of primitive triples.
Practice Questions
Determine whether (8, 15, 17) is primitive.
Classify (10, 24, 26) as primitive or non-primitive.
Find the primitive triple associated with (12, 16, 20).
Generate a primitive triple using m = 5 and n = 2.
Explain why m and n must be relatively prime in Euclid's primitive-triple formula.
Why must m and n have opposite parity when generating a primitive triple?
Related Concepts
Pythagorean Triples
Greatest Common Divisor
Coprime Integers
Euclid's Formula
Parity
Diophantine Equations
Common Mistakes
Classifying a triple as primitive merely because its entries are small.
Checking only whether two entries share a divisor instead of considering all three.
Assuming that every Pythagorean triple is primitive.
Ignoring the coprimality condition in Euclid's formula.
Forgetting the opposite-parity condition for primitive generation.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- David M. Burton, Elementary Number Theory
- Kenneth H. Rosen, Elementary Number Theory and Its Applications
- Titu Andreescu and Dorin Andrica, An Introduction to Diophantine Equations
Suggest a correction or source · More in Arithmetic & Number Theory