AoPSWiki
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!

Prime counting function

From AoPSWiki

Revision as of 18:55, 29 March 2009 by Boy Soprano II (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

The prime counting function, denoted \pi, is a function defined on real numbers. The quantity \pi(x) is defined as the number of positive prime numbers less than or equal to x.

The function \pi(x) is asymptotically equivalent to x/\log x. This is the prime number theorem. It is also asymptotically equivalent to Chebyshev's theta function.

See also

This article is a stub. Help us out by expanding it.

Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us