On the Binary Additive Divisor Problem
- Authors: Balkanova O.G.1, Frolenkov D.A.2
-
Affiliations:
- Department of Mathematics and Statistics
- Steklov Mathematical Institute of Russian Academy of Sciences
- Issue: Vol 299, No 1 (2017)
- Pages: 44-49
- Section: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/175107
- DOI: https://doi.org/10.1134/S0081543817080028
- ID: 175107
Cite item
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.
About the authors
Olga G. Balkanova
Department of Mathematics and Statistics
Author for correspondence.
Email: olgabalkanova@gmail.com
Finland, Turku, 20014
Dmitry A. Frolenkov
Steklov Mathematical Institute of Russian Academy of Sciences
Email: olgabalkanova@gmail.com
Russian Federation, ul. Gubkina 8, Moscow, 119991
Supplementary files
