Rosser's theorem

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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

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

This result was subsequently improved upon to be[1]:

See also[edit]


  1. ^ Dusart, Pierre (1999). "The kth prime is greater than k(log k + log log k−1) for k ≥ 2". Mathematics of Computation. 68 (225): 411–415. doi:10.1090/S0025-5718-99-01037-6. MR 1620223. 

External links[edit]