Advanced Search

Let $q\ge 2$ and denote by $s_q$ the sum-of-digits function in base $q$. For $j=0,1,\cdots ,q-1$ consider $$\#\{0\le n\<N:s_q\left(2n\right)\equiv j(modq)\}.$$ In 1983, F. M. Dekking conjectured that this quantity is greater than $N/q$ and, respectively, less than $N/q$ for infinitely many $N$, thereby claiming an absence of a drift (or Newman) phenomenon. In this paper we prove his conjecture.