Proposition: 7.01: Sufficient Condition for Coprimality

Euclid's Formulation

Two unequal numbers (being) laid down, and the lesser being continually subtracted, in turn, from the greater, if the remainder never measures the (number) preceding it, until a unit remains, then the original numbers will be prime to one another.

fig01e

Modern Formulation

See co-prime numbers.

Proofs: 1

Proofs: 1


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs
non-Github:
@Fitzpatrick


References

Bibliography

  1. Scheid Harald: "Zahlentheorie", Spektrum Akademischer Verlag, 2003, 3rd Edition

Adapted from (subject to copyright, with kind permission)

  1. Fitzpatrick, Richard: Euclid's "Elements of Geometry"

Adapted from CC BY-SA 3.0 Sources:

  1. Prime.mover and others: "Pr∞fWiki", https://proofwiki.org/wiki/Main_Page, 2016