This textbook demonstrates how the tools of analysis can be used in number theory to attack a famous problem.
At first glance the prime numbers appear to be distributed in a very irregular way amongst the integers, but it is possible to produce a simple formula that tells us (in an approximate but well defined sense) how many primes we can expect to find that are less than any integer we might choose. The prime number theorem tells us what this formula is and it is indisputably one of the great classical theorems of mathematics. This textbook gives an introduction to the prime number theorem suitable for advanced undergraduates and beginning graduate students. The author's aim is to show the reader how the tools of analysis can be used in number theory to attack a 'real' problem, and it is based on his own experiences of teaching this material.
Inhaltsverzeichnis
Preface; 1. Foundations; 2. Some important Dirichlet series and arithmetic functions; 3. The basic theorems; 4. Prime numbers in residue classes: Dirichlet's theorem; 5. Error estimates and the Riemann hypothesis; 6. An 'elementary' proof of the prime number theorem; Appendices; Bibliography; Index.
