scientific article; zbMATH DE number 1305350
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].
- Hooley's \(\Delta _ r\)-functions when r is large
- On large values of the divisor function
- On the number of unitary divisors of integers in arithmetic progressions
- scientific article; zbMATH DE number 3948393 (Why is no real title available?)
- Grandes valeurs d'une fonction liée au produit d'entiers consécutifs
- Large values of an additive function linked with generalized divisors of an integer
- The maximal size of the k-fold divisor function for very large k
- scientific article; zbMATH DE number 7552260 (Why is no real title available?)
- New upper bounds for the number of divisors function
- Superior highly composite numbers and the explicit upper bound of generalized divisor functions
- Multiplicative partitions of numbers with a large squarefree divisor
- Large values of the number of factorizations of an integer as an ordered product of primes
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 Q4252228)