Chebyshev Upper Estimates for Beurling's Generalized Prime Numbers
classification
🧮 math.NT
keywords
fracinftybeurlingchebyshevcountingfunctiongeneralizedupper
read the original abstract
Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the asymptotic behavior $$N(x)=ax+O(\frac{x}{\log x}),$$ for some $a>0$, suffice for a Chebyshev upper estimate $$ \frac{\pi(x)\log x}{x}\leq B<\infty. $$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.