Positive lower density of large prime gaps
For every fixed real , there are constants and such that, for every integer , .
The deduction from Proposition 2.1 and Lemma 2.2 is complete, elementary, and rigorous, with all parameter dependencies properly ordered.
“Theorem 1.1. For every fixed real C > 0, there are constants c(C) > 0 and N0(C) such that, for every integer N ≥ N0(C), #{1 ≤ n ≤ N : pn+1 − pn > C log pn} ≥ c(C)N.” · Show in paper