$a, b, q, r \in$ integers such that $a=bq+r$. Prove or disprove $gcd(b,r)=gcd(a,q)$.
Here's what I did to prove it, and I would like someone's opinion:
Let $d=gcd(b,r)$. Then $d$ divides $b$ and $r$. So, $b+r=d(x+y)$.
Similarily, let $E=gcd(a,q)$. Then $E$ divides $a$ and $q$. So $a+q=E(j+k)$.
Putting both equations together, we get $d(x+y)=E(j+k)$.