Asymptotic conjecture for (2,k,k)-numbers
Statement
Let denote the number of ones in the binary expansion of , and let count the -numbers not exceeding .
Asymptotic conjecture for -numbers. For each ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.