Prove or disprove For integers a, b, c, and m with m, c > 0, if a ≡ b (mod mc), then a ≡ b (mod m)
Added by Jose Carlos C.
Step 1
Step 1: By definition, a ≡ b (mod mc) means that mc divides (a - b), or equivalently, a - b = k(mc) for some integer k. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Sri K and 91 other Algebra 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
Prove if a = b mod n and the integers a, b, n are all divisible by d > 0 then a/d = b/d mod n/d.
Sri K.
Let $m$ be a positive integer. Show that $a$ mod $m=$ $b \bmod m$ if $a \equiv b(\bmod m)$
Number Theory and Cryptography
Divisibility and Modular Arithmetic
Let $m$ be a positive integer. Show that $a \equiv b(\bmod m)$ if $a$ mod $m=b$ mod $m .$
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD