A1 Refereed original research article in a scientific journal
On the Binary Additive Divisor Problem
Authors: Balkanova OG, Frolenkov DA
Publisher: MAIK NAUKA/INTERPERIODICA/SPRINGER
Publication year: 2017
Journal: Proceedings of the Steklov Institute of Mathematics
Journal name in source: PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS
Journal acronym: P STEKLOV I MATH+
Volume: 299
Issue: 1
First page : 44
Last page: 49
Number of pages: 6
ISSN: 0081-5438
eISSN: 1531-8605
DOI: https://doi.org/10.1134/S0081543817080028
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.
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.
UTU Research Portal