Pythagorean triple generator

Every integer solution to a squared plus b squared equals c squared can be built from a pair of positive integers m greater than n using Euclid’s classical parametrization. Teachers, contest programmers, and curriculum authors need those triples on demand without hand-multiplying squares or mixing up which leg is even. This Pythagorean triple generator accepts m and n, rejects non-positive values and any pair where m is not strictly larger than n, and returns the triple a equals m squared minus n squared, b equals two m n, and c equals m squared plus n squared, together with a primitivity flag and a verification check.

Euclid’s formula and what m and n mean

Euclid’s formula is the standard constructive generator for Pythagorean triples in elementary number theory. Given integers m and n with m strictly greater than n and both positive, set a equal to m squared minus n squared, b equal to twice the product m times n, and c equal to m squared plus n squared. A short expansion shows that a squared plus b squared equals c squared identically, so every valid pair yields a genuine right-triangle triple with integer sides.

The classic classroom seed is m equals two and n equals one, which produces the familiar three-four-five triangle: a equals three, b equals four, and c equals five. Raising m to three with n equal to two produces five-twelve-thirteen; m equals four and n equals one produces fifteen-eight-seventeen. When m and n are coprime and of opposite parity—one even and one odd—the resulting triple is primitive: the three sides share no common divisor greater than one.

If m and n share a factor, or both are odd, the triple is still valid but scaled: for example m equals three and n equals one both odd yields eight-six-ten, which is two times three-four-five. This capability always returns the raw Euclid triple for the parameters you supply; it does not rescale, swap legs, or search for a generator from a target hypotenuse. You choose m and n; it multiplies out a, b, and c and reports whether that triple is primitive under the standard criterion.

What to enter, what you get and what is refused

Both parameters must be strictly greater than zero; zero or negative values are rejected because Euclid’s formula is stated for positive generators. Additionally m must be strictly greater than n—if m equals n then a collapses to zero and the figure is not a triangle, and if m is smaller than n the usual ordered form of the formula is violated. Failed validation is not billed.

Example: m equals two and n equals one yields a equals three, b equals four, c equals five, primitive true. Example: m equals six and n equals three yields a equals twenty-seven, b equals thirty-six, c equals forty-five, primitive false because the generators share a factor of three.

Where a Pythagorean triple generator earns its keep

Classrooms and tutoring platforms use a Pythagorean triple generator so learners can explore families of right triangles without arithmetic slips on squares and products. Contest and olympiad trainers seed problems with primitive triples and need a deterministic oracle that marks invalid generator pairs instead of silently returning a degenerate zero-leg triple. Curriculum generators can walk m and n in nested loops, skip non-primitive pairs when desired, and collect hypotenuse lists for worksheets.

Invalid input does not consume balance. Keep m and n modest for classroom ranges, pin the expected triple arrays in tests, and you get reproducible integer sides for homework, LMS plugins, and edge workers without standing up a computer-algebra stack of your own.