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.1 - Page 162: 39


The proof assumes that the integers are consecutive.

Work Step by Step

In setting $m=2k, n= 2k+1$, the person sets the two such that n is 1 more than m. Instead, the person should have set $n = 2d+1$, where $d$ is a completely separate integer.
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.