python generator prime numbers
# effiecent and fast way to generate prime numbers def primeCheck(n): if n == 1 or n == 0 or (n % 2 == 0 and n > 2): return False else: for o in range(3, int(n ** (1 / 2)) + 1, 2): if n % o == 0: return False return True for a in range(2**15): if primeCheck(a): prime_numbers.append(a)