Prime Number Theorem/Definition: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(The number of primes up to some limit ''X'' is asymptotic to ''X'' divided by the logarithm of ''X''.)
 
imported>Richard Pinch
m (rm noinclude)
Line 1: Line 1:
<noinclude>{{Subpages}}</noinclude>
{{Subpages}}
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''.

Revision as of 01:30, 12 November 2008

This article is developing and not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=Prime_Number_Theorem/Definition&printable=yes
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.

Retrieved from "https://citizendium.org/wiki/index.php?title=Prime_Number_Theorem/Definition&oldid=554464"