Let m be a positive integer. Show that a mod m = b mod m if a ≡ b (mod m).
We have to show that if then a (mod m) = b(mod m)
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
Since the solution to 16E from 4.1 chapter was answered, more than 310 students have viewed the full step-by-step answer. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The answer to “Let m be a positive integer. Show that a mod m = b mod m if a ? b (mod m).” is broken down into a number of easy to follow steps, and 21 words. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. This full solution covers the following key subjects: mod, Integer, let, Positive, show. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 16E from chapter: 4.1 was answered by , our top Math solution expert on 06/21/17, 07:45AM.