In mathematics, a normal number is, roughly speaking, a real number whose digits show a random distribution with all digits being equally likely. "Digits" refers to the finitely many digits before the point and the infinite sequence of digits after the point.
Suppose b>1 is an integer and x is a real number. Consider the digit sequence of x in the base b positional number system. If s is a finite string of digits in base b, we write N(s,n) for the number of times the string s occurs among the first n digits of x. The number x is called normal in base b if
The concept was introduced by Émile Borel in 1909. Using the Borel-Cantelli lemma, he proved the normal number theorem: almost all real numbers are normal, in the sense that the set of non-normal numbers has Lebesgue measure zero. However, the set of non-normal numbers is uncountable.
Champernowne’s number
No rational number is normal to any base, since the digit sequences of rational numbers are eventually periodic. Waclaw Sierpinski provided the first explicit construction of a normal number in 1917. A computable normal number was constructed by Verónica Becher and Santiago Figueira; an example of an uncomputable normal number is given by Chaitin's constant Ω.
It is extremely hard to prove the normality of numbers which were not explicitly constructed for the purpose. It is for instance unknown whether √2, &pi, ln(2) or e are normal (but all of them are strongly conjectured to be normal, because of some empirical evidence). Proofs are out of reach: we don't even know which digits occur infinitely often in the decimal expansions of those constants. David H. Bailey and Richard E. Crandall conjectured in 2001 that every irrational algebraic number is normal; while no counterexamples are known, not a single irrational algebraic number has ever been proven normal in any base.
References