def calc_v1(n): import integer primes = sorted(list(integer.primes(n))) primes_len = len(primes) max_len = calc_max_len(n, primes) print "max_len:", max_len for count in xrange(max_len - 1, 2, -1): for i in xrange(primes_len - count): sum_primes = sum(primes[i:(i + count)]) if sum_primes > n: break if sum_primes in primes: return sum_primes, count, primes[i:(i + count)] return None
def calc_v1(n): import integer primes = integer.primes(20 * n) print primes return sorted(list(primes))[n - 1]
from integer import primes from itertools import combinations p = primes(1000000) def fours() : for i in {1, 7} : pr = set() for j in range(10) : k = int(str(j) * 3 + str(i)) if k in p : pr.add(k) print(pr) def fives() : for i in range(10) : for j in {1, 3, 7, 9} : for k in range(4) : pr = set() for m in range(10) : l = str(m) * 3 + str(j) l = l[:k] + str(i) + l[k:] l = int(l) if l in p : pr.add(l) if pr : print(pr) def sixes() : for i in combinations({0, 1, 2, 3, 4}, 2) : for x1 in range(10) :
def calc_v1(n): import integer return sum(integer.primes(n))
from integer import primes upper = 50000000 p = primes(int(upper**.5 + 1)) ex = set() total = 0 for k in [x for x in p if x**4 < upper] : for l in [x for x in p if x**3 + k**4 < upper] : for m in [x for x in p if x**2 + k**4 + l**3 < upper] : j = m**2 + k**4 + l**3 if not j in ex : total += 1 ex.add(j) # print(j) print(total)
import integer pn = integer.primes(1000000) pns = set(pn) ocs = {i for i in range(3,1000000)} for i in pn[:1000] : for j in range(1,100) : k = i + j**2 * 2 if k in ocs : ocs.remove(k) ocs = list(ocs) ocs.sort() for i in ocs : if i % 2 and not i in pns : print(i) break