Timeline for Asymptotics for a peculiar kind of squarefree numbers
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2017 at 10:21 | vote | accept | Sylvain JULIEN | ||
| May 24, 2017 at 23:57 | history | edited | Dr. Pi | CC BY-SA 3.0 |
added 5 characters in body
|
| May 24, 2017 at 22:41 | comment | added | Dr. Pi | Yes indeed, sorry, i will try to fix that. | |
| May 24, 2017 at 18:33 | comment | added | Lucia | This seems wrong. It is $\log \log P_i(n)$ that is close to $i$ often. Indeed even the $i$-th prime itself is around $i\log i$. In fact, the number of integers satisfying the relation in the question is $o(x)$. | |
| May 24, 2017 at 18:26 | history | answered | Dr. Pi | CC BY-SA 3.0 |