Lethbridge Number Theory and Combinatorics Seminar: Nathan Ng

In this talk, I will focus on the Goldston-Pintz-Yildirim (GPY) method for detecting small gaps between primes.  In particular, I will discuss the choice of weight function in their optimization argument and the role of primes in arithmetic progressions.

Finally, we will consider the Motohashi-Pintz/Zhang variant of the GPY argument which yields bounded gaps between primes.