Asymptotics of the prime numbers
An undergraduate thesis on the prime number theorem. We first establish Chebyshev's elementary bounds, then prove the equivalence by Newman's method, which borrows only the simplest tools from complex analysis. Along the way: Mertens' theorems, the non-vanishing of zeta on the line Re(s) = 1, and a Tauberian theorem.