The normality conjecture for the limiting rational-base word

From papers

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

sat()=limksat(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/b1/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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Shalom Eliahou and Jean-Louis Verger-Gaugry, “The number system in rational base 3/2 and the 3x+1 problem”, arXiv:2504.13716 (2025).

Solutions 0

No solutions have been posted yet.