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.

Prime Counting Function - dCode

Tag(s) : Arithmetics

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!

A suggestion ? a feedback ? a bug ? an idea ? *Write to dCode*!

The counting prime numbers function, called $ \pi(n) $, aims to count the prime numbers less than or equal to a number $ 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 $ as there are 25 prime numbers less than 100.

The value of pi(n) approaches $ n / \ln(n) $ when $ n $ tends to infinity (ie. $ n / \ln(n) $ is a good approximation of $ pi(n) $ when $ n $ is very large)

$$ \pi(n)\ \underset{ n \to \infty }{ \sim } \frac{n}{\ln(n)} $$

This formula is also called the prime number theorem.

The calculation of pi(n) allows 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 $.

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 \underset{ n \to \infty }{ \sim } n \ln (n) $$

dCode retains ownership of the "Prime Counting Function" source code. Except explicit open source licence (indicated Creative Commons / free), the "Prime Counting Function" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Prime Counting Function" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Prime Counting Function" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!

Reminder : dCode is free to use.

The copy-paste of the page "Prime Counting Function" or any of its results, is allowed (even for commercial purposes) as long as you cite dCode!

Exporting results as a .csv or .txt file is free by clicking on the *export* icon

Cite as source (bibliography):

*Prime Counting Function* on dCode.fr [online website], retrieved on 2023-09-27,

count,counting,prime,number,pi,function,rank,less,than

https://www.dcode.fr/prime-number-pi-count

© 2023 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaching / CTF.

Feedback