A new elementary proof of the Prime Number Theorem

From MaRDI portal



Abstract: Let Omega(n) denote the number of prime factors of n. We show that for any bounded fcolonmathbbNomathbbC 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 oinfty}(1). ] This yields a new elementary proof of the Prime Number Theorem.



Cites work


Cited in
(23)








This page was built for publication: A new elementary proof of the Prime Number Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021652)