Normality of (open)
Statement
Fix an integer base . A real number is normal in base if for every each of the blocks of digits occurs in the base- expansion of with asymptotic frequency ; it is absolutely normal if it is normal in every base .
Question. Is normal in base ? In any base?
Status: open. It is not known whether is normal in a single base. Much less is known than that: it is not even known whether every one of the digits occurs infinitely often in the decimal expansion of . The same questions are open for , for , and for . No naturally occurring constant has ever been proved normal.
Remarks
Not proved in this library, and not provable anywhere at present. Nothing here depends on any digit statistic of .
What is known, and what would settle it. Borel (1909) proved that almost every real number is absolutely normal, so normality is the typical behaviour and the exceptions form a null set; stating that theorem correctly needs the measure notions of the deferred measure and integration track. Explicit normal numbers are easy to write down once one stops asking for a familiar constant: Champernowne's constant is normal in base , and Sierpinski and Turing gave constructions of absolutely normal numbers. Computations have checked hundreds of trillions of decimal digits of against the usual statistical tests, which they pass; the published record stood at trillion digits in November 2025, and the digit statistics of such runs are reported routinely. Passing a statistical test is evidence and not a proof, and no amount of computation can settle an asymptotic frequency. The most concrete programme is Bailey and Crandall's: the Bailey-Borwein-Plouffe formula for reduces base- normality of to a uniform-distribution statement about a specific chaotic iteration, their "Hypothesis A", which would settle the base- case if proved. Hypothesis A is open.
Why it matters here. This library defines analytically and will prove sharp facts about it, and a reader is entitled to ask what is not known. The answer is instructive: a constant can be pinned down exactly by a convergent series, be computable to arbitrary precision, and still resist the most basic question about its digits. Normality is also where analysis stops being able to help and measure-theoretic and number-theoretic tools take over, which is why it sits in this category rather than on a page.
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Nothing. This result depends on no other item in the library.
Sources
- Normal number (Wikipedia) (standard reference, not scraped)
- D. H. Bailey and R. E. Crandall, On the random character of fundamental constant expansions, Experimental Mathematics 10 (2001) 175-190 (standard reference, not scraped)
- Champernowne constant (Wikipedia) (standard reference, not scraped)
- Chronology of computation of π (Wikipedia) (standard reference, not scraped)