Prime-counting Function

In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by (this does not refer to the number π).

Read more about Prime-counting Function:  History, Table of π(x), x / Ln x, and Li(x), Algorithms For Evaluating π(x), Other Prime-counting Functions, Formulas For Prime-counting Functions, Inequalities, The Riemann Hypothesis

Famous quotes containing the word function:

    Of all the inhabitants of the inferno, none but Lucifer knows that hell is hell, and the secret function of purgatory is to make of heaven an effective reality.
    Arnold Bennett (1867–1931)