In [41]:

    

def prime(n):
    isPrime = [True]*(n+1)
    isPrime[0:2] = [False]*2
    for p in range(2, int(sqrt(n))+1):
        if isPrime[p]:
            k = p*p;
            while k <= n:
                isPrime[k] = False;
                k = k + p;
    return [p for p in range(2,n+1) if isPrime[p] == True];


    

In [6]:

    

from math import sqrt,floor
[x for x in vec if x >= 0]


    

    
Out[6]:





3

In [45]:

    

ans = prime(100)


    

In [46]:

    

ans


    

    
Out[46]:





[2,
 3,
 5,
 7,
 11,
 13,
 17,
 19,
 23,
 29,
 31,
 37,
 41,
 43,
 47,
 53,
 59,
 61,
 67,
 71,
 73,
 79,
 83,
 89,
 97]

In [47]:

    

chk = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]


    

In [53]:

    

all([i==j for i,j in zip(ans,chk)])


    

    
Out[53]:





True

In [27]:

    

x


    

    
Out[27]:





[True, 4]

In [35]:

    

k = 1
while k <= 11:
    print k
    k = k + 2


    

    




1
3
5
7
9
11

In [ ]: