PrimePi
The prime-counting function: how many primes are ≤ n.
Wikipedia
Prime-counting functionMathWorldPrimeCountingFunctionWikidataQ251922DLMF27.1227.2.E2FungrimPrimePiFungrim entry04427b4fa169OEISA000720Wolfram LanguagePrimePi✓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.