The greatest common divisor of $a$ and $b$ is the largest number that divides both of them without leaving a remainder. Notation: $GCD(a,b)$.