Theorem 3.4. Let a and b be integers, not both zero, and supposethat 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. Showthat 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).
Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!
(Save $1 )
One time Pay
(Save $5 )
Billed Monthly
*First month only
You can see the logs in the Dashboard.
