No label defined (Q5582367)
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 3300639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3300639 |
Statements
1969
0 references
iterated divisor function
0 references
0.88525474
0 references
0.8801387
0 references
0.87143177
0 references
0 references
0 references
0.85646474
0 references
0.85318077
0 references
0.8531601
0 references
0.85267335
0 references
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. \]
0 references