arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.08623math.COcs.SCmath.NT
收藏

关于Cusick关于n与n + t的数字和的一个猜想

On a Conjecture of Cusick Concerning the Sum of Digits of n and n + t

Michael Drmota, Manuel Kauers, Lukas Spiegelhofer

摘要:

对于非负整数$t$,令$c_t$是自然数$n$的渐近密度,其中$s(n + t) \geq s(n)$,其中$s(n)$表示$n$在基$2$中的数字之和。本文证明了在渐近密度$1$集合中,对$t$的$c_t > 1/2$,从而部分地解决了T. W. Cusick指出,$c_t > 1/2$对所有t。有趣的是,这个问题有几个等价的公式,例如,多项式$X(X + 1)\cdots(X + t - 1)$具有小于$2^t$的零模$2^{t+1}$。主要结果的证明是基于切比雪夫不等式和三元有理函数的渐近分析,使用分析组合学的方法。

英文摘要:

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic density $1$, thus giving a partial solution to a conjecture of T. W. Cusick stating that $c_t > 1/2$ for all t. Interestingly, this problem has several equivalent formulations, for example that the polynomial $X(X + 1)\cdots(X + t - 1)$ has less than $2^t$ zeros modulo $2^{t+1}$. The proof of the main result is based on Chebyshev's inequality and the asymptotic analysis of a trivariate rational function, using methods from analytic combinatorics.

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

↑