In this paper we investigate the sums of reciprocal to an arithmetic progression mod 1. Bounds for these sums have been studied for a long while. In this paper we develop an alternative technique using the so-call three distance theorem which allows us to recover some of the known results in a more efficient form and obtain new bounds.
|Number of pages||15|
|Publication status||Published - 2017|