ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let jj be the number of 00's in the binary representation of a number, and let ss be a binary string with length ∣s∣=j|s|=j that begins with 11 and ends with 00. Write s‾\overline{s} for the bitwise complement of ss, and let i≥0i\geq 0. Stolarsky's conjecture. Every number with jj 00's is flimsy, with exceptions of the form s1is‾s1^i\overline{s}, where i≥0i\geq 0, ∣s∣=j|s|=j, and ss begins with 11 and ends with 00, 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 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.