Skill/Finding the GCD with the Euclidean algorithm

This skill involves finding the relies on::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.