On the Binary Additive Divisor Problem
- Autores: Balkanova O.G.1, Frolenkov D.A.2
-
Afiliações:
- Department of Mathematics and Statistics
- Steklov Mathematical Institute of Russian Academy of Sciences
- Edição: Volume 299, Nº 1 (2017)
- Páginas: 44-49
- Seção: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/175107
- DOI: https://doi.org/10.1134/S0081543817080028
- ID: 175107
Citar
Resumo
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.
Sobre autores
Olga Balkanova
Department of Mathematics and Statistics
Autor responsável pela correspondência
Email: olgabalkanova@gmail.com
Finlândia, Turku, 20014
Dmitry Frolenkov
Steklov Mathematical Institute of Russian Academy of Sciences
Email: olgabalkanova@gmail.com
Rússia, ul. Gubkina 8, Moscow, 119991
Arquivos suplementares
