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: 5

Answer

If $a|b$ and $b|a$, where $a$ and $b$ are integers, then $a=b$ or $a=-b$.

Work Step by Step

Let $a|b$ and $b|a$, where $a, b\in \mathbb{Z}$. Because $a$ factors $b$, there exists some integer $c$ s.t. $a\cdot c=b$. Because $b|a$, there exists an integer $d$ s.t. $b\cdot d=a$. Combining these equations, we see that $a\cdot c=b\cdot d \cdot c=b$. This shows that the product of $b$ and $d$ is equal to 1; because they are integers, this further shows that $|b|=|d|=1$ Either both numbers are positive, or both are negative. If they are positive, then $a\cdot 1=b$, so $a=b$. If they are negative, then $a\cdot -1=b$, so $a=-b$. Thus concludes the proof for the statement above.
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.