Prime-counting function
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 .
Explanations
L1 human
The function answers the question: how many primes are there up to ? The answer grows without bound, by Euclid's theorem, but the primes become rarer as grows.
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Divisibility definition
- Prime number definition
- Prime-counting function definition
What depends on this
1 node uses this node, directly or through other nodes.
- Prime number theorem 0EHBY5Y84N
Sources
What links here
Used by
- Prime number theorem 0EHBY5Y84N