def premiers(n):
    prem=list(range(0,n))
    k=2
    while k*k<n :
        for j in range(2*k,n,k):
            prem[j]=0
        k += 1
        while prem[k]==0: k += 1
    return [k for k in prem if k!=0]