This question is inspired by [xkcd #2585 (*Rounding*)](https://xkcd.com/2585/):


Let $u\_0,\ldots,u\_n$ be positive real numbers (we can assume w.l.o.g. that $u\_0=1$) or “units”.


Consider the following directed graph: its vertices are pairs $(i,k)$ where $0\leq i\leq n$ designates a unit, and $k\in\mathbb{Z}$ is a “measurement” performed in that unit. We place a directed edge from $(i,k)$ to $(j,\ell)$ whenever
$$
\ell = \lfloor k \cdot u\_i/u\_j \rceil
$$
where $\lfloor—\rceil$ means “closest integer to” (i.e., $\lfloor x\rceil = \lfloor x+\frac{1}{2}\rfloor$). Maybe assume that all $u\_i/u\_j$ are irrational so there is never any ambiguity as to what the closest integer means. In other words, we can get from $(i,k)$ to $(j,\ell)$ by converting unit $u\_i$ into unit $u\_j$ and rounding the result to the nearest integer.


**Question:** does there exist $u\_0,\ldots,u\_n$ such that the graph just defined has an infinite strongly connected component?


(In other words, can we find units such that infinitely many different values are reachable from one another by converting between these units and rounding to the nearest integer?)



How far away can we get by multiple rounding and unit change?
For a vertex $(i,k)$, it is reasonable to define its *value* as $ku\_i$. We show that the value cannot grow too large, which establishes a negative answer to the question.


Let $v$ be the current value, and let $V>v$ be a real number such that $\{V/u\_i\}<1/2$ for all $i$. Such a $V$ exists: we can start by choosing a very small $w>0$ such that $0<\{w/u\_i\}<\frac12$, and then approximate those values by $\{V/u\_i\}$ due to Kronecker.


We claim that the value cannot exceed $V$. Indeed, if the current value $ku\_i$ does not exceed $V$, then $ku\_i/u\_j$ rounds to at most $\lfloor V/u\_j\rfloor$ (check the brackets’ corners!), so the new value does not exceed $V$.


