From Wikipedia, the free encyclopedia
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.
Let pn be the nth prime number. Then for n ≥ 1
This result was subsequently improved upon to be:
- (Havil 2003)
- Rosser, J. B. "The nth Prime is Greater than n ln n". Proceedings of the London Mathematical Society 45, 21-44, 1938.
- Rosser's theorem article on Wolfram Mathworld.