Borel's conjecture on binary string complexity of algebraic numbers
Statement
Let be an irrational algebraic real, and let denote the number of distinct binary words of length occurring in the binary expansion of . Borel's conjecture. The binary string complexity of should satisfy
This conjecture asserts that every possible binary word of each length occurs in the expansion of an irrational algebraic number. It was proven in 2007 by B. Adamczewski and Y. Bugeaud.
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.