Lethbridge Number Theory and Combinatorics Seminar: Nathan Ng

  • Date: 09/30/2013
  • Time: 12:00

Nathan Ng, University of Lethbridge


University of Lethbridge


Zhang's theorem on bounded gaps between primes, part II


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.

Other Information: 

Location: University Hall B660


Web page: http://www.cs.uleth.ca/~nathanng/ntcoseminar/