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.4 - Page 189: 19

Answer

By simple algebraic manipulation, we see that $n^{2}-n+3$$=n(n-1)+3=n(n-1)+2+1$. We now examine two cases: $n$ is even, then $n$ is odd. Let $n$ be even. By the definition of even, $n=2k$ for some integer $k$. Therefore, we have $n^{2}-n+3=n(n-1)+2+1$$=2k(2k-1)+2+1$$=2[k(2k-1)+1]+1$. This is odd because it is of the form $2x+1$ for some integer $x$, so $n^{2}-n+3$ is odd. Now let $n$ be odd. By the definition of odd, $n=2k+1$ for some integer $k$. Therefore, we have $n^{2}-n+3=n(n-1)+2+1$$=(2k+1)[(2k+1)-1]+2+1=(2k+1)(2k)+2+1$$=2[k(2k+1)+1]+1$. This is also odd, since it is of the form $2x+1$ for some integer $x$, and so $n^{2}-n+3$ is again odd. Since $n^{2}-n+3$ is odd in either case, since these are the only two possible cases, and since $n$ was arbitrarily chosen, we conclude that $n^{2}-n+3$ is odd for all integers $n$.

Work Step by Step

In both cases, the assertion that $x$ (representing $k(2k-1)+1$ and $k(2k+1)+1$, respectively) is an integer may be justified by the fact that it is the result of adding, subtracting, and multiplying integers.
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.