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
Қосымша файлдар
