Abstract
We shall now deduce, from the results of the last section and those of §13, that
and from this the analogous result for π(x), which includes the prime number theorem. This is by no means the easiest way of proving the prime number theorem, but it is an instructive way. It is also very close to the method used by de la Vallée Poussin, though he worked with the function
instead of the function φ(x).
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
© 1980 Ann Davenport
About this chapter
Cite this chapter
Davenport, H. (1980). The Prime Number Theorem. In: Multiplicative Number Theory. Graduate Texts in Mathematics, vol 74. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-5927-3_18
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5927-3_18
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-5929-7
Online ISBN: 978-1-4757-5927-3
eBook Packages: Springer Book Archive