Open problem, Arithmetic and number theory, Probability and statistics, posed 1909
Normality of π
Is a normal number in base (or in every integer base ) — that is, in the base- expansion of , does every finite block of digits occur with limiting asymptotic frequency ?
As of 2026, the normality of remains completely open in every base . Computations of past decimal digits reveal no statistically significant deviation from the uniform frequency for short digit blocks, and the Bailey–Crandall (2001) framework reduces base- normality of BBP-type constants to equidistribution of perturbed doubling maps . While Bailey and Crandall succeeded in proving normality for explicit Stoneham-type constants such as where the denominators grow lacunarily, the linear denominator polynomial in the BBP series for lacks the lacunarity needed to bound Weyl exponential sums unconditionally.
Best known results
- Borel (1909): the set of real numbers that fail to be normal in every integer base has Lebesgue measure .
- Bailey and Crandall (2001): is normal in base and base if the sequence with is equidistributed in .
Tools and where they stop
| Tool | Achieved | Where it stops |
|---|---|---|
| BBP digit-extraction formulas and Weyl equidistribution (Bailey–Crandall) | Translates base- normality of into equidistribution of an explicit 1D recurrence and proves normality for lacunary BBP-like constants | For , the perturbation term is non-lacunary, so iterated powers amplify errors before Weyl sums can be averaged |
| Multi-trillion-digit computation and statistical randomness testing | Confirms empirical equidistribution of digits and short blocks across more than decimal and hexadecimal digits of | Normality is an asymptotic property as ; any finite prefix of digits is compatible with both normality and complete failure of normality |
Open questions
- Does every digit occur infinitely often in the decimal expansion of ?
- Does the Bailey–Crandall equidistribution hypothesis hold for the BBP recurrence associated with ?
References
- Émile Borel (1909). Les probabilités dénombrables et leurs applications arithmétiques · DOI:10.1007/BF03019651
- David H. Bailey, Peter B. Borwein, Simon Plouffe (1997). On the rapid computation of various polylogarithmic constants · DOI:10.1090/S0025-5718-97-00856-9
- David H. Bailey, Richard E. Crandall (2001). On the random character of fundamental constant expansions · DOI:10.1080/10586458.2001.10504441
- Yann Bugeaud (2012). Distribution Modulo One and Diophantine Approximation · DOI:10.1017/CBO9781139017732