In number theory, Rosser's theorem states that the th prime number is greater than , where is the natural logarithm function. It was published by J. Barkley Rosser in 1939.[1]

Its full statement is:

Let be the th prime number. Then for

In 1999, Pierre Dusart proved a tighter lower bound:[2]

See also

edit

References

edit
  1. ^ Rosser, J. B. "The  -th Prime is Greater than  ". Proceedings of the London Mathematical Society 45:21-44, 1939. doi:10.1112/plms/s2-45.1.21 
  2. ^ Dusart, Pierre (1999). "The  th prime is greater than   for  ". Mathematics of Computation. 68 (225): 411–415. doi:10.1090/S0025-5718-99-01037-6. MR 1620223.
edit