In number theory, Rosser's theorem states that the n {\displaystyle n} th prime number is greater than n log n {\displaystyle n\log n} , where log {\displaystyle \log } is the natural logarithm function. It was published by J. Barkley Rosser in 1939. Its full statement is: Let p n {\displaystyle p_{n}} be the n {\displaystyle n} th prime number. Then for n ≥ 1 {\displaystyle n\geq 1}
p n > n log n . {\displaystyle p_{n}>n\log n.}
In 1999, Pierre Dusart proved a tighter lower bound for n ≥ 2 {\displaystyle n\geq 2} :
p n > n ( log n + log log n − 1 ) . {\displaystyle p_{n}>n(\log n+\log \log n-1).}
See also Prime number theorem
References
External links Rosser's theorem article on Wolfram Mathworld.
