Erdős–Kac theorem

The Erdős–Kac theorem is an important idea in number theory, named after mathematicians Paul Erdős and Mark Kac. It helps us understand how numbers behave when we look at their prime factors. Prime factors are the smallest numbers that multiply together to make a bigger number. For example, the prime factors of 12 are 2, 2, and 3, because 2 × 2 × 3 = 12.

This theorem tells us that if we take a number and count how many different prime factors it has, the way these counts change follows a pattern called the normal distribution. This is similar to how some things in nature, like the heights of people or the sizes of flowers, tend to cluster around an average value.

The Erdős–Kac theorem builds on earlier work called the Hardy–Ramanujan theorem. Together, these ideas show that even though numbers might seem random, they follow surprising and predictable patterns when we look at them in certain ways. This helps mathematicians learn more about the hidden order in numbers.

Precise statement

This part of the article shows us how many different prime numbers are needed to build really big numbers. For example, a number with 4 digits usually needs about 2 different primes, while a number with 25 digits needs about 4 different primes.

Very large numbers—like those with hundreds or thousands of digits—usually need just a few different primes to build them. But to see the pattern clearly, we would need to look at numbers so big that writing them down would take more space than all the sand in the universe!