The prime number theorem: Analytic and elementary proofs

Three proofs of the prime number theorem are presented. The �rst is a heavily analytic proof based on early accounts. Cauchy's residue theorem and various results relating to the Riemann zeta function play a vital role. A weaker result than the prime number theorem is used for the proof, namely Chebyshev's theorem. The second proof is elementary in the sense that it involves no complex analysis. Instead, mainly number-theoretic results are used, in particular, Selberg's formulas. The third proof, like the �rst, relies heavily on the Riemann zeta function, but is considerably shorter for the use of the Laplace transform and the analytic theorem.

Level dc:type.qualificationlevel

masters

Grantor dc:publisher.institution

National University of Ireland Maynooth

Year dc:date.issued

2013

Author dc:creator

• O'Rourke, Ciaran

• Mathematics & Statistics

Language dc:language

en