Discrepancy bounds for normal numbers generated by necklaces in arbitrary base (Q6168704)

\textit{M. B. Levin} [Acta Arith. 88, No. 2, 99--111 (1999; Zbl 0947.11023)] has constructed a number \(\lambda\) which is normal in base 2, and such that the sequence \((\{2^n\lambda\})\) has discrepancy \(D_N=O\left( \frac{\log^2 N}{N}\right)\). Now it is proved that this discrepancy bound is best possible. Moreover, for any prime \(p\) normal numbers \(\lambda\) in base \(p\) such that the discrepancy of the sequence \((\{p^n\lambda\})\) has order \(\frac{\log^2 N}{N}\) are constructed.