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

preprint2016arXivOpen access

Abstract

For a nonnegative integer tt, let ctc_t be the asymptotic density of natural numbers nn for which s(n+t)≥s(n)s(n + t) \geq s(n), where s(n)s(n) denotes the sum of digits of nn in base 22. We prove that ct>1/2c_t > 1/2 for tt in a set of asymptotic density 11, thus giving a partial solution to a conjecture of T. W. Cusick stating that ct>1/2c_t > 1/2 for all t. Interestingly, this problem has several equivalent formulations, for example that the polynomial X(X+1)⋯(X+t−1)X(X + 1)\cdots(X + t - 1) has less than 2t2^t zeros modulo 2t+12^{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.

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.