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

Answer

See below.

Work Step by Step

(a) To prove the statement by contraposition, we need to prove "for any integer $n$, if $n$ is not odd, then $n^2$ will not be odd". To prove, let $n=2k$ be an even number, we have $n^2=4k^2$ which is an even number (not odd). Thus we proved the statement by contraposition. (b) To prove the statement by contradiction, suppose there exist an integer $n$, such that $n^2$ is odd while $n$ is even". Let $n=2k$, we have $n^2=4k^2$, an even number which contradicts to the condition that $n^2$ is odd. 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.