π(n)≈nln(n). where π(n) is the number of primes less than n and ln(n) is the natural logarithm of n. (Googling 'Prime Number Theorem' will tell you more! ... <看更多>

Easiest way would be to have a variable that increments every time you find a prime number. So when you are printing the number, ... ... <看更多>

How can we estimate the number of primes up to x?Watch the next lesson: ... ... <看更多>