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:

    “Ye elms that wave on Malvern Hill
    In prime of morn and May,
    Recall ye how McClellan’s men
    Here stood at bay?”
    —Herman Melville (1819–1891)

    “Hence, a generative grammar must be a system of rules that can iterate to generate an indefinitely large number of structures. This system of rules can be analyzed into the three major components of a generative grammar: the syntactic, phonological, and semantic components.”
    —Noam Chomsky (b. 1928)