One way of computing the greatest common divisor of two integers is to use an ancient technique called the Euclidean algorithm, which reduces this multiplicative task to an efficient process involving addition and subtraction. We show why this algorithm works and give an example of it in practice.