Explicit Bounds for Some Functions of Prime Numbers

1941/01/01 by Barkley Rosser · 19 citations
Mathematics · #History and Theory of Mathematics #Analytic Number Theory Research

paper · doi:10.2307/2371291

Cited by

• Short effective intervals containing primes
• Primes between consecutive powers
• An improved upper bound for the argument of the Riemann zeta-function on the critical line II
• Explicit estimates on several summatory functions involving the Moebius function
• On the first sign change of θ(x) - x
• A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field
• Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
• A method for verifying the generalized Riemann hypothesis
• Estimating the number of zeros of Dedekind zeta-functions
• Proof of the the Riemann hypothesis from the density and Lindelof hypotheses via a power sum method
• Sharper Bounds for the Chebyshev function θ(x)
• On the Maximal Gap between Primes
• On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
• Large gaps between values of several binary quadratic forms
• A lower bound for the number of Egyptian fractions
• Probably faster multiplication of sparse polynomials
• Explicit formulae for primes in arithmetic progressions, I
• Approximate formulas for some functions of prime numbers
• Bonse's inequality [wikipedia]