Timeline for What is the simplest proof that the density of primes goes to zero?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2022 at 19:53 | history | edited | Terry Tao | CC BY-SA 4.0 |
Fixed typo
|
| Jan 18, 2021 at 14:59 | vote | accept | Kim | ||
| Jan 17, 2021 at 18:46 | comment | added | Mark Lewko | @GH from MO: this is, of course, open even for the primes, 50 years later. | |
| Jan 17, 2021 at 18:39 | comment | added | GH from MO | Erdős and Selfridge investigated how many pairwise coprime integers can be given in an interval of length $k$. They say that "by Selberg's sieve we easily obtain that" the number is less than $(2+o(1))k/\log k$. They add that "it appears likely that" $2+o(1)$ can be improved to $1+o(1)$. See page 5 in users.renyi.hu/~p_erdos/1971-03.pdf | |
| Jan 17, 2021 at 18:27 | history | edited | Terry Tao | CC BY-SA 4.0 |
deleted 178 characters in body
|
| Jan 17, 2021 at 18:15 | history | edited | Terry Tao | CC BY-SA 4.0 |
added 564 characters in body
|
| Jan 17, 2021 at 17:58 | history | edited | Terry Tao | CC BY-SA 4.0 |
added 8 characters in body
|
| Jan 17, 2021 at 17:53 | history | edited | Terry Tao | CC BY-SA 4.0 |
added 21 characters in body
|
| Jan 17, 2021 at 17:51 | history | edited | Andreas Blass | CC BY-SA 4.0 |
fixed a typo
|
| Jan 17, 2021 at 17:43 | history | edited | Terry Tao | CC BY-SA 4.0 |
added 503 characters in body
|
| Jan 17, 2021 at 17:34 | history | answered | Terry Tao | CC BY-SA 4.0 |