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.5 - Page 197: 29

Answer

Let $n$ be any odd integer. Then $n=2k+1$ for some integer $k$, so $\lceil\frac{n^{2}}{4}\rceil=\lceil\frac{(2k+1)^{2}}{4}\rceil=\lceil\frac{4k^{2}+4k+1}{4}\rceil$$=\lceil k^{2}+k+\frac{1}{4}\rceil$. Applying the analogue of ceiling functions for Theorem 4.5.1, we get $\lceil k^{2}+k+\frac{1}{4}\rceil=k^{2}+k+\lceil\frac{1}{4}\rceil=k^{2}+k+1$. Substituting $\frac{n-1}{2}$ for $k$, we in turn get $k^{2}+k+1$$=(\frac{n-1}{2})^{2}+\frac{n-1}{2}+1=\frac{(n^{2}-2n+1)+(2n-2)+4}{4}=\frac{n^{2}+3}{4}$. Since $n$ was an arbitrary odd integer, we conclude that the result holds for all odd integers.

Work Step by Step

By "analogue for ceiling functions of Theorem 4.5.1," we mean that for any integer $m$ and any real number $k$, it is the case that $\lceil m+x\rceil=m+\lceil x\rceil$. The proof of this is quite simple and is almost identical to the proof of Theorem 4.5.1 itself. An alternative would be to make use of the "weaker" result of exercise 7, which states the same for $0\leq x\lt1$.
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.