Timeline for A weaker version of the Brocard's Conjecture
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2019 at 7:38 | comment | added | Greg Martin | Selberg showed that almost all intervals of the form $(x,x^{1/3+\varepsilon})$ have the expected number of primes $x^{1/3+\varepsilon}/\log x$. It follows that the interval $(p_k^2,p_{k+1}^2)$ has not just at least four primes but the expected number of primes for almost all $k$. | |
| Dec 21, 2019 at 19:32 | history | became hot network question | |||
| Dec 21, 2019 at 14:00 | vote | accept | Safwane | ||
| Dec 21, 2019 at 13:58 | answer | added | JoshuaZ | timeline score: 10 | |
| Dec 21, 2019 at 13:30 | review | Close votes | |||
| Dec 28, 2019 at 3:05 | |||||
| Dec 21, 2019 at 13:10 | comment | added | Safwane | @LeechLattice: How you can do this. | |
| Dec 21, 2019 at 11:43 | comment | added | LeechLattice | What about using the prime number theorem? | |
| Dec 21, 2019 at 11:18 | history | asked | Safwane | CC BY-SA 4.0 |