We show that for Beurling generalized numbers the prime number theorem in remainder form (Formula presented.) is equivalent to (for some a > 0) (Formula presented.) 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.
CITATION STYLE
Debruyne, G., & Vindas, J. (2017). On general prime number theorems with remainder. In Operator Theory: Advances and Applications (Vol. 260, pp. 79–94). Springer International Publishing. https://doi.org/10.1007/978-3-319-51911-1_6
Mendeley helps you to discover research relevant for your work.