A generalised divisor problem
This memoir is concerned with a generalisation of the classical divisor problems in which one considers NEWLINE\[NEWLINE\Delta_k(x)=\sum_{{n_1,\dots,n_k} \atop {n_1\dots n_k\leq x}} a_{n_1} \dots a_{n_k}-xQ_k(\log x),NEWLINE\]NEWLINE where \(\{a_n\}\) denotes a sequence of complex numbers and \(Q_k(y)\) is an arbitrary polynomial with complex coefficients. We obtain the remarkable conclusion that it is possible to imitate closely the classical case, and under rather general conditions concerning the mean values of the \(a_n\) we show that \(\Delta_k(x)\) cannot be of smaller order than \(x^{\frac{k-1}{2k}}\) as \(x\to\infty\). This improves upon classical results of \textit{H.-E. Richert} [J. Reine Angew. Math. 206, 31-38 (1961; Zbl 0106.03304)] and is essentially best possible.
- Estimates in the general divisor problem
- Generalized divisor problem
- scientific article; zbMATH DE number 5972265 (Why is no real title available?)
- scientific article; zbMATH DE number 1820111 (Why is no real title available?)
- scientific article; zbMATH DE number 5729584 (Why is no real title available?)
- scientific article; zbMATH DE number 94859 (Why is no real title available?)
- scientific article; zbMATH DE number 1045963 (Why is no real title available?)
- On a generalized divisor problem II
- scientific article; zbMATH DE number 2005655 (Why is no real title available?)
- On the generalised Dirichlet divisor problem
This page was built for publication: A generalised divisor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2755160)