English

Chebyshev Upper Estimates for Beurling's Generalized Prime Numbers

Number Theory 2013-05-02 v1

Abstract

Let NN be the counting function of a Beurling generalized number system and let π\pi be the counting function of its primes. We show that the L1L^{1}-condition 1N(x)axxdxx< \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty and the asymptotic behavior N(x)=ax+O(xlogx),N(x)=ax+O(\frac{x}{\log x}), for some a>0a>0, suffice for a Chebyshev upper estimate π(x)logxxB<. \frac{\pi(x)\log x}{x}\leq B<\infty.

Keywords

Cite

@article{arxiv.1205.4281,
  title  = {Chebyshev Upper Estimates for Beurling's Generalized Prime Numbers},
  author = {Jasson Vindas},
  journal= {arXiv preprint arXiv:1205.4281},
  year   = {2013}
}

Comments

5 pages

R2 v1 2026-06-21T21:06:31.600Z