Prime Number Theorem/Definition

From Citizendium
< Prime Number Theorem
Revision as of 01:27, 12 November 2008 by imported>Richard Pinch (The number of primes up to some limit ''X'' is asymptotic to ''X'' divided by the logarithm of ''X''.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
A definition or brief description of Prime Number Theorem.

The number of primes up to some limit X is asymptotic to X divided by the logarithm of X.