No label defined (Q4252228)
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 1305350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1305350 |
Statements
4 June 2000
0 references
large values of \(d_k(n)\)
0 references
Riemann zeta-function
0 references
\(k\)-highly composite numbers
0 references
multiplicative function
0 references
0.8179964423179626
0 references
0.7973525524139404
0 references
0.7961413264274597
0 references
The authors investigate large values of the multiplicative function \(d_k(n)\), generated by \(\zeta^k(s)\), which for \(k\geq 1\) an integer denotes the number of ways \(n\) can be written as a product of \(k\) given factors. They prove various bounds for \(d_k(n)\), one of which is \[ \log d_k(n) \leq (k-1)\log\zeta(s) + s\log n, \] which is valid for \(s > 1, k\geq 1\) real and \(n\) a natural number. For the function \[ \lambda(k) := \max_{n\geq 3}{\log d_k(n)\log\log n\over\log k \log n} \] they prove a lower bound valid for \(k \geq 2000\). Moreover, they extensively discuss \(k\)-highly composite numbers, which in the classical case \(k=2\) were introduced by S. Ramanujan. These are numbers \(N\) for which there exists \(\varepsilon > 0\) such that, for every \(n\geq 1\), one has \[ {d_k(n)\over n^\varepsilon} \leq {d_k(N)\over N^\varepsilon}. \] Various interesting results concerning these numbers are obtained. For the entire collection see [Zbl 0911.00018].
0 references