2000 character limit reached
On absolutely normal numbers and their discrepancy estimate (1702.04072v2)
Published 14 Feb 2017 in math.NT and cs.OH
Abstract: We construct the base $2$ expansion of an absolutely normal real number $x$ so that, for every integer $b$ greater than or equal to $2$, the discrepancy modulo $1$ of the sequence $(b0 x, b1 x, b2 x , \ldots)$ is essentially the same as that realized by almost all real numbers.