On the Ingham divisor problem (Q5941999): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über die Darstellungen einer Zahl als Differenz von zwei Produkten. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Fourth Power Moment of the Riemann Zeta Function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3490092 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Problems similar to the additive divisor problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sums of multiplicative functions with shifted arguments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5638376 / rank | |||
Normal rank |
Latest revision as of 19:30, 3 June 2024
scientific article; zbMATH DE number 1637726
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Ingham divisor problem |
scientific article; zbMATH DE number 1637726 |
Statements
On the Ingham divisor problem (English)
0 references
21 February 2002
0 references
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.
0 references
additive divisor problem
0 references
multiplicative function
0 references
Kloosterman sum
0 references