Talk:Prime Number Theorem: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Catherine Woodgold
(Capital letters)
imported>Subpagination Bot
m (Add {{subpages}} and remove checklist (details))
Line 1: Line 1:
{{checklist
{{subpages}}
|                abc = Prime Number Theorem
|                cat1 = Mathematics
|                cat2 =
|                cat3 =
|          cat_check = n
|              status = 2
|        underlinked = n
|            cleanup = y
|                  by = [[User:Greg Martin|Greg Martin]] 22:12, 29 April 2007 (CDT)
}}
 


== new page - improve! ==
== new page - improve! ==

Revision as of 11:01, 13 November 2007

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition The number of primes up to some limit X is asymptotic to X divided by the logarithm of X. [d] [e]
Checklist and Archives
 Workgroup category Mathematics [Categories OK]
 Talk Archive none  English language variant British English

new page - improve!

I started this article from material taken from Prime number. Some of what's currently in this article should probably go instead in an article about the Riemann zeta function. Hard to know how detailed to get on this page - it's serious mathematics. - Greg Martin 22:14, 29 April 2007 (CDT)

Capital letters

Perhaps the page name should be "Prime number theorem" rather than "Prime Number Theorem". --Catherine Woodgold 21:07, 30 April 2007 (CDT)