In: Advanced Math
Theorem 3.4. Let a and b be integers, not both zero, and suppose that b = aq + r
for some integers q and r. Then gcd(b, a) = gcd(a, r).
a) Suppose that for some integer k > d, k | a and k | r. Show that k | b also. Deduce that k is a common divisor of b and a.
b) Explain how part (a) contradicts the assumption that d = gcd(b, a).