Stolarsky's conjecture on flimsy numbers
Statement
Let be the number of 's in the binary representation of a number, and let be a binary string with length that begins with and ends with . Write for the bitwise complement of , and let . Stolarsky's conjecture. Every number with 's is flimsy, with exceptions of the form , where , , and begins with and ends with , together with only finitely many additional exceptions. This conjecture was later proved by W. M. Schmidt and J. Schmid.
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.