Proposition: 7.03: Greatest Common Divisor of Three Numbers

(Proposition 3 from Book 7 of Euclid's “Elements”)

To find the greatest common measure of three given numbers (which are) not prime to one another. * Let $A$, $B$, and $C$ be the three given numbers (which are) not prime to one another. * So it is required to find the greatest common measure of $A$, $B$, and $C$.

fig03e

Modern Formulation

See the greatest common divisor of more than two numbers.

Notes

Proofs: 1

Proofs: 1


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

Github:
bookofproofs
non-Github:
@Calahan


References

Adapted from CC BY-SA 3.0 Sources:

  1. Callahan, Daniel: "Euclid’s 'Elements' Redux" 2014
  2. Prime.mover and others: "Pr∞fWiki", https://proofwiki.org/wiki/Main_Page, 2016

Bibliography

  1. Health L. Thomas (Transl.): "Euclid's Elements - all thirteen books", Green Lion Press, 2013,