Euclidean Algorithm/Least Absolute Remainder/Examples
Jump to navigation
Jump to search
Examples of Use of Euclidean Algorithm: Least Absolute Remainder Variant
Example: $12378$ and $3054$
The GCD of $12378$ and $3054$ is:
- $\gcd \set {12378, 3054} = 6$
and takes $4$ division operations to get there.