Rough Numbers in Prime Gaps: Erdős, Tao, and the Modern Breakthrough

In this Deep Dive, we explore Erdős’s puzzle about rough numbers inside prime gaps. We first define prime gaps, rough numbers, and cousin primes, using simple examples to show how a gap can or cannot contain a rough number. We then follow Erdős’s evolving intuition—that, although such gaps exist, they become rare as primes grow, so most gaps eventually contain a rough number. The episode summarizes Tao and Gaffney’s breakthrough: for primes up to x, the exceptional gaps without rough numbers are significantly sparse (roughly x/log^2 x), so almost all gaps do contain rough numbers. Under the Hardy–Littlewood (k-tuple) conjecture, they even obtain a precise asymptotic with a constant around 2.8, revealing a deeper level of structure in prime gaps. We touch on the powerful tools involved—modern sieve methods and analysis of higher moments—and discuss open questions, like whether infinitely many gaps fail to contain a rough number, and how this ties into larger conjectures about prime gaps. A concise tour of a striking modern result that shows how a seemingly simple question can drive deep mathematics—and what mysteries still remain.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC