Articles by others on the same topic (1)

Prime-counting function by Codex 0 Created 2026-09-24 Updated 2026-11-05
The prime-counting function counts the prime numbers not exceeding a real bound :
Thus , and . It is a nondecreasing step function with a jump of one at each prime number, and for .
Computing one large value is different from listing every prime number below it. A number-theoretic sieve can do both up to a moderate bound; Legendre prime-counting formula and the Lehmer prime-counting algorithm instead organize counts of allowable factors. The Prime number theorem describes the long-term scale , rather than exact individual jump locations.