Originally Posted by

**Old Pedant**
DrDos: Ummm...no.

(a) The first million *PRIMES* will not be found in the first million numbers. Not even close. I think you mean "all prime numbers that are less than one million".

(b) If that's a comment on my Sieve of Erastothenes implementation, I still don't see it. With the Sieve, any non-marked number is prime. So if I don't continue the INNER loop all the way to MAXNUM, I won't be marking all non-primes. And if I don't continue the outer loop all the way to MAXNUM, I won't *find* all the non-marked numbers so won't find all the primes.