Show that if a, b (= Z such that a, b not= 0, then gcd(9a, 9b) = 9 · gcd(a, b).
[Hint: Let d = gcd(a, b). Then show that the product 9d satisfies the definition of the GCD of 9a and 9b
d=gcd(a, b) if and only if then a = d*a' and b = d*b' where a' and b' are mutually prime integers.
Since 9a = (9d)*a' and 9b = (9d)*b', we conclude that 9d = gcd(9a, 9b).
Content will be erased after question is completed.
Enter the email address associated with your account, and we will email you a link to reset your password.
Forgot your password?