Timeline for Asymptotic for the average of $|d(n)-\log n|$?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2022 at 18:20 | answer | added | GH from MO | timeline score: 9 | |
| Feb 14, 2022 at 17:05 | answer | added | Lucia | timeline score: 12 | |
| Feb 14, 2022 at 15:37 | comment | added | Dr. Pi | Thanks! I will edit. | |
| Feb 14, 2022 at 15:36 | history | edited | Dr. Pi | CC BY-SA 4.0 |
deleted 638 characters in body; edited title
|
| Feb 14, 2022 at 13:55 | comment | added | Alexander Kalmynin | The upper bound follows immediately from the Dirichlet's divisor problem and obvious inequality $|d(n)-\ln n|\leq d(n)+\ln n$, so the order is, indeed, $x\ln x$. You did the more difficult computation with the lower bound | |
| Feb 14, 2022 at 12:57 | history | edited | Dr. Pi | CC BY-SA 4.0 |
deleted 18 characters in body
|
| Feb 14, 2022 at 11:19 | history | asked | Dr. Pi | CC BY-SA 4.0 |