Talk:Prime Number Theorem

From Citizendium
Revision as of 11:04, 12 November 2008 by imported>Paul Wormer (→‎log vs ln)
Jump to navigation Jump to search
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)

log vs ln

Shouldn't the equation be written as ln(x) or loge(x) if it is a natural log? David E. Volk 15:02, 12 November 2008 (UTC)

David, I agree, see here --Paul Wormer 16:04, 12 November 2008 (UTC)
Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Prime_Number_Theorem&oldid=213074"