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

Answer

See below.

Work Step by Step

1. Use the method of contradiction, suppose the opposite is true: both $a$ and $b$ are odd. 2. Let $a=2m+1$ and $b=2n+1$ where $m,n$ are integers, we have $c^2=a^2+b^2$ must be even, that is $c$ is even. 3. Let $c=2k$, we have $(2k)^2=(2m+1)^2+(2n+1)^2$ or $4k^2=4(m^2+n^2)+4(m+n)+2$ 4. We can see that the left side is divisible by 4 while the right side is not (with a remainder of 2), thus we reached a contradiction. 5. We can conclude that the statement in the exercise is true.
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.