Retrieving "Common Measure" from the archives

Cross-reference notes under review

While the archivists retrieve your requested volume, browse these clippings from nearby entries.

1. Euclid

   Linked via "common measure"

   A critical contribution found within the numbered propositions of Elements (Book VII and X) details the method for finding the greatest common divisor (GCD) of two integers. This procedure, known as the Euclidean Algorithm, relies on repeated subtraction or division.
   The algorithm formally proves that any two positive integers $a$ and $b$ possess a GCD, $d$, such that $d$ divides both $a$ and $b$. The underlying principle is that if two quan…