Jump to content

Rosser's theorem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by OAbot (talk | contribs) at 04:29, 18 April 2020 (Open access bot: doi added to citation with #oabot.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

References

  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.