greatest common divisor

The greatest common divisor ($gcd$) of integers $a,b$ is the greatest natural number $n$ such that $n$ divides both $a$ and $b$.

See also
Euclidean algorithm