Question

Show that if a and b are positive integers where a is even and b is...

Show that if a and b are positive integers where a is even and b is odd, then gcd(a, b) =
gcd(a/2, b).

Homework Answers

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
(a) If a and b are positive integers, then show that gcd(a, b) ≤ a and...
(a) If a and b are positive integers, then show that gcd(a, b) ≤ a and gcd(a, b) ≤ b. (b) If a and b are positive integers, then show that a and b are multiples of gcd(a, b).
(a) If a and b are positive integers, then show that lcm(a, b) ≤ ab. (b)...
(a) If a and b are positive integers, then show that lcm(a, b) ≤ ab. (b) If a and b are positive integers, then show that lcm(a, b) is a multiple of gcd(a, b).
Prove: Let a and b be integers. Prove that integers a and b are both even...
Prove: Let a and b be integers. Prove that integers a and b are both even or odd if and only if 2/(a-b)
If a and b are any odd integers, then a^2 + b^2 is even.
If a and b are any odd integers, then a^2 + b^2 is even.
Prove by contradiction that: For all integers a and b, if a is even and b...
Prove by contradiction that: For all integers a and b, if a is even and b is odd, then 4 does not divide (a^2+ 2b^2).
9. Let a, b, q be positive integers, and r be an integer with 0 ≤...
9. Let a, b, q be positive integers, and r be an integer with 0 ≤ r < b. (a) Explain why gcd(a, b) = gcd(b, a). (b) Prove that gcd(a, 0) = a. (c) Prove that if a = bq + r, then gcd(a, b) = gcd(b, r).
Show that there are infinitely many pairs integers a and b with gcd(a, b) = 5...
Show that there are infinitely many pairs integers a and b with gcd(a, b) = 5 and a + b = 65
Define the set E to be the set of even integers; that is, E={x∈Z:x=2k, where k∈Z}....
Define the set E to be the set of even integers; that is, E={x∈Z:x=2k, where k∈Z}. Define the set F to be the set of integers that can be expressed as the sum of two odd numbers; that is, F={y∈Z:y=a+b, where a=2k1+1 and b=2k2+1}.Please prove E=F.
Prove Euler’s theorem: if n and a are positive integers with gcd(a,n)=1, then aφ(n)≡1 modn, where...
Prove Euler’s theorem: if n and a are positive integers with gcd(a,n)=1, then aφ(n)≡1 modn, where φ(n) is the Euler’s function of n.
1. (a) Let a, b and c be positive integers. Prove that gcd(ac, bc) = c...
1. (a) Let a, b and c be positive integers. Prove that gcd(ac, bc) = c x gcd(a, b). (Note that c gcd(a, b) means c times the greatest common division of a and b) (b) What is the greatest common divisor of a − 1 and a + 1? (There are two different cases you need to consider.)
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT