Small gaps between primes or almost primes

From MaRDI portal



Abstract: Let pn denote the nth prime. Goldston, Pintz, and Yildirim recently proved that liminfnoinftyfrac(pn+1−pn)logpn=0. We give an alternative proof of this result. We also prove some corresponding results for numbers with two prime factors. Let qn denote the nth number that is a product of exactly two distinct primes. We prove that liminfnoinfty(qn+1−qn)le26. If an appropriate generalization of the Elliott-Halberstam Conjecture is true, then the above bound can be improved to 6.











This page was built for publication: Small gaps between primes or almost primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182538)