Timeline for For any integer $n>1$, there always exists at least one prime number $p$ with $n < p< n+\left(\ln\Big(\frac{n}{\ln n}\Big)+1\right)^2$
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2019 at 11:51 | comment | added | Dror Speiser | Don't know if this is how it was found, but the number appears in the tables of this page: en.m.wikipedia.org/wiki/Prime_gap | |
| Sep 24, 2019 at 18:51 | comment | added | Thomas Dybdahl Ahle | How did you construct this huge example? Is there some list of the largest prime gaps? | |
| Sep 24, 2019 at 12:17 | vote | accept | Đào Thanh Oai | ||
| Sep 24, 2019 at 12:17 | vote | accept | Đào Thanh Oai | ||
| Sep 24, 2019 at 12:17 | |||||
| Sep 24, 2019 at 12:15 | vote | accept | Đào Thanh Oai | ||
| Sep 24, 2019 at 12:15 | |||||
| Sep 24, 2019 at 12:11 | history | answered | LeechLattice | CC BY-SA 4.0 |