Events

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:

A.~Booker and C.~Pomerance (2017) have shown that any residue class modulo a prime $p\ge 11$ can be represented by a positive $p$-smooth square-free integer $s = p^{O(\log p)}$ with all prime factors up to $p$ and conjectured that in fact one can find such $s$ with $s = p^{O(1)}$. Using bounds on double Kloosterman sums due to M.~Z.~Garaev (2010) we prove this conjecture in a stronger form $s \le p^{3/2 + o(1)}$. Furthermore, using some additional arguments we show that for almost all primes $p$ one can replace $3/2$ with $4/3$.