Timeline for A decreasing sequence involving the divisor function?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2016 at 21:28 | comment | added | GH from MO | @WillJagy: Thanks for all these papers (Nicolas's etc.), I was not aware of them. In fact I can now quickly answer the other question (mathoverflow.net/questions/231925/…). | |
| Feb 24, 2016 at 20:58 | comment | added | Will Jagy | GH, I had not noticed this question. It appears that person(s?) are switching various versions of RH. In particular, see the enjoyable paper by Planat et al about the Nicolas criterion, arxiv.org/abs/1012.3613 which shows that a related sequence, if increasing forever, proves RH but disproves Cramer's conjecture. | |
| Feb 24, 2016 at 20:49 | comment | added | GH from MO | @user1952009: $\theta(x)=\sum_{p\leq x}\log p$ is the first Chebyshev function. See at en.wikipedia.org/wiki/Chebyshev_function | |
| Feb 24, 2016 at 20:47 | comment | added | reuns | @ GH : what is $\theta(p_k)$ ? | |
| Feb 11, 2016 at 21:37 | comment | added | GH from MO | @favoured: Yes, because the fraction tends to $6/\pi^2$ times the right hand side. | |
| Feb 11, 2016 at 21:19 | vote | accept | favoured | ||
| Feb 11, 2016 at 21:19 | comment | added | favoured | @G.H, thank you very much for both your comment and answer, which left me curious: is it then true that $\frac{\sigma(N_{k}}{N_{k}\log\log N_k }< e^{\gamma}$, for sufficiently large $N_k$ ? | |
| Feb 11, 2016 at 21:06 | history | edited | GH from MO | CC BY-SA 3.0 |
added 196 characters in body
|
| Feb 11, 2016 at 20:54 | history | answered | GH from MO | CC BY-SA 3.0 |