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, where the relevant case consists of positive integers nn for which B(n)=B(n2)B(n)=B(n^2).

Heuristic exponent conjecture for (2,1,2)(2,1,2)-numbers.

\np(2,1,2)(n)=nα+o(1),α=log⁡1.6875log⁡2≃0.7548875.\np_{(2,1,2)}(n)=n^{\alpha+o(1)},\qquad \alpha=\frac{\log 1.6875}{\log 2}\simeq0.7548875.

The prediction comes from treating B(n)B(n) and B(n2)B(n^2) as independent random variables with equally likely zero and one outcomes. Known bounds in the source are weaker, so this asymptotic remains 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.