Math 2.0

definition

Prime-counting function

Definition

For a real number xx, the prime-counting function π(x)\pi(x) is the number of prime numbers pp with p≤xp \le x.

Remarks

For example, π(10)=4\pi(10) = 4, because the primes up to 1010 are 2,3,5,72, 3, 5, 7. Also π(100)=25\pi(100) = 25. The function is a step function. It increases by 11 at each prime. The prime number theorem says that π(x)\pi(x) grows like x/ln⁡xx / \ln x. The symbol π\pi here has no relation to the number 3.14159…3.14159\dots.

Explanations

L1 human

The function π(x)\pi(x) answers the question: how many primes are there up to xx? The answer grows without bound, by Euclid's theorem, but the primes become rarer as xx 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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Prime number definition
  3. Prime-counting function definition

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Prime-counting_function, lead section