Finds the nth prime and how many primes there are up to a limit you set, using the sieve of Eratosthenes. Striking out the multiples of 2, then of 3, and so on, leaves the primes untouched. It counts them faster than testing each number by division.