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

Answer

This statement is false, as $2k^2-5k+2 = (2k-1)(k-2)$.

Work Step by Step

Since $2k^2-5k+2 = (2k-1)(k-2)$, for any $k \geq 4$, the expression must have 2 factors that are both greater than 1. Therefore, the resulting integer cannot be prime, as it has 2 factors in addition to 1 and the number itself, so it cannot be prime and the statement is contradicted.
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.