The sum of digits of polynomial values in arithmetic progressions

Abstract

Let $q,m\ge 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbbZ[x]$ be a polynomial of degree $h\ge 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We show that there exist $C=C(q,m,p)>0$ and $N_0=N_0(q,m,p)\ge 1$, such that for all $g\in \mathbb{Z}$ and all $N\ge N_0$, $$#\{0\leq n< N: \quad s_q(p(n))\equiv g \bmod m\}\geq C N^{4/(3h+1)}.$$ This is an improvement over the general lower bound given by Dartyge and Tenenbaum (2006), which is $C{N}^{2/h!}$.

arXiv comment6 pages