A note on the binary additive divisor problem
classification
🧮 math.NT
keywords
additivebinarydivisormotohashinoteproblembounderror
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.