def solve():
last = 1000000
result = 0
max_len = 0
primes = sieve(last)
prime_set = set(primes)
for i in xrange(len(primes)):
for j in xrange(i + max_len + 1, len(primes) + 1):
prime = sum(primes[i:j])
if prime >= last:
break
if prime in prime_set:
max_len = j - i
result = prime
return result
def solve():
primes = sieve(10000)
perm_sets = defaultdict(set)
for prime in primes:
if prime >= 1000:
perm_sets[frozenset(splitdigits(prime))].add(prime)
for perms in perm_sets.itervalues():
for x in perms:
for y in perms:
if x < y:
z = y + (y - x)
if z in perms and z not in (1487, 4817, 8147):
return int('%s%s%s' % (x, y, z))
from util import sieve
primes = set(sieve(1000000))
def rotations(i):
result = []
s = str(i)
for j in xrange(len(s)):
result.append(int(s[j:] + s[:j]))
return result
def circular(prime):
r = set(rotations(prime))
return len(r) == len(r & primes)
def solve():
return sum(circular(prime) for prime in primes)
if __name__ == '__main__':
print solve()
""" This file contains a solution for the seventh Project Euler problem. https://projecteuler.net/problem=7 Author: Clinton Morrison File: 007.py """ import util primes = util.sieve(200000) print primes[10000]
""" This file contains a solution for the tenth Project Euler problem. https://projecteuler.net/problem=10 Author: Clinton Morrison File: 010.py """ import util print sum(util.sieve(2000000))
def solve():
return sum(sieve(2000000))
