The truncated sum of digits function of polynomial sequences (Q2168690)

Let \(q\ge 2\) be an integer and let \(s_q(n)\) denote the sum of digits of the positive integer \(n\) in base \(q\). The properties of \(s_q(n)\) on polynomial sequences have been studied by many authors. E.g., for \(P \in \mathbb{Z}[x]\) with \(P(\mathbb{N})\subset \mathbb{N}\), the normality theorem of \textit{H. Davenport} and \textit{P. Erdős} [Can. J. Math. 4, 58--63 (1952; Zbl 0046.04902)] implies that \[ \sum_{n\le x} s_q(P(n)) \sim \frac {q-1}{2} \deg (P)\;x \log_q x \] as \(x\to \infty\). \textit{A. O. Gelfond} [Acta Arith. 13, 259--265 (1968; Zbl 0155.09003)] studied the distribution of \(s_q(n)\) in residue classes and also suggested to evaluate \[ \sum_{\substack{n\le x \\ s_q(P(n))\equiv a \bmod m}} 1. \] \textit{C. Dartyge} and \textit{G. Tenenbaum} [Bull. Lond. Math. Soc. 38, No. 1, 61--69 (2006; Zbl 1153.11307)] gave a first answer to Gelfond's problem. Their lower bound was improved by \textit{T. Stoll} [Funct. Approximatio, Comment. Math. 47, No. 2, 233--239 (2012; Zbl 1315.11010)]. \textit{C. Mauduit} and \textit{J. Rivat} [Acta Math. 203, No. 1, 107--148 (2009; Zbl 1278.11076)] gave a precise answer to Gelfond's problem for \(P(n)=n^2\). This result was generalized by \textit{M. Drmota} et al. [J. Lond. Math. Soc., II. Ser. 84, No. 1, 81--102 (2011; Zbl 1257.11009)] for prime \(q\) large enough in terms of \(\deg (P)\). In the paper under review, the authors consider the truncated sum of digits function \(s_q(P(n)\bmod q^k)\) (introduced by \textit{M. Drmota} and \textit{J. Rivat} [J. Lond. Math. Soc., II. Ser. 72, No. 2, 273--292 (2005; Zbl 1092.11006)] for \(P(n)=n^2\)), i.e., the sum of the first \(k\) digits. The authors prove that \(s_q(P(n)\bmod q^k)\) is asymptotically equidistributed in residue classes for any base.