Skip to content

PrimePi

The prime-counting function: how many primes are ≤ n.

PrimePi(n)count of primes .

Domain: Number theory

Details
  • Inverse of NthPrime: .
  • Asymptotically , the prime number theorem.
  • n need not be an integer or prime itself -- PrimePi(n) counts primes up to whatever real value is given.
  • compute-engine does not.

Examples

See also: NthPrime, NextPrime