On the Ingham divisor problem
Let \(d(n)\) be the divisor function, and let \(F(n)\) be a multiplicative function of the form \(F(n)=\sum_{d\mid n}f(d)\), with \(f(d)\ll d^{-\alpha}\). Then it is shown that \[ \sum_{n\leq x}F(n) d(n)d(n+1)= xQ(\log x) +O(x^{5/6+\varepsilon}) +O(x^{1-\alpha/6+\varepsilon}) \] for any \(\varepsilon >0\). Here \(Q(\dots)\) is a quadratic polynomial, and the implied constant depends on \(F\) and \(\varepsilon\). The leading term of \(Q\) is found explicitly in the case in which \(F\) is strongly multiplicative. When \(F\) is identically 1 one recovers a result of the reviewer [\textit{D. R. Heath-Brown}, Proc. Lond. Math. Soc. (3) 38, 385-422 (1979; Zbl 0403.10018)]. The proof uses an estimate for \[ \sum_{n\leq x, n \equiv 1\pmod q}d(n), \quad (q\leq x^{2/3}). \] This estimate, which depends on Weil's bound for the Kloosterman sum, is taken from the reviewer's work cited above.
- scientific article; zbMATH DE number 4163012 (Why is no real title available?)
- scientific article; zbMATH DE number 3365347 (Why is no real title available?)
- Problems similar to the additive divisor problem
- Sums of multiplicative functions with shifted arguments
- The Fourth Power Moment of the Riemann Zeta Function
- Über die Darstellungen einer Zahl als Differenz von zwei Produkten.
This page was built for publication: On the Ingham divisor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941999)