A note on the binary additive divisor problem
Number Theory
2016-12-06 v1
Abstract
In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi.
Keywords
Cite
@article{arxiv.1612.01143,
title = {A note on the binary additive divisor problem},
author = {Olga Balkanova and Dmitry Frolenkov},
journal= {arXiv preprint arXiv:1612.01143},
year = {2016}
}