Prime-counting function
Builds on Prime number
Definition
For a real number , the prime-counting function is the number of prime numbers with .
Remarks
For example, , because the primes up to are . Also . The function is a step function. It increases by at each prime. The prime number theorem says that grows like . The symbol here has no relation to the number .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Prime number definition
- Prime-counting function definition
Where this leads
7 pages build on this one.
Further reading
About this page
| Tag | 0XRJB5SSNE |
|---|---|
| URI | m2://0XRJB5SSNE |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11N05 |
| Defines | Prime-counting function |
| Uses | Prime number |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.