Abstract
Let π(x) denote, for any real x, the number of primes not exceeding x. The prime number theorem is the assertion that
A fundamental formula discovered by Atle Selberg has made a proof of (1) possible without the use of the properties of the zeta-function of Riemann, and without the use of the theory of functions of a complex variable. We shall prove Selberg’s formula in this chapter, and indicate some of its consequences. We shall also prove an inequality due to E. Wirsing, which, when combined with a variant of Selberg’s formula, gives a proof of the prime number theorem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Chandrasekharan, K. (1970). The prime number theorem and Selberg’s method. In: Arithmetical Functions. Die Grundlehren der mathematischen Wissenschaften, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50026-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-50026-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-50028-2
Online ISBN: 978-3-642-50026-8
eBook Packages: Springer Book Archive