Show that, for any integers a and b, there are integers m and n such that gcd(a,b) = ma + nb. Hint: let d=gcd (a,b). Then a/d and b/d are integers. What is gcd(a/d, b/d)?
Added by Jaime D.
Your feedback will help us improve your experience
Adi S and 89 other Calculus 3 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.
Key Concepts
Recommended Videos
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)$
Number Theory and Cryptography
Primes and Greatest Common Divisors
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.
Show that if $m$ is an integer greater than 1 and $a c \equiv$ $b c(\bmod m),$ then $a \equiv b(\bmod m / \operatorname{gcd}(c, m))$
Solving Congruences
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD