In [21]:

    

prime_numbers = []

for num in range(1,101): # for-loop through the numbers
    if (num != 1):
        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)
            
every_other_prime = prime_numbers[0::2]

for item in every_other_prime: 
    print(item)


    

    




2
5
11
17
23
31
41
47
59
67
73
83
97

In [ ]: