Rosser's theorem

This article is about a theorem in number theory. For Rosser's technique for proving incompleteness theorems, see Rosser's trick. For Gödel–Rosser incompleteness theorems, see Gödel's incompleteness theorems. For the Church-Rosser theorem of λ-calculus, see Church-Rosser theorem.

In number theory, Rosser's theorem was proved by J. Barkley Rosser in 1938. Its statement follows.

Let pn be the nth prime number. Then for n ≥ 1

p_n > n \cdot \ln n.

This result was subsequently improved upon to be:

 p_n > n \cdot(\ln n + \ln(\ln n) - 1). (Havil 2003)

See also

References

External links

This article is issued from Wikipedia - version of the Thursday, March 07, 2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.