Erdős's frangible-prime-gap question
Let be consecutive primes, let , and let denote the least prime divisor of an integer . Call the gap frangible if for every integer satisfying . If denotes the number of frangible gaps with , determine the frequency of such gaps; in particular, prove that . Gafni and Tao proved the stronger unconditional bound , and, assuming the Dickson--Hardy--Littlewood prime-tuples conjecture, obtained an asymptotic for a constant .
References
- Frangible prime gaps — arXiv — Michael J. Mossinghoff, Timothy S. Trudgian
Source: arXiv
Progress summary
The counting question has a claimed solution, and newer work mainly sharpens its predicted numerical constant rather than changing the conclusion.
Erdős’s problem asks how frequently consecutive-prime gaps contain no integer whose least prime factor is at least the gap length. Tao and Gafni’s work identifies this as Erdős’s problem number and gives both an unconditional density-zero result and a conditional asymptotic.
October 2026 quantitative refinement
Mossinghoff and Trudgian extend the analysis to gaps containing fewer than any fixed number of such integers, proving unconditionally and obtaining conditional asymptotics. For the original case, enumeration gives the rigorous bound ; supplementary computation suggests , and the survey reaches .
Current status (as of October 2026): The original counting question is claimed solved by an unconditional upper bound and a conditional asymptotic, while the sharper constant remains conditional and the preprints are unrefereed.
Solutions 0
No solutions have been posted yet.