In which we see an outline of a proof of the Prime Number Theorem.
- Definition of the von Mangoldt function.
- Lemma 51: If , then . The left-hand side is the logarithmic derivative of . We obtained the right-hand side by taking the logarithm of the Euler product for and differentiating.
- Definition of a Dirichlet series.
Understanding today’s lecture
What other interesting Dirichlet series can you come up with? What are the Dirichlet series corresponding to the arithmetic functions we’ve met so far? Can you find any connections between them?
The suggestions I made for the last lecture are just as valid for this lecture. There’s some nice material on the distribution of the primes in Topics in the Theory of Numbers, by Erdős and Surányi. There’s some discussion of an elementary proof of the Prime Number Theorem in An Introduction to the Theory of Numbers by Hardy and Wright (at least in the later editions — there was no known elementary proof when the first edition was written!). Terry Tao has a nice blog post discussing a number of aspects of the distribution of prime numbers.
I mentioned the work being done on connections between zeros of the function and random matrix theory. Jon Keating, who has done a lot of work in the area, has a survey paper about this.
Preparation for Lecture 17
We’re going to move on to another formula for , the number of primes less than . How would you compute the number of primes less than , or less than (without a computer, and without just listing all the primes!). Can you generalise your ideas to find an expression for (an exact expression, not an asymptotic formula)?