James Maynard
University of Oxford
- Research field
- Analytic number theory, sieve methods, the distribution of primes
James Maynard proved in November 2013 that infinitely many pairs of primes differ by at most 600, a few months after Yitang Zhang's first finite bound of 70 million, by replacing the single Selberg weight of the Goldston-Pintz-Yıldırım method with a weight that depends on each member of a prime tuple separately. The same idea showed that for every m there are infinitely many intervals of bounded length containing m primes, which no earlier method could reach, and it needed only the Bombieri-Vinogradov theorem. The Polymath8b project optimized his weights further and reached the bound 246 in 2014, still with the Bombieri-Vinogradov theorem alone. He received the Fields Medal in 2022. The unit presents his paper as the method behind bounded gaps and as the first research paper a reader should open.
In the masterclass
Section 5, after the Maynard-Tao theorem and the chain of bounds from 70 million to 246, presents the weights in several variables that made the bound 600 and the result on m primes possible.
The research is presented in Unit 16: Gaps Between Primes, in a research spotlight box that explains the result at the level of the unit and links it to what you have just learned.