GCD with Remainder

Theorem
Let $$a, b \in \mathbb{Z}$$.

Let $$q, r \in \mathbb{Z}$$ such that $$a = q b + r$$.

Then $$\gcd \left\{{a, b}\right\} = \gcd \left\{{b, r}\right\}$$

where $$\gcd \left\{{a, b}\right\}$$ is the Greatest Common Divisor of $$a$$ and $$b$$.

Proof
The argument works the other way about:

Thus $$\gcd \left\{{a, b}\right\} = \gcd \left\{{b, r}\right\}$$.