Rosser's theorem

In number theory, Rosser's theorem states that the

th prime number is greater than

is the natural logarithm function.

It was published by J. Barkley Rosser in 1939.

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