Timeline for Estimating $\sum_{n\leq x: n \in A} d(n)^a$ from below for large sets $A\subset \{1,2,\ldots,x\}.$
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 20, 2021 at 21:30 | comment | added | kodlu | I'd appreciate it if you have a look at the related question mathoverflow.net/questions/408961/… | |
| Sep 18, 2019 at 19:47 | history | edited | Dr. Pi | CC BY-SA 4.0 |
added 41 characters in body
|
| Sep 18, 2019 at 1:39 | comment | added | kodlu | I meant, it can probably only be optimized to $x(\log x)^{\ln 2}.$ | |
| Sep 17, 2019 at 23:45 | comment | added | kodlu | The other answer would seem to imply that perhaps such an optimization of the lower bound via Ho"lder may not be possible. | |
| Sep 17, 2019 at 16:51 | history | answered | Dr. Pi | CC BY-SA 4.0 |