__author__ = 'adam' from primes import numpyPrimes import copy primelist = numpyPrimes(10 ** 6) primeset = set(primelist) primeSumNum = {} target = 10**6 components = [] bestComponents=[] for i, prime in enumerate(primelist): if sum(components) in primeset: if len(components) > len(bestComponents): bestComponents=copy.copy(components) if sum(components) < target: components.append(prime) testcomponents=copy.copy(components) while len(testcomponents)>len(bestComponents): if sum(testcomponents) in primeset: bestComponents=copy.copy(testcomponents) break else: testcomponents=testcomponents[1:] #check decreasing shit until length of bestcomponents else: if len(components) < len(bestComponents): break while sum(components) > target:
__author__ = 'adam' import pandigit import primes import itertools primelist = primes.numpyPrimes(20) def isPrimeDivisible(n): for i in xrange(7): if int(n[1+i:4+i]) % primelist[i]!=0: return False return True count=0 list=[] for i in itertools.permutations('0123456789'): i=''.join(i) if i[0]=='0': continue if isPrimeDivisible(i): list.append(int(i)) print list print sum(list)
def isGoldbach(x): for i in primes.numpyPrimes(x): rest = sqrt((x-i)/2) if int(rest) - rest == 0: return True return False
__author__ = 'adam' import primes import pandigit import numpy as np primelist = primes.numpyPrimes(1000000000) print len(primelist) print 'done with primes' for i in np.nditer(primelist): if pandigit.isPandigital(i): print i print 'done'
__author__ = 'adam' from primes import numpyPrimes import copy primelist = numpyPrimes(10**6) primeset = set(primelist) primeSumNum = {} target = 10**6 components = [] bestComponents = [] for i, prime in enumerate(primelist): if sum(components) in primeset: if len(components) > len(bestComponents): bestComponents = copy.copy(components) if sum(components) < target: components.append(prime) testcomponents = copy.copy(components) while len(testcomponents) > len(bestComponents): if sum(testcomponents) in primeset: bestComponents = copy.copy(testcomponents) break else: testcomponents = testcomponents[1:] #check decreasing shit until length of bestcomponents else: if len(components) < len(bestComponents): break while sum(components) > target: components = components[1:]
__author__ = 'adam' import primes import time before = time.time() primelist1 = primes.numpyPrimes(10**10) after = time.time() print 'time to calculate : ' + str(after - before) print len(primelist1) print primelist1[-1] before = time.time() primelist = primes.readPrimes(10**8) after = time.time() print 'time to read : ' + str(after - before)
def isGoldbach(x): for i in primes.numpyPrimes(x): rest = sqrt((x - i) / 2) if int(rest) - rest == 0: return True return False
__author__ = 'adam' import pandigit import primes import itertools primelist = primes.numpyPrimes(20) def isPrimeDivisible(n): for i in xrange(7): if int(n[1 + i:4 + i]) % primelist[i] != 0: return False return True count = 0 list = [] for i in itertools.permutations('0123456789'): i = ''.join(i) if i[0] == '0': continue if isPrimeDivisible(i): list.append(int(i)) print list print sum(list)
__author__ = "adam" import primes import time before = time.time() primelist1 = primes.numpyPrimes(10 ** 10) after = time.time() print "time to calculate : " + str(after - before) print len(primelist1) print primelist1[-1] before = time.time() primelist = primes.readPrimes(10 ** 8) after = time.time() print "time to read : " + str(after - before)
class PrimeHolder: primelist = primes.numpyPrimes(10**6) primeset = set(primelist)