We initiate the study of the sets $H(c)$, $0<c<1$, of real $x$ for which the
sequence $(kx)_{k\geq1}$ (viewed mod 1) consistently hits the interval $[0,c)$
at least as often as expected (i. e., with frequency $\geq c$). More formally,
\[ H(c)=\{\alpha\in \mathbf R\mid {\rm card}(\{1\leq k\leq n\mid <
k\alpha><c\})\geq cn, {for all}n\geq1\}. \] where $<x>=x-[x]$ stands for the
fractional part of $x\in \mathbb R$.
Given an irrational alpha and an x in the unit interval, the set of balanced
times, for which the same number of (k*alpha+x) (modulo one) are less than or
equal to one half as are larger than one half, is in general infinite, but
sparse in terms of density. We investigate the sparseness of this sequence in
terms of summation over reciprocals. Our results are that for the generic pair
(alpha,x), the resulting sum diverges, but there are certain exceptional alpha
for which the associated sums converge for every x.
Answering an informal question of K. Park, we show that by fixing some
irrational alpha to have a particular standard continued fraction expansion, we
may force the associated discrepancy sequences for all x in [0,1), which track
the difference between the number of values in the orbit of x under rotation by
alpha (modulo one) less than one half versus the number larger than one half,
to have maximal values which grow at a prescribed rate.