No label defined (Q4388337)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1150143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1150143 |
Statements
13 July 1998
0 references
divisor function
0 references
consecutive integers
0 references
lower bound estimate
0 references
0.9466071128845216
0 references
0.8298738598823547
0 references
0.8094821572303772
0 references
For \(k\geq 2,\) let \(d_k(n)\) denote the \(k\)-fold iterated divisor function and \[ A_k(x)=\#\{n\leq x: d_k(n)=d_k(n+1)\}. \] \textit{D. R. Heath-Brown} [Mathematika 31, 141-149 (1984; Zbl 0529.10040)] showed that for sufficiently large \(x,\) \[ A_2(x)\gg x(\log x)^{-7}. \] \textit{A. Hildebrand} [Pac. J. Math. 129, 307-319 (1987; Zbl 0591.10035)] improved the estimate to \(\gg x(\log \log x)^{-3}.\) In the present paper, the author gives the following estimate (without proof): for sufficient large \(x,\) \[ A_k(x)\gg x(\log \log x)^{-3}, \] where the constant \(\gg \) does not depend on \(k.\) The reviewer would like to point out that the detailed proof has appeared in a paper with the same title [Chin. Ann. Math., Ser. B 20, 473-478 (1999; Zbl 1016.11039)].
0 references