arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.4169math.NTmath.CO
收藏

Stolarsky猜想与多项式值的位数和

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

K. G. Hare, S. Laishram, T. Stoll

摘要:

令$s_q(n)$表示整数$n$的$q$进制展开中的数字之和。在1978年,Stolarsky表明,$$ \liminf_{n\to\infty} \frac{s_2(n^2)}{s_2(n)} = 0. $$他解释说,作为$n^2$,这个极限下确界应该是0的更高权力的$n$。我们证明和推广这个猜想表明,任何多项式$p(x)=a_h x^h+a_{h-1} x^{h-1} + ... + a_0 \in \Z[x]$与$h\geq 2$和$a_h>0$和任何基$q$,\[ \liminf_{n\to\infty} \frac{s_q(p(n))}{s_q(n)}=0.\]对于任何$ε> 0$,我们给出了一个最小$n$的界限,使比率$s_q(p(n))/s_q(n) < ε$。进一步,我们给出了$n < N$的个数的下界,使得$s_q(p(n))/s_q(n) < ε$ .

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑