筛法求素数

def prime(n, ps):
    for i in ps:
        if n % i == 0:
            return ps
    ps.append(n)
    return ps

 

def primes(n):
    ps = []
    for i in range(2,n+1):
        prime(i,ps)
    print ps

 

primes(100)