The lower bound for binary ones in triangular numbers
Statement
Let be the th triangular number, and let denote the positions of the s in the binary representation of .
Binary-weight conjecture. If is such that , then .
This conjecture concerns how the number of s in the binary representation behaves under the triangular-number map. The supplied text gives no resolution, so its status 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.