|
This article is cited in 3 scientific papers (total in 3 papers)
On the binary additive divisor problem
Olga G. Balkanovaa, Dmitry A. Frolenkovb a Department of Mathematics and Statistics, University of Turku, Turku 20014, Finland
b Steklov Mathematical Institute of Russian Academy of Sciences, ul. Gubkina 8, Moscow, 119991 Russia
Abstract:
We show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. To this end, we improve an estimate in the proof of Motohashi.
Keywords:
additive divisor problem, hypergeometric function.
Received: November 28, 2016
Citation:
Olga G. Balkanova, Dmitry A. Frolenkov, “On the binary additive divisor problem”, Analytic number theory, On the occasion of the 80th anniversary of the birth of Anatolii Alekseevich Karatsuba, Trudy Mat. Inst. Steklova, 299, MAIK Nauka/Interperiodica, Moscow, 2017, 50–55; Proc. Steklov Inst. Math., 299 (2017), 44–49
Linking options:
https://www.mathnet.ru/eng/tm3833https://doi.org/10.1134/S0371968517040021 https://www.mathnet.ru/eng/tm/v299/p50
|
|