Timeline for Lower bound on a function of the number of divisors?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2023 at 12:45 | vote | accept | mathoverflowUser | ||
| Mar 10, 2023 at 8:56 | answer | added | Dabed | timeline score: 3 | |
| Mar 10, 2023 at 6:22 | comment | added | Gerry Myerson | OK. What bounds were those? Have you gotten anywhere, applying those bounds? | |
| Mar 10, 2023 at 3:38 | comment | added | mathoverflowUser | @GerryMyerson Not many. Only those written at Wikipedia. | |
| Mar 10, 2023 at 3:37 | comment | added | mathoverflowUser | @AnuragSahay I am trying to estimate some time complexity. | |
| Mar 10, 2023 at 3:08 | history | edited | mathoverflowUser | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 10, 2023 at 0:59 | comment | added | Gerry Myerson | Clearly, User, you're going to need some estimates for $\tau(n)$ to answer your question. So, what bounds do you know about for $\tau(n)$? | |
| Mar 9, 2023 at 22:58 | comment | added | Anurag Sahay | On second thought, the answer might change depending on where the typo is that @cs89 noticed. | |
| Mar 9, 2023 at 22:16 | comment | added | Anurag Sahay | How did this come up? The divisor function grows more slowly than $n^\epsilon$ for any $\epsilon > 0$, so the denominator is basically $n\log n$, and $l(n) \sim n^{-1}$. | |
| Mar 9, 2023 at 21:00 | comment | added | cs89 | It looks like there is a typo in the denominator which seems to be missing a closing parenthesis somewhere. | |
| Mar 9, 2023 at 20:36 | history | asked | mathoverflowUser | CC BY-SA 4.0 |