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

09/29/2015
by   Michael Drmota, et al.
Johannes Kepler University Linz
TU Wien
0

For a nonnegative integer t, let c_t 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 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)...(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.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/03/2023

An asymptotic formula for Aldaz-Kounchev-Render operators on the hypercube

We prove a version of a conjecture concerning the asymptotic behavior of...
04/26/2021

Compact Packings are not always the Densest

We provide a counterexample to a conjecture by B. Connelly about density...
01/29/2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

Vizing's conjecture (open since 1968) relates the sizes of dominating se...
08/02/2017

A Periodic Isoperimetric Problem Related to the Unique Games Conjecture

We prove the endpoint case of a conjecture of Khot and Moshkovitz relate...
10/04/2017

Sum of Square Proof for Brascamp-Lieb Type Inequality

Brascamp-Lieb inequality is an important mathematical tool in analysis, ...
05/09/2021

The D-plus Discriminant and Complexity of Root Clustering

Let p(x) be an integer polynomial with m≥ 2 distinct roots ρ_1,…,ρ_m who...

Please sign up or login with your details

Forgot password? Click here to reset