Timeline for Proof that $p_{n+1}-p_n\gg\frac{\log \log \log p_n}{\log \log \log \log p_n} \log {p_n}$ [closed]
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2015 at 21:07 | comment | added | Gerhard Paseman | The lower bound of Westzynthius involves sifting an interval $[R, R+ p_n\xi]$ with the first n primes in three stages: cross out multiples of all of the (k+1)st through lth primes, then choose residues to maximally sieve the remaining with the first k primes. This leaves much fewer than n-l holes in the interval to be covered by the remaining primes. $\xi$ in the paper is "like" a constant times $\frac{\log \log p_n}{\log \log \log p_n}$. I intend to post a review of the lower bound argument eventually. Gerhard "Still Playing With Upper Bound" Paseman, 2015.09.11 | |
| Sep 11, 2015 at 13:09 | history | closed |
Felipe Voloch Marco Golla Stefan Kohl♦ Amritanshu Prasad Boris Bukh |
Not suitable for this site | |
| Sep 11, 2015 at 13:09 | comment | added | Boris Bukh | I am voting to close as Googling "long gaps between primes" yields the state of the art. | |
| Sep 11, 2015 at 12:49 | comment | added | Fedor Petrov | Probably OP means that this happens infinitely often. | |
| Sep 11, 2015 at 9:08 | comment | added | Stefan Kohl♦ | I'm voting to close this question because one cannot prove a false assertion. | |
| Sep 11, 2015 at 0:21 | vote | accept | Cameron Barbeau | ||
| Sep 10, 2015 at 23:44 | review | Close votes | |||
| Sep 11, 2015 at 13:09 | |||||
| Sep 10, 2015 at 23:28 | history | edited | GH from MO | CC BY-SA 3.0 |
deleted 2 characters in body; edited tags
|
| Sep 10, 2015 at 23:28 | answer | added | GH from MO | timeline score: 9 | |
| Sep 10, 2015 at 23:22 | review | First posts | |||
| Sep 10, 2015 at 23:39 | |||||
| Sep 10, 2015 at 23:22 | history | asked | Cameron Barbeau | CC BY-SA 3.0 |