We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I built the stack and defined a sieve function. This one is not as efficient as Sieve of Erasthones, but it avoids the issue where the Sieve of Erasthones gives primes up to a certain number (number known) and what the problem is asking (the N number of primes, actual number unknown)
Waiter
You are viewing a single comment's thread. Return to all comments →
Python
I built the stack and defined a sieve function. This one is not as efficient as Sieve of Erasthones, but it avoids the issue where the Sieve of Erasthones gives primes up to a certain number (number known) and what the problem is asking (the N number of primes, actual number unknown)