def main(verbose=False):
PRIMES = sieve(10 ** 5)
running_sum = 0
for prime in PRIMES:
if not prime_divides_repunit_power10(prime):
running_sum += prime
return running_sum
def main(verbose=False):
PRIMES = sieve(10 ** 6)
prime_index = 3 # p0=2, p1=3, and p2=5 are false positives
matches = []
while len(matches) < 40:
prime = PRIMES[prime_index]
if prime_divides_repunit_power10(prime, 9):
matches.append(prime)
prime_index += 1
return sum(matches)
