An analytic method for bounding (x)

DOI10.1090/MCOM/3264zbMATH Open1450.11095arXiv1511.02032OpenAlexW2964018490MaRDI QIDQ4637585FDOQ4637585

Authors: Jan Büthe 

Publication date: 24 April 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: In this paper we present an analytic altorithm which calculates almost sharp bounds for the normalized error term $(t-psi(t))/sqrtt$ for $tleqx$ in expected run time $O(x^{1/2+varepsilon})$ for every $varepsilon>0$. The method has been implemented and used to calculate the bound $|psi(t)-t|leq0.94sqrtt$ for $11<tleq10^{19}$. In particular, this bound implies that $operatornameli(t)-pi(t)>0$ for $tin[2,10^{19}]$, which gives an improved lower bound for the Skewes number.

Full work available at URL: https://arxiv.org/abs/1511.02032

Recommendations

• A new bound for the smallest $x$ with $\pi(x) > \mathrm{li}(x)$
• The impact of \(\zeta(s)\) complex zeros on \(\pi(x)\) for \(x<10^{10^{13}}\)
• A NEW BOUND FOR THE SMALLEST x WITH π(x) > li(x)
• On the Sign of the Difference π(x) - li(x)
• scientific article; zbMATH DE number 4095540

zbMATH Keywords

Chebyshev functionprime counting functionanalytic algorithmSkewes number

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Distribution of primes (11N05)

Cites Work

• Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
• The large sieve
• Approximate formulas for some functions of prime numbers
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• An amortized-complexity method to compute the Riemann zeta function
• New bounds for $\psi (x)$
• Bounds for the Tails of Sharp-Cutoff Filter Kernels
• A practical analytic method for calculating $\pi (x)$
• Explicit Bounds for Some Functions of Prime Numbers
• On the first sign change of \(\theta(x) -x\)
• Estimating \(\pi (x)\) and related functions under partial RH assumptions
• The impact of \(\zeta(s)\) complex zeros on \(\pi(x)\) for \(x<10^{10^{13}}\)

Cited In (27)

• Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
• The impact of \(\zeta(s)\) complex zeros on \(\pi(x)\) for \(x<10^{10^{13}}\)
• Sharper bounds for the error term in the prime number theorem
• New bounds for numbers of primes in element orders of finite groups
• New estimates for some functions defined over primes
• On Ramanujan's prime counting inequality
• Some explicit estimates for the error term in the prime number theorem
• The reciprocal sum of the amicable numbers
• Sharper bounds for the Chebyshev function 𝜃(𝑥)
• The Riemann hypothesis is true up to 3·1012
• An explicit version of Chen's theorem assuming the generalized Riemann hypothesis
• An inequality related to the sieve of Eratosthenes
• The error term in the prime number theorem
• Primes in prime number races
• Proof of the Sheldon Conjecture
• Title not available (Why is that?)
• An explicit upper bound for \(L(1,\chi)\) when \(\chi\) is quadratic
• Explicit estimates for the distribution of numbers free of large prime factors
• Sharper bounds for the Chebyshev function \(\psi(x)\)
• Estimates for $\pi(x)$ for large values of $x$ and Ramanujan's prime counting inequality
• The constant factor in the asymptotic for practical numbers
• Highly composite numbers and the Riemann hypothesis
• The twin prime conjecture and other curiosities regarding prime numbers
• On the average value of
• New estimates for some integrals of functions defined over primes
• On the Primorial Counting Function
• The sum of divisors function and the Riemann hypothesis

This page was built for publication: An analytic method for bounding \(\psi (x)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637585)