ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let t≥1t\geq 1 be an odd integer, and let ctc_t denote the correlation quantity associated with the binary sum-of-digits difference for tt. For each K≥1K\geq 1, consider the integer 2Kt−12^Kt-1 and its corresponding quantity c2Kt−1c_{2^Kt-1}. Block-appending conjecture. For each odd integer t≥1t\geq 1 we have

ct≥lim⁡K→∞c2Kt−1.c_t\geq\lim_{K\to\infty}c_{2^Kt-1}.

The conjecture formalizes replacing the rightmost 11 in the binary expansion of an odd integer by a 00 followed by infinitely many 11s. It is relevant because results cited in the source show ct>1/2c_t>1/2 when tt contains sufficiently many blocks of 11s, but the conjecture itself remains open in the source.

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.