Prime Number Theorem/Definition: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
m (rm noinclude)
imported>Jitse Niesen
m (protect {{subpages}} with noinclude)
 
Line 1: Line 1:
{{Subpages}}
<noinclude>{{Subpages}}</noinclude>
The number of primes up to some limit ''X'' is asymptotic to ''X'' divided by the logarithm of ''X''.
The number of primes up to some limit ''X'' is asymptotic to ''X'' divided by the logarithm of ''X''.

Latest revision as of 09:56, 13 November 2008

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.