scientific article; zbMATH DE number 1150143

MaRDI QIDQ4388337zbMATH OpenFDO

Authors Zaizhao Meng

Publication date 13 July 1998

zbMATH Keywords

consecutive integersdivisor functionlower bound estimate

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37)

Review text

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)].

Recommendations

• The function \(d_k (n)\) at consecutive integers
• Divisibility of the κ-fold iterated divisor function of n into n
• The divisor function at consecutive integers

Cited in

(4)

• The function \(d_k (n)\) at consecutive integers
• Divisibility of the κ-fold iterated divisor function of n into n
• scientific article; zbMATH DE number 3297277 (Why is no real title available?)
• On problem of S. Ramanujan. II.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388337)