RUS
ENG
Full version
JOURNALS
// Trudy Matematicheskogo Instituta imeni V.A. Steklova
// Archive
Trudy Mat. Inst. Steklova,
2017
Volume 299,
Pages
50–55
(Mi tm3833)
This article is cited in
2
papers
On the binary additive divisor problem
Olga G. Balkanova
a
,
Dmitry A. Frolenkov
b
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.
UDC:
511.3+
517.588
MSC:
11N37
Received:
November 28, 2016
DOI:
10.1134/S0371968517040021
Fulltext:
PDF file (153 kB)
References
Cited by
English version:
Proceedings of the Steklov Institute of Mathematics, 2017,
299
,
44–49
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025