Chebyshev Upper Estimates for Beurling's Generalized Prime Numbers

preprint2012arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.