Euclidean Algorithm

Prove that
\[
  \gcd(b,a)=\gcd(a,r)
\]
where $r$ is the remainder
\[
  b=ka+r
\]
given by the division algorithm.

Solutions