In [18]:

    

prime_numbers = []
for num in range(1,101): # for-loop through the numbers
    prime = True # boolean flag to check the number for being prime
    for i in range(2,num): # for-loop to check for "primeness" by checking for divisors other than 1
        if (num%i==0): # logical test for the number having a divisor other than 1 and itself
            prime = False # if there's a divisor, the boolean value gets flipped to False
    if prime: # if prime is still True after going through all numbers from 1 - 100, then it gets printed
        prime_numbers.append(num)
for num in prime_numbers[::2]:
    print(num)


    

    




1
3
7
13
19
29
37
43
53
61
71
79
89

In [ ]: