Computing π(x) analytically

@article{Platt2015ComputingA,
  title={Computing $\pi$(x) analytically},
  author={Dave Platt},
  journal={Math. Comput.},
  year={2015},
  volume={84},
  pages={1521-1535}
}
  • Dave Platt
  • Published 26 March 2012
  • Computer Science, Mathematics
  • Math. Comput.
We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than 10. 

Figures and Topics from this paper

A practical analytic method for calculating 휋(x)
TLDR
A practical analytic method for the computation of pi(x), the number of prime numbers <= x, which is similar to the one proposed by Lagarias and Odlyzko but uses the Weil-Barner explicit formula instead of curve integrals. Expand
New bounds for π(x)
TLDR
The proof relies on two new arguments: smoothing the prime counting function which allows to generalize the previous approaches, and a new explicit zero density estimate for the zeros of the Riemann zeta function. Expand
A computational history of prime numbers and Riemann zeros
We give an informal survey of the historical development of computations related to prime number distribution and zeros of the Riemann zeta function.
Estimates of ψ,θ for large values of x without the Riemann hypothesis
  • P. Dusart
  • Mathematics, Computer Science
  • Math. Comput.
  • 2016
TLDR
The quintessence of the method of Rosser and Schoenfeld on the upper bounds for the usual Chebyshev prime and prime power counting functions is drawn to find an upper bound function directly linked to a zero-free region. Expand
Improvements to Turing's method II
This article improves the estimate of the size of the definite inte- gral of S(t), the argument of the Riemann zeta-function. The primary appli- cation of this improvement is Turing's Method for theExpand
Estimating π(x) and related functions under partial RH assumptions
  • Jan Büthe
  • Computer Science, Mathematics
  • Math. Comput.
  • 2016
The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by provingExpand
Will a physicist prove the Riemann Hypothesis?
  • M. Wolf
  • Physics, Medicine
  • Reports on progress in physics. Physical Society
  • 2019
TLDR
The Riemann Hypothesis is formulated and some physical problems related to this hypothesis are reviewed: the Polya--Hilbert conjecture, the links with Random Matrix Theory, relation with the Lee--Yang theorem on the zeros of the partition function and phase transitions, random walks, billiards etc. Expand
Updating the error term in the prime number theorem
An improved estimate is given for $$|\theta (x) -x|$$|θ(x)-x|, where $$\theta (x) = \sum _{p\le x} \log p$$θ(x)=∑p≤xlogp. Four applications are given: the first to arithmetic progressions that haveExpand
Prime Numbers in Short Intervals
The Riemann zeta function, ζ(s), is central to number theory and our understanding of the distribution of the prime numbers. This thesis presents some of the known results in this area beforeExpand
An improved analytic method for calculating $$\pi (x)$$π(x)
We provide an improved version of the analytic method of Franke et al. for calculating the prime-counting function $$\pi (x)$$π(x), which is more flexible and, for calculations not assuming theExpand
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
Isolating some non-trivial zeros of zeta
  • Dave Platt
  • Computer Science, Mathematics
  • Math. Comput.
  • 2017
TLDR
A rigorous algorithm to compute Riemann’s zeta function on the half line and its use to isolate the non-trivial zeros of zeta with imaginary part to an absolute precision of ±2−102 is described. Expand
Prime sieves using binary quadratic forms
TLDR
An algorithm that computes the prime numbers up to N using O(N/log log N) additions and N 1/2+o(1) bits of memory is introduced. Expand
Computing pi(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method
TLDR
It is shown that it is possible to compute π(x) in O( x 2/3 /log 2 x) time and O(x 1/3l log 3 x log log x) space. Expand
Computing n(X) the meissel-lehmer method
E. D. F. Meissel, a German astronomer, found in the 1870’s a method for computing individual values of π(x), the counting function for the number of primes ≤ x. His method was based on recurrencesExpand
Artin's Conjecture, Turing's Method, and the Riemann Hypothesis
  • A. Booker
  • Mathematics, Computer Science
  • Exp. Math.
  • 2006
TLDR
A group-theoretic criterion under which one may verify the Artin conjecture for some Galois representations, up to finite height in the complex plane is presented and a rigorous algorithm for computing general L-functions on the critical line via the fast Fourier transform is developed. Expand
Multiplicative Number Theory
From the contents: Primes in Arithmetic Progression.- Gauss' Sum.- Cyclotomy.- Primes in Arithmetic Progression: The General Modulus.- Primitive Characters.- Dirichlet's Class Number Formula.- TheExpand
Introduction to analytic number theory
This is the first volume of a two-volume textbook which evolved from a course (Mathematics 160) offered at the California Institute of Technology during the last 25 years. It provides an introductionExpand
Analytic computation of the prime-counting function
The main topic of this dissertation is the Lagarias-Odlyzko analytic algorithm for computing π(x)—the number of primes up to x. This algorithm is asymptotically the fastest known algorithm for theExpand
Computing π(x): the Meissel
  • Lehmer method, Math. Comp
  • 1985
Computing π(x): the Meissel-Lehmer
  • method, Math. Comp
  • 1985
...
1
2
3
4
...