Ben Green
University of Oxford
- Research field
- Additive combinatorics and analytic number theory
Ben Green works at the border of combinatorics and number theory, on questions about the additive structure of sets of integers. With Terence Tao he proved in 2004 that the primes contain arithmetic progressions of every finite length, by transferring Szemerédi's theorem on dense sets of integers to the primes, which sit densely inside the pseudorandom set of almost-primes. The unit presents the theorem after Dirichlet's theorem, as the opposite question: not primes inside a progression, but progressions inside the primes.
In the masterclass
Section 6, after the Key Result on the difference of a progression of primes and the record progression of 27 terms, presents the theorem and the idea of its proof.
The research is presented in Unit 14: Primes in Arithmetic Progressions, in a research spotlight box that explains the result at the level of the unit and links it to what you have just learned.