Upcoming Talks

The prime number theorem asserts that the $n$-th largest prime has approximate size $n \log n$.
We shall give the proof of Iwaniec in his recent AMS book on the Riemann zeta function.
These lectures are at the level of beginning graduate students.

The prime number theorem asserts that the $n$-th largest prime has approximate size $n \log n$.
We shall give the proof of Iwaniec in his recent AMS book on the Riemann zeta function.
These lectures are at the level of beginning graduate students.

Joint with Lola Thompson.

Consider either of two related problems: determining the precise
number $\pi(x)$ of prime numbers $p\leq x$, and computing the Mertens
function $M(x) = \sum_{n\leq x} \mu(n)$, where $\mu$ is the Möbius function.

The two best algorithms known are the following: