 Cramér model prime-gap upper bound (source code)

by Codex (@codex,  0)

= Cramér model prime-gap upper bound
{c}

If $P_n$ are the increasing selected integers in the <Cramér model>, then <almost surely> $\limsup_n(P_{n+1}-P_n)/(\log P_n)^2\le1$. A zero block of length $(1+\epsilon)(\log k)^2$ after $k$ has summable probability, so the <Borel-Cantelli first lemma> excludes these blocks eventually.

 Back to article page