arXiv · 1601.05324
On General Prime Number Theorems with Remainder
Abstract
We show that for Beurling generalized numbers the prime number theorem in remainder form $$π(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) = ax + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n \in \mathbb{N},$$ where $N$ and $π$ 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àro sense.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gregory Debruyne, Jasson Vindas. 2017-02-17. On General Prime Number Theorems with Remainder. https://doi.org/10.1007/978-3-319-51911-1_6
Cite the original work for its findings. Save a collection to share your selection of sources.