In [19]:
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
print(num)
In [98]:
prime_numbers = 0
for num in range(1,100):
prime = True
for i in range(2,num):
if (num%i==0):
prime = False
if prime:
prime_numbers = prime_numbers+1
if (prime_numbers%2==0):
print(num)
else:
pass
In [ ]: