Timeline for Divisor sum estimate
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16, 2017 at 4:21 | answer | added | Alexey Ustinov | timeline score: 0 | |
| Jul 15, 2017 at 15:18 | answer | added | user111966 | timeline score: 1 | |
| Jul 14, 2017 at 23:04 | history | edited | Stopple | CC BY-SA 3.0 |
expanded on Jagy's answer.
|
| Jul 14, 2017 at 22:51 | vote | accept | Stopple | ||
| Jul 14, 2017 at 22:35 | answer | added | Henri Cohen | timeline score: 4 | |
| Jul 14, 2017 at 22:11 | answer | added | Will Jagy | timeline score: 9 | |
| Jul 14, 2017 at 21:02 | comment | added | Stopple | @WillJagy This is helpful; if you make it an answer I'll accept it. | |
| Jul 14, 2017 at 20:57 | comment | added | Gerhard Paseman | Is this not a multiplicative function of n? If it is, solving it for prime powers should work. For prime powers $p^k$ I get something less than A/(A-1) where A is $p^{\sigma}$. Gerhard "Surely It Must Be Multiplicative" Paseman, 2017.07.14. | |
| Jul 14, 2017 at 20:49 | comment | added | Lucia | For example it is less than $d(n)$, which is less than $C(\epsilon)n^{\epsilon}$ for any $\epsilon >0$. | |
| Jul 14, 2017 at 20:29 | comment | added | Will Jagy | This is the topic in a Ramanujan article fragment math.univ-lyon1.fr/~nicolas/ramanujanNR.pdf The entirety of the original article was not published as there were shortages of many things, including paper. The recent movie gives a good feel for this. I should add that i wrote to Nicolas for confirmation of some asymptotics (at least under RH) and he confirmed that there was a sudden transition at one end of the $0 \leq \sigma \leq 1$ segment, cannot immediately recall. | |
| Jul 14, 2017 at 20:20 | history | asked | Stopple | CC BY-SA 3.0 |