Greatest Common Divisor is in a set

User Generated

NOBFAVPU21

Mathematics

Description

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 

User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

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


Anonymous
Really great stuff, couldn't ask for more.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags