Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Prime-counting function
Summary
In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by pi(x) (unrelated to the number pi).
Prime number theorem
Of great interest in number theory is the growth rate of the prime-counting function. It was conjectured in the end of the 18th century by Gauss and by Legendre to be approximately
where log is the natural logarithm, in the sense that
This statement is the prime number theorem. An equivalent statement is
where li is the logarithmic integral function. The prime number theorem was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin independently, using properties of the Riemann zeta function introduced by Riemann in 1859. Proofs of the prime number theorem not using the zeta function or complex analysis were found around 1948 by Atle Selberg and by Paul Erdős (for the most part independently).
In 1899, de la Vallée Poussin proved that
for some positive constant a. Here, O(...) is the big O notation.
More precise estimates of are now known. For example, in 2002, Kevin Ford proved that
Mossinghoff and Trudgian proved an explicit upper bound for the difference between and :
for .
For values of that are not unreasonably large, is greater than . However, is known to change sign infinitely many times. For a discussion of this, see Skewes' number.
For let when is a prime number, and otherwise. Bernhard Riemann, in his work On the Number of Primes Less Than a Given Magnitude, proved that is equal to
where
μ(n) is the Möbius function, li(x) is the logarithmic integral function, ρ indexes every zero of the Riemann zeta function, and li(xρ/n) is not evaluated with a branch cut but instead considered as Ei(ρ/n log x) where Ei(x) is the exponential integral. If the trivial zeros are collected and the sum is taken only over the non-trivial zeros ρ of the Riemann zeta function, then may be approximated by
The Riemann hypothesis suggests that every such non-trivial zero lies along Re(s) = 1/2.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood