Prove that gcd(a+b, a-b) = gcd(2a, a-b) = gcd(a+b, 2b). (Please explain each step)
Added by Stephanie C.
Your feedback will help us improve your experience
Supreeta N and 99 other Discrete Mathematics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Recommended Videos
Show that if a, b, and c are integers such that gcd(a,b) = 1 and c divides a + b, then gcd(c, a) = gcd(c, b) = 1.
Supreeta N.
Show that if $a$ and $b$ are positive integers, then $a b=$ $\operatorname{gcd}(a, b) \cdot \operatorname{lcm}(a, b) .$ [Hint: Use the prime factorizations of $a$ and $b$ and the formulae for $\operatorname{gcd}(a, b)$ and $\operatorname{lcm}(a, b)$ in terms of these factorizations.
Number Theory and Cryptography
Primes and Greatest Common Divisors
Show that if $a, b,$ and $m$ are integers such that $m \geq 2$ and $a \equiv b(\bmod m),$ then $\operatorname{gcd}(a, m)=\operatorname{gcd}(b, m)$
Recommended Textbooks
Discrete Mathematics and its Applications
Higher Level Mathematics
Discrete Mathematics
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD