def findSumMaxPrime():
limit = 1000000
primesCat = p27.findPrimes(limit)
primes = [x for x in primesCat.keys() if primesCat[x] == True]
sumPrimes = calcPrimeSums(primes)
lenSP = len(sumPrimes)
result = 0
numP = 0
for i in range(numP, lenSP):
for j in range(i - numP - 1, 0, -1):
if sumPrimes[i] - primes[j] > limit:
break
x = sumPrimes[i] - sumPrimes[j]
if primesCat[x] == True:
numP = i - j
result = x
return result
def findSeq(): primeCat = p27.findPrimes(9999) primes = [x for x in primeCat.keys() if primeCat[x] == True and x>999 and x<10000] res = [] for p in primes: res = [] for t in [x for x in itertools.permutations(p.__str__(),4)]: if primeCat[p32.convertToInt(t)] == True and p32.convertToInt(t) != p and len(p32.convertToInt(t).__str__())==4: res.append(p32.convertToInt(t)) for r in res: if r in (1487,4817,8147): continue for s in res: if s >= r: break if (2*r-s) in res: st = '' for s in (s,r,2*r-s): st+=str(s) return st
