01 · The idea
In everyday language
The prime number theorem describes the average frequency of primes, but it does not ensure that several primes occur close together infinitely often. Maynard devised sieve weights that detect multiple primes among a collection of shifted integers. Instead of proving that every chosen entry is prime, he arranged the calculation so that the average weighted number of prime entries must be large. This proves that, for any fixed number of primes, some interval length contains that many primes infinitely often. The interval bound may be enormous, but it is finite and independent of how far along the number line one searches.
Why it matters
Maynard’s method changed the study of prime clusters and bounded gaps. His wider work also advances questions about prime digits and Diophantine approximation, showing how analytic estimates can detect structure in very sparse arithmetic sets.
