User:Mikewarbz/sandbox2

From Wikipedia, the free encyclopedia

Formulas for prime-counting functions[edit]

Formulas for prime-counting functions come in two kinds: arithmetic formulas and analytic formulas. Analytic formulas for prime-counting were the first used to prove the prime number theorem. They stem from the work of Riemann and von Mangoldt, and are generally known as explicit formulas.[1]

We have the following expression for ψ:

where

Here ρ 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. The sum over the roots is conditionally convergent, and should be taken in order of increasing absolute value of the imaginary part. Note that the same sum over the trivial roots gives the last subtrahend in the formula.

For we have a more complicated formula

Riemann's explicit formula using the first 200 non-trivial zeros of the zeta function

Again, the formula is valid for x > 1, while ρ are the nontrivial zeros of the zeta function ordered according to their absolute value, and, again, the latter integral, taken with minus sign, is just the same sum, but over the trivial zeros. The first term li(x) is the usual logarithmic integral function; the expression li(xρ) in the second term should be considered as Ei(ρ ln x), where Ei is the analytic continuation of the exponential integral function from negative reals to the complex plane with branch cut along the positive reals.

Thus, Möbius inversion formula gives us[2]

valid for x > 1, where

is the so-called Riemann's R-function[3] and μ(n) is the Möbius function. The latter series for it is known as Gram series[4] and converges for all positive x.

Δ-function (red line) on log scale

The sum over non-trivial zeta zeros in the formula for describes the fluctuations of while the remaining terms give the "smooth" part of prime-counting function,[5] so one can use

as the best estimator of for x > 1.

The amplitude of the "noisy" part is heuristically about so the fluctuations of the distribution of primes may be clearly represented with the Δ-function:

An extensive table of the values of Δ(x) is available.[6]

  1. ^ Titchmarsh, E.C. (1960). The Theory of Functions, 2nd ed. Oxford University Press.
  2. ^ Riesel, Hans; Göhl, Gunnar (1970). "Some calculations related to Riemann's prime number formula". Mathematics of Computation. 24 (112). American Mathematical Society: 969–983. doi:10.2307/2004630. ISSN 0025-5718. JSTOR 2004630. MR 0277489.
  3. ^ Weisstein, Eric W. "Riemann Prime Counting Function". MathWorld.
  4. ^ Weisstein, Eric W. "Gram Series". MathWorld.
  5. ^ "The encoding of the prime distribution by the zeta zeros". Matthew Watkins. Retrieved 2008-09-14.
  6. ^ Cite error: The named reference Kulsha was invoked but never defined (see the help page).