Question

Prove that if (a,b)=d and k>0, then gcd(ka,kb)=kd.

Prove that if (a,b)=d and k>0, then gcd(ka,kb)=kd.

Homework Answers

Answer #1

here I took the help of text book elementory number theory by zuckerman, if you have any difficulty with the solution please ask in comment box. Thank you.

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
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)
Prove that if b doesnt equal 0, and a = bx + cy, then gcd(b,c) <=...
Prove that if b doesnt equal 0, and a = bx + cy, then gcd(b,c) <= gcd(a,b)
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).
Let a be an element of order n in a group and d = gcd(n,k) where...
Let a be an element of order n in a group and d = gcd(n,k) where k is a positive integer. a) Prove that <a^k> = <a^d> b) Prove that |a^k| = n/d c) Use the parts you proved above to find all the cyclic subgroups and their orders when |a| = 100.
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 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 Ka x Kb = Kw for a conjugate acid/base pair.
Prove that Ka x Kb = Kw for a conjugate acid/base pair.
Let a E Z+ such that Gcd (k,a)=1. Determine whether( a, 2a, 3a.... ,ka) is a...
Let a E Z+ such that Gcd (k,a)=1. Determine whether( a, 2a, 3a.... ,ka) is a complete set of residues modulo k
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
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT