betaFeedback

WorksMathematics

Frangible prime gaps

Abstract

A prime gap (pn,pn+1)(p_n, p_{n+1}) is frangible if the smallest prime divisor of every integer mm with pn<m<pn+1p_n<m<p_{n+1} is strictly less than the size of the gap, pn+1−pnp_{n+1}-p_n. Gafni and Tao recently proved that the number of frangible gaps up to XX is ≪X/log⁡2X\ll X/\log^2 X, answering a question of Erdős. They also showed that under the Dickson–Hardy–Littlewood prime tuples conjecture this number is ∼cX/log⁡2X\sim c X/\log^2 X for a constant cc, for which they obtained a rough estimate. We describe improved methods for estimating this constant under the same hypothesis, and establish that its value lies in [2.7416,2.7984][2.7416, 2.7984], confirming a speculation of Gafni and Tao. In addition, we present the results of a complete survey of frangible gaps up to 101710^{17}. An ensuing empirical measurement of cc matches our estimate very well.

Paper details

vlnc:W_mwfvjeys
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…