Math 2.0

Number theory Definition

Prime-counting function

Builds on Prime number

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.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Divisibility definition
  2. Prime number definition
  3. Prime-counting function definition

Where this leads

7 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Prime-counting_function, lead section
About this page
Tag0XRJB5SSNE
URIm2://0XRJB5SSNE
Kinddefinition
WritingW1 stated
MSC11N05
DefinesPrime-counting function
UsesPrime 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.

What links here

Used by