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$. 



Differences of consecutive ordered fractional parts
The case $h=0$ is known as the "Three-Distance Theorem"; just google for numerous references or look [here](https://sumidiot.wordpress.com/2009/12/23/the-steinhaus-conjecture) for discussion and nice pictures, or [here](http://www.theoremoftheday.org/NumberTheory/ThreeDistance/TotDThreeDistance.pdf) for an interesting historical comment.


A standard reformulation of the theorem is as follows: if, for an irrational $\alpha$, the unit-length circle is partitioned "in the natural way" into $n$ arcs by the points $\alpha k$ with $k\in[1,n]$, then the lengths of these $n$ arcs take just two or three distinct values. This easily implies the case $h\ne 0$ where you basically select one of the arcs (that containing the point corresponding to $h$) and confine to the lengths of the remaining $n-1$ arcs.


