Let $r$ and $h$ be a real numbers and $n>0$. Write the fractional parts $\{k*r+h\}$, for $k = 1,2, . . . n$, in increasing order as $$ a_1 < a_2 < \cdots < a_n.$$ Let $D_n$ be the set of all the differences $a_{i+1} - a_i$ for $k = 1,2, \ldots, n-1.$ Can someone cite a reference or give a proof that $D_n$ contains at most $3$ elements for every $n$?
For the case $h = 0$, a certain paper calls this a "somewhat surprising and apparently little-known fact", without proof or reference. The proposition appears to be factual even when $h$ isn't $0$.