About: Chebyshev function     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In mathematics, the Chebyshev function is either 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 Both functions are named in honour of Pafnuty Chebyshev.

AttributesValues
rdfs:label
  • Chebyshev function (en)
rdfs:comment
  • In mathematics, the Chebyshev function is either 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 Both functions are named in honour of Pafnuty Chebyshev. (en)
sameAs
dbp:wikiPageUsesTemplate
Subject
Link from a Wikipage to an external page
thumbnail
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Chebyshev-big.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Chebyshev-smooth.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/Chebyshev.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/ChebyshevPsi.png
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • In mathematics, the Chebyshev function is either 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 , below.) Both Chebyshev functions are asymptotic to x, a statement equivalent to the prime number theorem. Both functions are named in honour of Pafnuty Chebyshev. (en)
foaf:isPrimaryTopicOf
is Wikipage redirect of
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git151 as of Feb 20 2025


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software