Chebyshev function

from Wikipedia, the free encyclopedia

The Chebyshev function , also known as Chebyshev function or similar, is one of two number-theoretic functions named after the Russian mathematician Pafnuti Lwowitsch Chebyshev . They gain in importance due to their connection with the prime number counting function and the prime number theorem, and thus the Riemann zeta function .

The first Chebyshev function , usually labeled or , is the sum of the logarithms of the prime numbers up to :

The second Chebyshev function is the summed function of the Mangoldt function :

where the Mangoldt function is defined as

Basic properties

The former Chebyshev function can also be represented as

where denotes the prime faculty .

The second can also be written as the logarithm of the least common multiple from 1 to :

According to Erhard Schmidt, there are positive real values ​​for every so that

and

infinitely often.

Asymptotics

It applies

d. H.

The same applies

Pierre Dusart found a number of barriers to the two functions:

Relationship between the two functions

It applies

where whole and then through and uniquely is determined.

A more direct connection is created by

Note that for

The "exact formula"

In 1895 Hans Karl Friedrich von Mangoldt proved the following formula, which is also called "explicit formula" in English :

Here and is not prime or a prime power and the sum runs over all nontrivial zeros of the Riemann zeta function .

credentials

  1. ^ Pierre Dusart: Sharper bounds for ψ, θ, π, p k . In: Rapport de recherche n ° 1998-06, Université de Limoges. PDF
  2. Eric W. Weisstein : Explicit Formula . In: MathWorld (English).

Web links