prime counting function

In mathematics, the prime counting function is the function counting the number of primes less than or equal to some real number x. It is denoted by π(x) and may be expressed formally as

\pi(x) = \sum_{p \le x,\ p\ prime} 1

Of great interest is the rate of growth of this function, conjectured since the 18th century to be approximately

x/\operatorname{ln}(x)

. What is now called the prime number theorem is one precise estimate for this rate of growth, namely that

\pi(x) / \operatorname{li}(x)

approaches 1 as

x

increases without bound, where li is the logarithmic integral function. This was first proved around 1896 by Hadamard and by de la Valle Poussin (independently), using properties of the zeta function introduced by Riemann in 1859. More precise estimates of

\pi(x)

are now known; for example

\pi(x) = \operatorname{li}(x) + O(x \exp(-\frac{\sqrt{\ln(x)}}{15}))

, and the O is Big O notation. Proofs of the Prime Number Theorem not using the zeta function or complex analysis were found around 1948 by Selberg and by Erds (for the most part independently).

Other prime counting functions

Other prime counting functions are also used because they are more convenient to work with. One is Riemann's prime counting function, denoted

\Pi(x)

J(x)

. This has jumps of 1/n for prime powers pⁿ, with it taking a value half-way between the two sides at discontinuities. That added detail is because then it may be defined by an inverse Mellin transform. Formally, we may define J by

J(x) = \frac12 (\sum_{p^n < x} \frac1n\ + \sum_{p^n \le x} \frac1n)

where p is a prime. We may also write

J(x) = \sum_{n=1}^\infty \pi(x^\frac{1}{n})

except where we have discontinuities at prime powers, and hence π can be recovered from J by Mbius inversion. Another prime counting function weights prime powers pⁿ by ln p:

\psi(x) = \frac12 (\sum_{p^n < x} \ln p\ + \sum_{p^n \le x} \ln p)

Formulas for prime counting functions

These come in two kinds, arithmetic formulas and analytic formulas. The latter are what allow us to prove the prime number theorem. From the work of Riemann and von Mangoldt, we have the following expression for J:

J(x) = \operatorname{Li}(x) - \sum_{\rho}\operatorname{Li}(x^{\rho}) - \ln 2 + \int_x^\infty \frac{dt}{t(t^2-1) \ln t}

Here Li is the offset logarithmic integral, and ρ are the zeros of the Riemann zeta function in the critical strip, where the real part of ρ is between zero and one. The formula is valid for values of x greater than one, which is the region of interest, and the sum over the roots is conditionally convergent, and should be taken in order of increasing absolute value of the imaginary part. For ψ we have a simpler formula, due to von Mangoldt:

\psi(x) = x - \sum_\rho \frac{x^\rho}{\rho} + \ln \frac{x^2}{x^2-1} - \ln {2 \pi}

Again, the formula is valid for x>1.

The Riemann hypothesis

The Riemann hypothesis is equivalent to a much sharper bound on the error in the estimate for

\pi(x)

, and hence to a more regular distribution of prime numbers,

\pi(x) = \operatorname{li}(x) + O(\sqrt{x} \log{x}).

<< Previous

Word Browser

Next >>

amblyrhynchus
brachylophus
transitional fossil
conolophus
ctenosaura
cyclura
keith henson
knorkator
schnews
equal rites
national indoor football league

libre society
drywall
gordon cooper
black woodpecker
libre manifesto
bleaching agent
kon tiki
howard cosell
sholom aleichem
selby
university of essex

adipocere
mahavir jayanti
lactate dehydrogenase
wrasse
john bowker
john hope, 1st marquess of linlithgow
history of new york
trick (movie)
ferdinand foch
particle horizon
attacks on humanitarian workers

peterson's algorithm
zhongnanhai
upper providence township, pennsylvania
united front
archerfish
list of national basketball association players
the haunted
qualitative psychological research
morcar, earl of northumbria
common name
bakewell