Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 4 - Elementary Number Theory and Methods of Proof - Exercise Set 4.6 - Page 206: 26

Answer

See below.

Work Step by Step

(a) To prove the statement by contraposition, we need to prove "for any integer $a,b,c$, if $a|b$, then $a|bc$". To prove, let $b=ka$ ($k$ is an integer), we have $bc=kac=(kc)a$ which leads to $a|bc$. Thus we proved the statement by contraposition. (b) To prove the statement by contradiction, suppose "there exist integers $a,b,c$, such that $a\nmid bc$, and $a|b$". Let $b=ka$ ($k$ is an integer), we have $bc=kac=(kc)a$ which leads to $a|bc$ in contradiction witth the condition $a\nmid bc$. Thus, we proved the statement by contradiction.
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.