ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each k≥1k\geq 1, let ⟨sat⁡(k)⟩\langle\operatorname{sat}(k)\rangle be the associated word, and define the infinite word

⟨sat⁡(∞)⟩=lim⁡k→∞⟨sat⁡(k)⟩.\langle\operatorname{sat}(\infty)\rangle=\lim_{k\to\infty}\langle\operatorname{sat}(k)\rangle.

An infinite word over a finite alphabet is normal if every word of length ℓ\ell over that alphabet occurs with limiting frequency 1/bℓ1/b^\ell, where bb is the alphabet size. The normality conjecture. The word ⟨sat⁡(∞)⟩\langle\operatorname{sat}(\infty)\rangle is normal. This is stated as a stronger conjecture motivated by numerical evidence; its status is 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 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.