Let a, b, c be nonzero integers, such that a|c, b|c and gcd(a, b)=1. Prove that ab|c.
Added by Mohamed J.
Step 1
** Show more…
Show all steps
Close
Your feedback will help us improve your experience
Madhur L and 56 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 gcd(ac, bc) = c gcd(a, b) for any integers, a ≠ 0, b ≠ 0, and c ≥ 1.
Vincenzo Z.
Let a and b be integers which are not both zero. (a) If c is an integer such that there exist integers x and y with ax + by = c, prove that gcd(a, b) | c. (b) If there exist integers x and y such that ax + by = 1, explain why gcd(a, b) = 1. (c) Let d = gcd(a, b), and write a = da' and b = db' for some a', b' ∈ Z. Prove that gcd(a', b') = 1.
Madhur L.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD