from util import can_be_div_by search_range = 10001 primes = [] index = 2 last_len = 0 while True: for x in range(1, index+1): if x != 1 and x != index: if can_be_div_by(index, x): break elif x == index: primes.append(index) index += 1 length = len(primes) if last_len < length: print("New prime! {} - Total count = {}".format(primes[length-1], length)) last_len = length if length == search_range: break
from util import can_be_div_by ans = 0 for x in range(1, 1000): print(x) if can_be_div_by(x, 3): ans += x print(x) elif can_be_div_by(x, 5): ans += x print(x) print(int(ans))
from util import can_be_div_by def all_true(arr): num = 0 for y in arr: if y: num += 1 return num == len(arr) index = 0 while True: booar = [] for x in range(1, 21): booar.append(can_be_div_by(index, x)) num = 0 for y in booar: if y: num += 1 if num >= 19: print(index, "Count {}".format(num), booar) if all_true(booar) and index > 0: print(index) break index += 20