Stolarsky's conjecture and the sum of digits of polynomial values

preprint2010arXivOpen access

Abstract

Let sq(n)s_q(n) denote the sum of the digits in the qq-ary expansion of an integer nn. In 1978, Stolarsky showed that lim inf⁡n→∞s2(n2)s2(n)=0. \liminf_{n\to\infty} \frac{s_2(n^2)}{s_2(n)} = 0. He conjectured that, as for n2n^2, this limit infimum should be 0 for higher powers of nn. We prove and generalize this conjecture showing that for any polynomial p(x)=ahxh+ah−1xh−1+...+a0∈Z[x]p(x)=a_h x^h+a_{h-1} x^{h-1} + ... + a_0 \in \Z[x] with h≥2h\geq 2 and ah>0a_h>0 and any base qq, lim inf⁡n→∞sq(p(n))sq(n)=0. \liminf_{n\to\infty} \frac{s_q(p(n))}{s_q(n)}=0. For any ε>0ε> 0 we give a bound on the minimal nn such that the ratio sq(p(n))/sq(n)<εs_q(p(n))/s_q(n) < ε. Further, we give lower bounds for the number of n<Nn < N such that sq(p(n))/sq(n)<εs_q(p(n))/s_q(n) < ε.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.