Skip to main content

Mathematics (thesaurus)

Search from vocabulary

Concept information

Preferred term

Chebyshev function  

Definition

  • In mathematics, the Chebyshev function is either a scalarising function (Tchebycheff function) or one of two related functions. The first Chebyshev function ϑ  (x) or θ (x) is given by
    where denotes the natural logarithm, with the sum extending over all prime numbers p that are less than or equal to x. The second Chebyshev function ψ (x) is defined similarly, with the sum extending over all prime powers not exceeding x
    where Λ is the von Mangoldt function. The Chebyshev functions, especially the second one ψ (x), are often used in proofs related to prime numbers, because it is typically simpler to work with them than with the prime-counting function, π (x) (see the exact formula below.) Both Chebyshev functions are asymptotic to x, a statement equivalent to the prime number theorem.
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Chebyshev_function)

Broader concept

In other languages

URI

http://data.loterre.fr/ark:/67375/PSR-DT18GRDQ-T

Download this concept:

RDF/XML TURTLE JSON-LD Last modified 10/18/24