Tag archives for euclid

From Euclid to Fermat

Primitive Pythagorean Triples, or PPT’s, are non-trivial integer solutions to the Pythagorean equation z2 = x2 + y2 where we assume that 0<x<y<z, and that x, y and z are co-prime. Euclid’s formulae allow PPT’s to be generated using 2 (positive integer) parameters, usually denoted by m and n. The PPT’s (usually) take the form […]