scientific article; zbMATH DE number 3300639

From MaRDI portal
Publication:5582367





Let \(d_k(n)\) denote the \(k\)-fold iterated \(d(n)\), where \(d(n)\) the number of divisors of \(n\). Let \(l_k\) be the \(k\)-th element of the Fibonacci sequence (\(l_{-1}=0, l_0=1, l_k=l_{k-1}+l_{k-2}, k\geq 2\)). We prove \(d_k(n) <\exp (\log n)^{1/l_k+\varepsilon}\) for all fixed \(k\), all positive \(\varepsilon\) and all sufficiently large values of \(n\); further for every \(\varepsilon >0\) \(d_k(n) >\exp (\log n)^{1/l_{k-\varepsilon}}\) for an infinity of values of \(n\). For \(n>1\) let \(k(n)\) denote the smallest \(k\) for which \(d_k(n)=2\). We prove \[ 0<\limsup (k(n)/\log\log\log n)<\infty. \]











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 Q5582367)