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

Answer

If $k$ is an integer, then $ceiling(k)$ is the integer $n$ such that $n-1$

Work Step by Step

Note that $\leq$ is a reflexive relation over the real numbers; that is, for any number $x$ like $0$, $3$, $-\frac{13}{2}$, or pi (3.14159...), it is always the case that $x\leq x$, since $x=x$.
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.