Prime Number Theorem/Definition: Difference between revisions

Revision as of 02:30, 12 November 2008

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.

Revision as of 02:27, 12 November 2008 (view source) imported>Richard Pinch (The number of primes up to some limit ''X'' is asymptotic to ''X'' divided by the logarithm of ''X''.)		Revision as of 02:30, 12 November 2008 (view source) imported>Richard Pinch m (rm noinclude) Newer edit →
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''.