Euclidean Algorithm/Euclid's Proof/Porism

Porism to Euclidean Algorithm

 * From this it is manifest that, if a (natural) number measure two numbers it will also measure their greatest common divisor.

Proof
An algebraic proof of this is given in Common Divisor Divides GCD.