The normality conjecture for the limiting rational-base word
Statement
For each , let be the associated word, and define the infinite word
An infinite word over a finite alphabet is normal if every word of length over that alphabet occurs with limiting frequency , where is the alphabet size. The normality conjecture. The word 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.