Timeline for Erdos-Kac for sum of divisors
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 30, 2010 at 13:17 | comment | added | Kevin O'Bryant | The number 2 is historically important, but plays no essential role in the proof of the upper and lower bounds. That is, for any particular $x$, the same method (and a nontrivial amount of computation) gives upper and lower bounds that agree out to a digit or two. | |
| Jul 30, 2010 at 3:51 | comment | added | Steven | Oh I see. So for $x=2$, there are already upper and lower bounds. I will Will Jagy's references and see what I can do for $x \neq 2$. Thanks for the links. | |
| Jul 29, 2010 at 13:02 | history | answered | Kevin O'Bryant | CC BY-SA 2.5 |