$\gcd(a, b) = \gcd(b, a \bmod b)$ when $b \neq 0$

Any common divisor of $a$ and $b$ also divides the remainder $a \bmod b$

The sequence of remainders strictly decreases and eventually reaches 0

All of the above