1

I'm working on proving the following statement:

Show that if r is an irrational number, there is a unique integer n such that the distance between r and n is less than $\frac{1}{2}$.

How do I show uniqueness using a proof by contradiction? How do I first establish that such a case even exists?

I have no idea where to start.

leonbloy
  • 63,430
Bob Shannon
  • 1,561

2 Answers2

6

For uniqueness.

Suppose there were two distinct integers $n$ and $m$ such that $|r - n| < 1/2$ and $|r - m| < 1/2$. Then $|n - m| \le |r - n| + |r - m| < 1/2 + 1/2 = 1$, i.e., $|n - m| < 1$. But as $n$ and $m$ are two distinct integers we have a contradiction since $|n - m| \ge 1$.

zrbecker
  • 4,048
1

For existence consider $\lfloor r+\dfrac12 \rfloor$. For uniqueness note that if $m,n \in \mathbb{Z}$ are two such numbers, then $|m-n| = \left|(m-r)+(r-n)\right| \le |m-r| + |n-r|$.

njguliyev
  • 14,473
  • 1
  • 26
  • 43