A randomly sieved set that mimics the primes has largest gap almost surely equal to g((2e^{-γ}+o(1)) log log x), with g defined through an extremal interval sieve problem; the same framework turns Hardy-Littlewood conjectures into lower bounds on prime gaps.
Bennett, Probability inequalities for the sum of independent random variables, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Large prime gaps and probabilistic models
A randomly sieved set that mimics the primes has largest gap almost surely equal to g((2e^{-γ}+o(1)) log log x), with g defined through an extremal interval sieve problem; the same framework turns Hardy-Littlewood conjectures into lower bounds on prime gaps.