Answer Happy

= numbers set(range(num, 1, -1)) # all numbers in range (sorted backwards) primes [] start_time = time. time ( ) while numbers: p = numbers.pop() # p = the last element in the numbers list primes.append(p) # p add p to the primes list numbers.difference_update(set(range(p*2, num+1, p))) # {numbers} - {(p*2 -> num+1) incremented by p}
for n in range( lower, num + 1): if n > 1: for i in range(2, n): if (n % i) == 0: break else: count +=1 =