Mean square estimates for gcd-sum functions

From MaRDI portal





In 1933 \textit{S. S. Pillai} [J. Annamalai Univ. 2, 243--248 (1933; Zbl 0008.19603)] studied the arithmetic function \(P(n)\) as the sum of gcd \((m,n)\), where \(m\le n\) . Let \(A(n)= P(n)/n\). Asymptotic formulae for the sum \(\sum_{n\le x} A^{k}(n)\) have been obtained for \(k=2\) by \textit{L. Tóth} [J. Integer Seq. 13, No. 8, Article ID 10.8.1, 23 p. (2010; Zbl 1206.11118)], and for general \(k\) by \textit{D. Zhang} and \textit{W. Zhai} [J. Integer Seq. 16, No. 6, Article 13.6.5, 8 p. (2013; Zbl 1285.11122)]. For the error term of this last estimate, the authors of the paper under review obtain certain mean square estimates, by assuming the Riemann hypothesis. In the proofs, some properties of the Riemann zeta-function, Parseval's identity, and the method of Mellin transform are used.











This page was built for publication: Mean square estimates for gcd-sum functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941667)