Timeline for Asymptotic behavior of a certain sum of ratios of consecutives primes
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2020 at 11:03 | history | became hot network question | |||
| Feb 4, 2020 at 7:35 | vote | accept | Augusto Santi | ||
| Feb 4, 2020 at 7:33 | answer | added | GH from MO | timeline score: 10 | |
| Feb 4, 2020 at 0:24 | comment | added | Craig Franze | You can probably use $p_n \sim n\log n$. Just blindly putting that in leads to a ratio of $$\frac{(2k+1)\log k+(k+1)\log\left(1+\frac{1}{k}\right)}{\log k +(k+1)\log\left(1+\frac{1}{k}\right)},$$ which explains the $2k+1$ behavior. | |
| Feb 3, 2020 at 22:35 | review | First posts | |||
| Feb 4, 2020 at 1:12 | |||||
| Feb 3, 2020 at 22:34 | history | asked | Augusto Santi | CC BY-SA 4.0 |