def miller_rabbin_solution():
sum = 0
for i in range(1,2000000):
if miller_rabbin(i):
sum = sum + i
return sum
def GetNextPrime(start, mode="fast"):
if start <= 2:
return 2
elif start & 1 == 0:
start = start + 1
while True:
if mode == "slow":
if is_prime(start):
break
else:
if miller_rabbin(start):
break
start = start + 2
return start
