| Description |
Abstract: A famous result of Hardy and Ramanujan states that almost every large integer $N$ has approximately $\log \log N$ prime factors. This result was subsequently refined by Erdos and Kac, who proved that the distribution of the number of prime factors of an integer, when suitably normalised, may be modelled by the Gaussian random variable. In this talk, I will discuss some motivations of the Erdos-Kac theorem and outline its proof. |