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:

    “For me being a poet is a job rather than an activity. I feel I have a function in society, neither more nor less meaningful than any other simple job. I feel it is part of my work to make poetry more accessible to people who have had their rights withdrawn from them.”
    —Jeni Couzyn (b. 1942)