Question

Given that the gcd(a, m) =1 and gcd(b, m) = 1. Prove that gcd(ab, m) =1

Given that the gcd(a, m) =1 and gcd(b, m) = 1. Prove that gcd(ab, m) =1

Homework Answers

Answer #1

gcd is greatest common divisor

So gcd of two or more integers is the largest positive integer that divide each of the integer

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
prove that if gcd(a,b)=1 then gcd (a-b,a+b,ab)=1
prove that if gcd(a,b)=1 then gcd (a-b,a+b,ab)=1
4. Let a, b, c be integers. (a) Prove if gcd(ab, c) = 1, then gcd(a,...
4. Let a, b, c be integers. (a) Prove if gcd(ab, c) = 1, then gcd(a, c) = 1 and gcd(b, c) = 1. (Hint: use the GCD characterization theorem.) (b) Prove if gcd(a, c) = 1 and gcd(b, c) = 1, then gcd(ab, c) = 1. (Hint: you can use the GCD characterization theorem again but you may need to multiply equations.) (c) You have now proved that “gcd(a, c) = 1 and gcd(b, c) = 1 if and...
Prove that if a|n and b|n and gcd(a,b) = 1 then ab|n.
Prove that if a|n and b|n and gcd(a,b) = 1 then ab|n.
Prove that for positive integers a and b, gcd(a,b)lcm(a,b) = ab. There are nice proofs that...
Prove that for positive integers a and b, gcd(a,b)lcm(a,b) = ab. There are nice proofs that do not use the prime factorizations of a and b.
Prove that if gcd(a,b)=1 and c|(a+b), then gcd(a,c)=gcd(b,c)=1.
Prove that if gcd(a,b)=1 and c|(a+b), then gcd(a,c)=gcd(b,c)=1.
Prove that if a > b then gcd(a, b) = gcd(b, a mod b).
Prove that if a > b then gcd(a, b) = gcd(b, a mod b).
Assume that gcd(a, m) = 1, gcd(a, n) = 1, and gcd(m, n) = 1. Assume...
Assume that gcd(a, m) = 1, gcd(a, n) = 1, and gcd(m, n) = 1. Assume that a has order s modulo m and order t modulo n. What is the order of a modulo mn? Prove that your answer is correct
Prove that for all non-zero integers a and b, gcd(a, b) = 1 if and only...
Prove that for all non-zero integers a and b, gcd(a, b) = 1 if and only if gcd(a, b^2 ) = 1
How can I prove that if a>b>0, gcd(a,b) = gcd(a-b,b)
How can I prove that if a>b>0, gcd(a,b) = gcd(a-b,b)
suppose p is a prime number and p2 divides ab and gcd(a,b)=1. Show p2 divides a...
suppose p is a prime number and p2 divides ab and gcd(a,b)=1. Show p2 divides a or p2 divides b.