Chebyshev Upper Estimates for Beurling's Generalized Prime Numbers
Abstract
Let N be the counting function of a Beurling generalized number system and let π be the counting function of its primes. We show that the L1-condition ∫1∞|N(x)-axx|dxx<∞ and the asymptotic behavior N(x)=ax+O(x x), for some a>0, suffice for a Chebyshev upper estimate π(x) xx≤ B<∞.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.