Prime Number Theorem - Approximations For The nth Prime Number

Approximations For The nth Prime Number

As a consequence of the prime number theorem, one gets an asymptotic expression for the nth prime number, denoted by pn:

A better approximation is

Rosser's theorem states that pn is larger than n ln n. This can be improved by the following pair of bounds:

Read more about this topic:  Prime Number Theorem

Famous quotes containing the words prime and/or number:

    Sometimes it takes years to really grasp what has happened to your life. What do you do after you are world-famous and nineteen or twenty and you have sat with prime ministers, kings and queens, the Pope? What do you do after that? Do you go back home and take a job? What do you do to keep your sanity? You come back to the real world.
    Wilma Rudolph (1940–1994)

    Computers are good at swift, accurate computation and at storing great masses of information. The brain, on the other hand, is not as efficient a number cruncher and its memory is often highly fallible; a basic inexactness is built into its design. The brain’s strong point is its flexibility. It is unsurpassed at making shrewd guesses and at grasping the total meaning of information presented to it.
    Jeremy Campbell (b. 1931)