Pythagorean Triples Parametrisation
Generate all primitive triples.
Key idea
Generate all primitive triples.
In depth
All primitive triples come from a = m² − n², b = 2mn, c = m² + n² where m > n, coprime and of opposite parity. This comes from rational points on the unit circle.
Worked example
m = 3, n = 2: (5, 12, 13).
Formula
Real-world uses
- Generating all whole-number right triangles for design, puzzles and coding exercises
Common mistake
Choosing m and n of the same parity, which gives a non-primitive triple.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Pythagorean Triples Parametrisation?
Generate all primitive triples. It is a topic at the expert level in Discrete Math & Number Theory.
What is the formula for Pythagorean Triples Parametrisation?
The key formula is (m²−n², 2mn, m²+n²).
Where is Pythagorean Triples Parametrisation used in real life?
Real-world examples: Generating all whole-number right triangles for design, puzzles and coding exercises.
What should I learn before Pythagorean Triples Parametrisation?
Make sure you are comfortable with Mersenne Primes, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Pythagorean Triples Parametrisation?
Choosing m and n of the same parity, which gives a non-primitive triple.
How can I practise Pythagorean Triples Parametrisation?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Pythagorean Triples Parametrisation?
Move on to Pell’s Equation next.
Related expert topics in Discrete Math & Number Theory
- Strong Induction – Assume all earlier cases to prove the next.
- Well-Ordering Principle – Every nonempty set of positive integers has a least element.
- Partial Orders – Reflexive, antisymmetric, transitive relations.
- Cardinality of Sets – Comparing sizes of infinite sets.
- Countable and Uncountable Sets – ℕ and ℚ are countable; ℝ is not.
- Cantor’s Diagonal Argument – Proof that real numbers are uncountable.