dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day! You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Tool for counting prime numbers via the prime-counting function denoted pi(n) which counts the prime numbers less than or equal to a real number n.

Answers to Questions

How to calculate pi(n)?

For small numbers, the easiest method to count all the first primes less than \( n \) is to use the Eratosthenes sieve to quickly list prime numbers.

Example: \( \pi(100) = 25 \) so there are 25 prime numbers less than 100.

How to calculate an approximation of pi(n)?

The value of pi(n) approaches \( n / \ln(n) \) when \( n \) is very big:

$$ \lim_{ n \to + \infty } \pi(n) = \frac{ n }{ \ln(n) } $$

This formula is also called the prime number theorem.

What is pi(n) for?

The calculation of pi(n) allow to locate a prime number with respect to another, knowing its rank in the list of prime numbers.

If pi(a) < pi(b) then a < b.

How to get an estimation of the nth prime number?

A consequence of the prime number theorem is that the nth prime number \( p_n \) is close to \( n \ln(n) \) (and closer when \( n \) is very large) $$ p_n \sim n \ln (n) $$

Ask a new question

Source code

dCode retains ownership of the source code of the script Prime Counting Function online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be given for free. So if you need to download the online Prime Counting Function script for offline use, check contact page !