On the Binary Additive Divisor Problem

: Balkanova OG, Frolenkov DA

: 2017

Proceedings of the Steklov Institute of Mathematics

: PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS

: P STEKLOV I MATH+

: 299

: 1

: 44

: 49

: 6

: 0081-5438

: 1531-8605

DOI: https://doi.org/10.1134/S0081543817080028

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.