Created
August 27, 2012 18:59
-
-
Save md-mq/3491346 to your computer and use it in GitHub Desktop.
finding prime numbers less than x
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def primes_less(x): | |
| non_prime = set() | |
| i = 2 | |
| while i*i <= x: | |
| if i not in non_prime: | |
| j = i | |
| while j*i <= x: | |
| non_prime.add(j*i) | |
| j += 1 | |
| i += 1 | |
| return set(range(2, x+1)) - non_prime |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment