3 ms·
Not at all obvious. It is a very open question whether prime gaps are bounded by ~(log N)^2... AFAIK, even assuming the GRH, the best upper bound is roughly N^
by cperciva 9y ago
Not at all obvious. It is a very open question whether prime gaps are bounded by ~(log N)^2... AFAIK, even assuming the GRH, the best upper bound is roughly N^(1/2).