Struct/The Euclidean algorithm applied to 123 and 73

The following demonstrates the Euclidean algorithm, applied to the natural numbers $123$ and $73$. From the demonstration below, one can deduce that $GCD(123, 73) = 1$, since greatest common divisors can be found with the Euclidean algorithm.