Chebyshev upper estimates for Beurling's generalized prime numbers
From MaRDI portal
(Redirected from Publication:351269)
Abstract: Let be the counting function of a Beurling generalized number system and let be the counting function of its primes. We show that the -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 , suffice for a Chebyshev upper estimate frac{pi(x)log x}{x}leq B<infty.
Recommendations
- Chebyshev Type Estimates for Beurling Generalized Prime Numbers. II
- The prime number theorem for Beurling's generalized numbers. New cases
- Optimality of Chebyshev bounds for Beurling generalized numbers
- \(M(x) = o(x)\) estimates for Beurling numbers
- Chebyshev estimates for Beurling generalized prime numbers. I.
Cited in
(14)- Oscillation of the Remainder Term in the Prime Number Theorem of Beurling, “Caused by a Given ζ-Zero”
- Chebyshev Type Estimates for Beurling Generalized Prime Numbers
- Beurling numbers whose number of prime factors lies in a specified residue class
- Chebyshev Type Estimates for Beurling Generalized Prime Numbers. II
- A proof of a conjecture of Bateman and Diamond on Beurling generalized primes
- Density estimates for the zeros of the Beurling ζ function in the critical strip
- scientific article; zbMATH DE number 1742568 (Why is no real title available?)
- Chebyshev estimates for Beurling generalized prime numbers. I.
- A PNT equivalence for Beurling numbers
- Beurling Generalized Prime Number Systems in Which the Chebyshev Inequalities Fail
- Chebyshev bounds for Beurling numbers
- Optimality of Chebyshev bounds for Beurling generalized numbers
- Extensions of Beurling's prime number theorem
- A Chebyshev type upper estimate for prime elements in additive arithmetic semigroups
This page was built for publication: Chebyshev upper estimates for Beurling's generalized prime numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351269)