On a generalization of the divisor additive problem
From MaRDI portal
Let \(f(n)\) be a multiplicative function of natural argument \(n\), i.e. \(f(nm)=f(n)f(m)\) for all relatively prime \(n\) and \(m\). For a class of multiplicative functions the generalized additive divisor problem is investigated, i.e. the asymptotic relation NEWLINE\[NEWLINES(f,x)=\sum_{n\leq x}f(n)\tau(n-1)=C(f)\sum_{n\leq x}f(n)\log x(1+o(1)),NEWLINE\]NEWLINE where \(\tau(n)\), is the number of divisors of \(n\), is obtained with an explicit constant \(C(f)\). See also Mat. Zametki 64, No.~3, 443-456 (1998; Zbl 0922.11076).
Recommendations
Cited in
(8)- Divisor generating functions and insertion into a heap
- Problems similar to the additive divisor problem
- Asymptotic formulae and divisor problems
- On the sign changes in a weighted divisor problem
- On generalizations of the Titchmarsh divisor problem
- scientific article; zbMATH DE number 4163012 (Why is no real title available?)
- scientific article; zbMATH DE number 4031804 (Why is no real title available?)
- scientific article; zbMATH DE number 3536206 (Why is no real title available?)
This page was built for publication: On a generalization of the divisor additive problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2742871)