ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r∈(0,1)r\in(0,1) be an irrational algebraic real, and let pr(m)p_r(m) denote the number of distinct binary words of length mm occurring in the binary expansion of rr. Borel's conjecture. The binary string complexity of rr should satisfy

pr(m)=2m.p_r(m)=2^m.

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 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.