On the Binary Additive Divisor Problem
- 作者: Balkanova O.G.1, Frolenkov D.A.2
-
隶属关系:
- Department of Mathematics and Statistics
- Steklov Mathematical Institute of Russian Academy of Sciences
- 期: 卷 299, 编号 1 (2017)
- 页面: 44-49
- 栏目: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/175107
- DOI: https://doi.org/10.1134/S0081543817080028
- ID: 175107
如何引用文章
详细
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.
作者简介
Olga Balkanova
Department of Mathematics and Statistics
编辑信件的主要联系方式.
Email: olgabalkanova@gmail.com
芬兰, Turku, 20014
Dmitry Frolenkov
Steklov Mathematical Institute of Russian Academy of Sciences
Email: olgabalkanova@gmail.com
俄罗斯联邦, ul. Gubkina 8, Moscow, 119991
补充文件
