Timeline for $\frac{\sigma(n)}{n} < e \ln \ln (n)$ is true?
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2020 at 0:02 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
Link to paper, formatting
|
| Nov 14, 2020 at 17:47 | comment | added | Wojowu | Please do not vandalize your own questions. | |
| Nov 14, 2020 at 17:46 | history | rollback | Wojowu |
Rollback to Revision 4
|
|
| Nov 14, 2020 at 17:14 | history | edited | The Company | CC BY-SA 4.0 |
deleted 292 characters in body
|
| Oct 8, 2020 at 21:57 | history | edited | zeraoulia rafik | CC BY-SA 4.0 |
deleted 14 characters in body
|
| Oct 8, 2020 at 21:56 | comment | added | Gerry Myerson | @zeraouliarafik you have introduced the condition $n\ge5041$, which was not in the original question. | |
| Oct 8, 2020 at 21:34 | comment | added | Sylvain JULIEN | This makes me want to define the "Robin constant" $R$ as the infimum of the $C>0$ such that $\frac{\sigma(n)}{n}<e^{C}\log\log n, n\geq 5041$. | |
| Oct 8, 2020 at 19:05 | comment | added | zeraoulia rafik | @The Company , I wish that i didn't change the meaning of your question . | |
| Oct 8, 2020 at 19:04 | history | edited | zeraoulia rafik | CC BY-SA 4.0 |
added 57 characters in body
|
| Oct 8, 2020 at 6:53 | history | edited | Martin Sleziak |
edited tags
|
|
| Oct 8, 2020 at 6:32 | answer | added | Gerry Myerson | timeline score: 19 | |
| Oct 8, 2020 at 6:22 | comment | added | Gerry Myerson | Aleksander Grytczuk, Upper bound for sum of divisors function and the Riemann Hypothesis, Tsukuba J. Math. vol. 31 No. 1 (2007), 67–75, proved if $m$ is odd, $m>(1/2)3^9$, then $\sigma(2m)/(2m)<(39/40)e^{\gamma}\log\log2m$. See projecteuclid.org/download/pdf_1/euclid.tkbjm/1496165115 | |
| Oct 8, 2020 at 5:20 | review | Close votes | |||
| Oct 15, 2020 at 3:05 | |||||
| Oct 8, 2020 at 4:50 | review | First posts | |||
| Oct 8, 2020 at 5:14 | |||||
| Oct 8, 2020 at 4:47 | history | asked | The Company | CC BY-SA 4.0 |