Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Let denote the number of prime factors of . We show that for any bounded one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a new elementary proof of the Prime Number Theorem.