On the Binary Additive Divisor Problem


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.