ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B(n)B(n) denote the number of ones in the binary expansion of nn, and let p(k,l,m)(n)p_{(k,l,m)}(n) count the (k,l,m)(k,l,m)-numbers not exceeding nn.

Asymptotic conjecture for (2,k,k)(2,k,k)-numbers. For each kk,

\np(2,k,k)(n)=n(log⁡n)1/2Gk+R(n),Gk=2log⁡2π(k2+k),R(n)=o(n(log⁡n)1/2).\np_{(2,k,k)}(n)=\frac{n}{(\log n)^{1/2}}G_k+R(n),\qquad G_k=\sqrt{\frac{2\log2}{\pi(k^2+k)}},\qquad R(n)=o\left(\frac{n}{(\log n)^{1/2}}\right).

This is part of the source's heuristic predictions based on a random model for binary digit counts. The formula and error estimate are not proved in the source and remain open.

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.