2016
DOI: 10.1137/15m1041857
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Abstract. For a nonnegative integer t, let ct be the asymptotic density of natural numbers n for which s(n + t) ≥ s(n), where s(n) denotes the sum of digits of n in base 2. We prove that ct > 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 ct > 1/2 for all t. Interestingly, this problem has several equivalent formulations, for example that the polynomial X(X + 1) · · · (X + t − 1) has less than 2 t zeros modulo 2 t+1 . The proof of the mai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
29
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 11 publications
(29 citation statements)
references
References 17 publications
0
29
0
Order By: Relevance
“…Note that the denominator H is identical to the denominator in [9]. Thus we can follow the known computations.…”
mentioning
confidence: 89%
See 4 more Smart Citations
“…Note that the denominator H is identical to the denominator in [9]. Thus we can follow the known computations.…”
mentioning
confidence: 89%
“…In order to prove the needed closeness property, we consider the random variable n → Θ(λ − s 2 (n) + u, n) − Φ(u/ √ λ)n. By bounding the second moment, using a procedure similar to the method used by Drmota, Kauers and Spiegelhofer [9] (see also [31]), we obtain an upper bound of the difference for all but few n.…”
Section: Remarkmentioning
confidence: 99%
See 3 more Smart Citations