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

Answer

a. 5 | n b. 5 |$ n^2$ c. 5k d. $(5k)^2$ e. 5 |$ n^2$

Work Step by Step

[The contrapositive is: For all integers n, if 5 |n then 5 | n2.] Suppose n is any integer such that $5|n$ . [We must show that 5 |$ n^2$ .] By definition of divisibility, n = $5k$ for some integer k. By substitution, $n^2$ =$(5k)^2$ = $5(5k^2)$. But $5k^2$ is an integer because it is a product of integers. Hence $n^2$ = 5· (an integer), and so 5 |$ n^2$ [as was to be shown].
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.