Euclidean Algorithm/Least Absolute Remainder/Examples/12378 and 3054

Examples of Use of Euclidean Algorithm: Least Absolute Remainder Variant
The GCD of $12378$ and $3054$ is:


 * $\gcd \set {12378, 3054} = 6$

and takes $4$ division operations to get there.

Proof
Thus:
 * $\gcd \set {12378, 3054} = 6$

As can be seen, it takes $4$ division operations.