Exercise
How many times does the algorithm described as Eratosthenes' sieve have to perform Step 2 when the input n tends to infinity?
n times
n times
n/log(n) times
No, note that every number m in Step 2 is a prime number
No, note that every number m in Step 2 is a prime number
Yes, every number m in Step 2 is a prime number