On general prime number theorems with remainder

From MaRDI portal
Publication:4607775

DOI10.1007/978-3-319-51911-1_6zbMATH Open1402.11118arXiv1601.05324OpenAlexW3100825640MaRDI QIDQ4607775FDOQ4607775


Authors: Gregory Debruyne, J. Vindas Edit this on Wikidata


Publication date: 14 March 2018

Published in: Generalized Functions and Fourier Analysis (Search for Journal in Brave)

Abstract: We show that for Beurling generalized numbers the prime number theorem in remainder form pi(x) = operatorname*{Li}(x) + Oleft(frac{x}{log^{n}x} ight) quad mbox{for all } ninmathbb{N} is equivalent to (for some a>0) N(x) = ax + Oleft(frac{x}{log^{n}x} ight) quad mbox{for all } n in mathbb{N}, where N and pi are the counting functions of the generalized integers and primes, respectively. This was already considered by Nyman (Acta Math. 81 (1949), 299-307), but his article on the subject contains some mistakes. We also obtain an average version of this prime number theorem with remainders in the Ces`aro sense.


Full work available at URL: https://arxiv.org/abs/1601.05324




Recommendations




Cites Work


Cited In (6)





This page was built for publication: On general prime number theorems with remainder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607775)