Skip to content
Snippets Groups Projects
Commit acdb419a authored by Taddeus Kroes's avatar Taddeus Kroes
Browse files

Solved 50

parent 1a8b5ee2
No related branches found
No related tags found
No related merge requests found
#!/usr/bin/env python
from math import sqrt
from utils import primes_until
def maxprime(n):
primes = list(primes_until(n))
maxp = maxlen = 2
for start in xrange(len(primes)):
for end in xrange(start + maxlen + 1, start + 800):
if end - start >= maxlen:
conseq = primes[start:end]
s = sum(conseq)
if len(conseq) > 1 and s in primes[start:]:
maxlen = end - start
maxp = s
print maxp
#print '%s = %d' % (' + '.join(map(str, primes[start:end])), s)
return maxp
print maxprime(1000000)
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment