Given two numbers not prime to one another, to find their greatest common measure.
Proof
Run the anthyphairesis (Euclidean algorithm). Since the numbers are
not prime to one another, the procedure terminates at a non-unit
remainder d; that d measures both inputs, and any other common
measure also divides d by the same persistence argument as VII.1.