Greatest Common Divisor is in a set

Algebra
Tutor: None Selected Time limit: 1 Day

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 

Mar 25th, 2015

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).

Mar 25th, 2015

Are you studying on the go? Check out our FREE app and post questions on the fly!
Download on the
App Store
...
Mar 25th, 2015
...
Mar 25th, 2015
Dec 7th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer