Prove or disprove: (a) If a b (mod n) and n j d, then a b (mod d) (b) If a b (mod n) and d j n, then a b (mod d)
Added by John O.
Step 1
Step 1: We are given that a b (mod n), which means that n divides (a - b). Show more…
Show all steps
Close
Your feedback will help us improve your experience
Hoan Nguyen and 79 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 the following: a. [(a mod n) - (b mod n)] mod n = (a - b) mod n b. [(a mod n) x (b mod n)] mod n = (a x b) mod n
Hoan N.
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.
Prove or disprove (with a counterexample and explanation) each of the following claims. (a) If n is a positive integer and a and b are integers such that n|ab and n - a, then n|b. (b) Let a, b, d, n ∈ Z with n ≥ 1. Suppose d > 0. If a ≡ b (mod n) and d|n, then a ≡ b (mod d).
Adi S.
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