Talk:Prime Number Theorem

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
This article is developing and not approved.
Main Article
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
To learn how to fill out this checklist, please see CZ:The Article Checklist. To update this checklist 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]

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)

Euler's proof of the infinitude of primes

I would prefer to see this stated something like the following:

Euler used his formula to give an alternative proof that there are infinitely many primes. Let S be a finite set of primes and (S) the integers divisible only by primes in S. Taking , we get

since the product on the right-hand side is a finite product of absolutely convergent geometric series and so may be rearranged to form the sum on the left. But that sum is therefore convergent and so cannot equal the harmonic series, which diverges. Hence (S) cannot be the set of all integers, and this shows that there are infinitely many primes.


Was there a reason not to use Li(x) rather than x/log(x)? Richard Pinch 21:00, 9 December 2008 (UTC)