Timeline for On the number of consecutive divisors of an integer
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2015 at 1:42 | comment | added | Dr. Pi | The reviews indicate that there is work by Tenenbaum and dL Breteche for bounding $\tau_k$ by a power of $\tau$ which is smaller than $1$. The asymptotic estimate is also rather straightforward. But it gives the interesting result that the average number of more than one consecutive divisors is $\int_0^1 \frac{e^x-1}{x}dx$.I am wondering whether it is any easy to prove asymptotics for the higher moments of $\tau_2$. | |
| May 25, 2015 at 0:09 | history | answered | Gerry Myerson | CC BY-SA 3.0 |