In my elementary number theory textbook, there is a problem that is meant to help understand the proof of Dirichlet's rational approximation theorem. There are two parts to the problem: the first part asks:
Let $x$ be an irrational number, and let $n$ be a positive integer. For each integer $b$ between 1 and $n$, let $r_b = bx - \lfloor bx \rfloor$. The set $S = \{0, r_1, r_2, \ldots, r_n, 1\}$ contains $n + 2$ real numbers between 0 and 1. Prove that there are elements $s, t \in S$ such that $$0 < t - s \leq \frac{1}{n + 1}.$$
This I have proved and am convinced is true. However, the next part asks to prove that there exist integers $a, b$, such that $1 \leq b \leq n$ and $$|bx - a| \leq \frac{1}{n + 1}.$$ Hint: consider the previous part. Three cases are needed: $s = 0, t = r_b$, or $s= r_b, t = 1$, or $s = r_b, t = r_e$.
The first case is quite simple. We have that $r_b = bx - \lfloor bx \rfloor$, by definition. Rearranging, we obtain $bx = r_b + \lfloor bx \rfloor$. Let $a = \lfloor bx \rfloor$ which gives us $$|bx - \lfloor bx \rfloor| = |bx - a| = |r_b| \leq t - s \leq \frac{1}{n + 1}$$
since $s = 0, t = r_b \in S$. But the second and third case is where I get stuck. I try taking the same approach for the second case (where $s = r_b$ and $t = 1$), but it seems to not work. For instance, we have again that $r_b = bx - \lfloor bx \rfloor \implies bx = r_b - \lfloor bx \rfloor$. Let $a = \lfloor bx \rfloor$ which gives us
$$|bx - \lfloor bx \rfloor| = |bx - a| = |r_b| = |s| \leq t - s \leq \frac{1}{n + 1}$$
but this isn't always true? I am stuck here and any help would be appreciated.