The SlugMath Wiki is under heavy development!
Skill/Finding the GCD with the Euclidean algorithm
From SlugmathWiki
| Title | Finding the GCD with the Euclidean algorithm |
|---|
This skill involves finding the Def/Greatest common divisor of two elements of a Euclidean domain (such as $\ZZ$ or $\ZZ[i]$ or $\RR[X]$), by using the Euclidean algorithm.
