Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Sieve of Eratosthenes
from math import sqrt def primes_below(n): # creating Sieve. sieve = [True] * (n + 1) # 0 and 1 are not considered prime. sieve[0] = False sieve[1] = False for i in range(2, int(sqrt(n)) + 1): if sieve[i] == False: continue for pointer in range(i ** 2, n + 1, i): sieve[pointer] = False # Sieve is left with prime numbers == True primes = [] for i in range(n + 1): if sieve[i] == True: primes.append(i) return primes print([prime for prime in primes_below(2000000)])
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Lesson 9
inverse matrix gauss jordan
List comprehension to search and add
montecarlo
abstractmethod 2
chickens,cows,pigs
rectangle perimiter
self "keyword"
LinkedList implementation
BMO1 Q1 1994
Please log in to post a comment.