Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 4 - Section 4.1 - Divisibility and Modular Arithmetic - Exercises - Page 244: 16

Answer

$m|a-b$, $a-b=km$, $a=b+km$

Work Step by Step

We are given that $$a\equiv b \text{ (mod }m), m\text{ positive integer}.$$ We have to prove that $$a\text{ (mod }m)\equiv b \text{ (mod }m).$$ Because $a\equiv b \text{ (mod }m)$, according to the definition it means that $$m| (a-b)$$ therefore there is an integer constant $k$ so that we have: $$a-b=km$$ which can be written as $$a=b+km.$$ Now taking modulo of each side we get $$a\text{ (mod }m)\equiv (b+km) \text{ (mod }m)$$ which means $$a\text{ (mod }m)\equiv b \text{ (mod }m).$$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.