arXiv · 1612.01143
A note on the binary additive divisor problem
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Olga Balkanova, Dmitry Frolenkov. 2016-12-04. A note on the binary additive divisor problem. https://arxiv.org/abs/1612.01143
Cite the original work for its findings. Save a collection to share your selection of sources.