![](http://image.absoluteastronomy.com/images//topicimages/noimage.gif)
Rosser's theorem
Encyclopedia
In number theory
, Rosser's theorem was proved by J. Barkley Rosser in 1938. Its statement follows.
Let pn be the nth prime number
. Then for n ≥ 1
![](http://image.absoluteastronomy.com/images/formulas/2/6/2262908-1.gif)
This result was subsequently improved upon to be:
(Havil 2003)
Number theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers as well...
, Rosser's theorem was proved by J. Barkley Rosser in 1938. Its statement follows.
Let pn be the nth prime number
Prime number
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example 5 is prime, as only 1 and 5 divide it, whereas 6 is composite, since it has the divisors 2...
. Then for n ≥ 1
![](http://image.absoluteastronomy.com/images/formulas/2/6/2262908-1.gif)
This result was subsequently improved upon to be:
![](http://image.absoluteastronomy.com/images/formulas/2/6/2262908-2.gif)
External links
- Rosser's theorem article on Wolfram Mathworld.