Show that gcd(ac, bc) = c gcd(a, b) for any integers, a ≠ 0, b ≠ 0, and c ≥ 1.
Added by Carrie S.
Step 1
** Show more…
Show all steps
Close
Your feedback will help us improve your experience
Vincenzo Zaccaro and 78 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
If gcd(a, c) = 1, prove that gcd(a, bc) = gcd(a, b).
Madhur L.
Let a, b, c be nonzero integers, such that a|c, b|c and gcd(a, b)=1. Prove that ab|c.
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
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD