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

Answer

The proof does not prove the statement for all k.

Work Step by Step

In "proving" the statement, the argument only checks the $k=2$ case. While this demonstrates the truth of the theorem for $k=2$, it does not show that the theorem is true for all $k$, so it is invalid.
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.