Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 4.1.16 (Prove $\lfloor 2\alpha \rfloor + \lfloor 2\beta \rfloor \geq \lfloor \alpha \rfloor+ \lfloor \beta \rfloor + \lfloor \alpha + \beta \rfloor$ )
Exercise 4.1.16 (Prove $\lfloor 2\alpha \rfloor + \lfloor 2\beta \rfloor \geq \lfloor \alpha \rfloor+ \lfloor \beta \rfloor + \lfloor \alpha + \beta \rfloor$ )
Prove that holds for every pair of real numbers, but that does not.
Answers
Proof.
- (a)
-
We write
so that .
-
If , then so
This gives , and by Theorem 4.1(4), , thus
-
If , then
so .
Moreover .
Note that is always true, but here we can say a little more. Since , then or (perhaps both are true), thus
therefore or (and ), so that in any case
Then
In both cases, we obtain
-
- (b)
-
With the notations of part (a),
To build a counterexample, if suffices to find and such that
Since satisfy these condition, an explicit counterexample is
Check: