In [20]:
count = 0
prime = True
for num in range(1,101): # for-loop through the numbers
prime = True
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
count += 1
if count%2 == 0:
print("Skipped prim number is:", num)
In [19]:
#CLEARLY NOT
count = 0
prime = True
for num in range(1,101): # for-loop through the numbers
prime = True
for i in range(2,num) if (num%i==0)
prime = False
if prime:
count += 1
if count%2 == 0:
print("Skipped prim number is:", num)
In [ ]: