On the Binary Additive Divisor Problem


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017