ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ss be the binary sum-of-digits function, and let ctc_t be the asymptotic density

ct=dens⁡{n≥0:s(n+t)≥s(n)}.c_t=\operatorname{dens}\{n\geq 0:s(n+t)\geq s(n)\}.

For t≥0t\geq 0, choose λ\lambda such that 2λ≤t<2λ+12^\lambda\leq t<2^{\lambda+1}, and define

t′=3⋅2λ−t.t'=3\cdot 2^\lambda-t.

Cusick's simplified conjecture. For all t≥0t\geq 0, one has ct+ct′>1c_t+c_{t'}>1; equivalently, at least one of tt or t′t' satisfies Cusick's conjecture. This is presented as an easier substitute for the original conjecture, whose full statement remains open; the paper proves only asymptotic versions and partial results.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.