Recounting the Rationals, part IVb: the Euclidean Algorithm

Suppose we have two integers, and we’d like to find their greatest common divisor (GCD). Recall that the greatest common divisor of two integers m and n is exactly that: the greatest integer …