Nepedia
Back to Discover
Advanced Reader
🔢

Normal number

math Maturity 11-13 Next article →

{

"text": "In mathematics, a normal number is a real number whose digits appear to be distributed randomly. This concept describes how numbers behave when written in a specific base, such as our standard base ten. A number is simply normal in a base if every individual digit occurs with the same frequency. For example, in a simply normal base ten number, each digit from zero to nine would appear exactly 1/10 of the time.

However, true normality is more complex than just counting single digits. A number is considered normal in a base if every possible string of digits of any length occurs with equal frequency. This means no specific pattern is favored over another.

If a number is normal in every possible integer base from two upwards, it is called an absolutely normal number.

\n\nTo understand the mechanism of normality, imagine an infinite sequence of coin flips. In a binary system, a zero represents tails and a one represents heads. In a normal binary sequence, the pattern \"01\" must appear just as often as \"10\".

If we look at strings of length three, patterns like \"000\" or \"111\" must appear with the same frequency as \"101\". The probability of finding any specific string of length $n$ is exactly $b^{-n}$, where $b$ is the base. This ensures the number behaves as if it were produced by a random process. No finite combination of digits is more likely to appear than any other combination of the same length.

\n\nMathematicians categorize numbers into several distinct stages of complexity. A number can be simply normal, which only requires individual digits to be balanced. It can also be a rich number, meaning its expansion is disjunctive. A disjunctive sequence is one where every possible finite string eventually appears.

While every normal number is disjunctive, a disjunctive sequence is not necessarily normal. This is because a disjunctive sequence might contain all strings but fail to distribute them with equal frequency. Finally, there are absolutely non-normal numbers, which are numbers that are not simply normal in any base.

\n\nThe history of this concept began with Émile Borel. He introduced the idea of normal numbers and used the Borel–Cantelli lemma to prove their existence. Borel established that almost all real numbers are normal. This means that the set of non-normal numbers has a Lebesgue measure of zero.

Although most numbers are normal, proving a specific number is normal is very difficult. Later, mathematicians like Champernowne and Copeland–Erdős found ways to construct specific examples. Champernowne created a constant by concatenating all natural numbers in order.

This constant is proven to be normal in base ten. Similarly, the Copeland–Erdős constant, formed by stringing together prime numbers, is also normal in base ten.\n\nThe significance of normal numbers lies in the gap between theory and proof. While we know almost all numbers are normal, we can only prove it for a few specific, artificially constructed cases. For example, Chaitin's constant is known to be normal, but it is uncomputable.

Many famous mathematical constants are widely believed to be normal. These include the numbers $\pi$, $e$, and $\ln(2)$. However, a formal proof for their normality remains elusive. We have not even proven that every digit appears infinitely many times in the decimal expansion of $\pi$.

It is conjectured that all irrational algebraic numbers are absolutely normal, but this has never been proven.\n\nThere are many surprising facts regarding what makes a number non-normal. Rational numbers are never normal in any base. This is because their digits eventually enter a repeating period. Since the pattern repeats, most possible long strings will never appear.

There are also uncountably many numbers that are not normal. For instance, there are uncountably many numbers in base three or higher that never use the digit one. These numbers are non-normal because they fail the requirement of uniform distribution. Even though these non-normal numbers are \"large\" in count, they take up no space in the real number line.

\n\nNormal numbers also connect to the study of computer science and information theory. There is a link between normal sequences and finite-state machines. Agafonov showed that if you select a subsequence from a normal sequence using a regular language, the result is still normal.

This connects to the idea of finite-state gamblers. These are machines that attempt to bet on the next digit in a sequence. In a truly normal sequence, a finite-state gambler cannot gain an advantage because the digits are perfectly unpredictable. This ties the abstract concept of number theory to the practical limits of computation and randomness.",

"media": [

"File:Digits_0-9.jpg",

"File:Binary_patterns.jpg",

"File:Number_bases.jpg",

"File:Coin_flip.jpg",

"File:Random_sequence.jpg",

"File:Number_line.jpg",

"File:Emile_Borel.jpg",

"File:Pi_constant.jpg",

"File:Repeating_fractions.jpg"

]

}

810 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

More to explore

🔬 Go deeper

More advanced topics to explore

🪜 Step back

Simpler topics to build understanding

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.