A python function for finding prime numbers using the Sieve of Eratosthenes algorithm
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more about the CLI.
Please sign in to use Codespaces.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download Xcode and try again.
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
A python function for finding prime numbers using the Sieve of Eratosthenes algorithm. This version does not include even numbers in the list of possible primes, cutting memory usage by a factor of 2.
This function can successfully find all primes less than 100,000,000.
A python function for finding prime numbers using the Sieve of Eratosthenes algorithm