Heuristic exponent conjecture for (2,1,2)-numbers
Statement
Let denote the number of ones in the binary expansion of , and let count the -numbers not exceeding , where the relevant case consists of positive integers for which .
Heuristic exponent conjecture for -numbers.
The prediction comes from treating and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.