use Math::Prime::Util qw/forprimes/;
forprimes { say } 1000; # optionally takes range a,b
####
from sympy import sieve
for i in sieve.primerange(2,1000):
print i
##
##
import gmpy2
n = 2
while n <= 1000:
print n
n = gmpy2.next_prime(n)
##
##
from math import sqrt, ceil
def rwh_primes(n):
# http://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188
""" Input n>=6, Returns a list of primes, 2 <= p < n """
correction = (n%6>1)
n = {0:n,1:n-1,2:n+4,3:n+3,4:n+2,5:n+1}[n%6]
sieve = [True] * (n/3)
sieve[0] = False
for i in xrange(int(n**0.5)/3+1):
if sieve[i]:
k=3*i+1|1
sieve[ ((k*k)/3) ::2*k]=[False]*((n/6-(k*k)/6-1)/k+1)
sieve[(k*k+4*k-2*k*(i&1))/3::2*k]=[False]*((n/6-(k*k+4*k-2*k*(i&1))/6-1)/k+1)
sieve[n/3-correction] = False
# If you want the count: return 2 + sum(sieve)
return [2,3] + [3*i+1|1 for i in xrange(1,n/3-correction) if sieve[i]]
for i in rwh_primes(1000):
print i