def problem_49(): """ Attempt to solve the problem... """ # create a list of primes that are exactly 4 digits primes = [x for x in list(seive_generator(9999) )if int(log10(x)) + 1 == 4] know_seq = [1487, 4817, 8147] for x in primes: perms = set() for v in list(permutations(str(x))): prime = ''.join(v) if len(prime) is not 4: continue prime = int(prime) if prime in primes: perms.add(prime) maches = set() for y in perms: for z in perms: if fabs(y - z) == 3330: maches.add(y) if len(maches) == 3: print x print maches return 0
def problem_50(): """ Attempt to solve the problem... """ primes = list(seive_generator(1000000)) best = (0, 0) for prime in primes: ans = subarray_sum(primes[:int(prime ** 0.5)], prime) if len(ans) > best[1]: best = (prime, len(ans)) return best[0]
def problem_51(): """ Attempt to solve the problem... """ primes = list(seive_generator(999)) for prime in primes: prime = str(prime) if len(prime) != 2: continue for x in xrange(0, 10): print print prime return 0
def problem_46(): """ Attempt to solve the problem... """ primes = {x: 0 for x in seive_generator(10000)} for odd_number in xrange(9, 10000, 2): if primes.get(odd_number): continue is_goldbach = False for prime in primes.keys(): if prime > odd_number: continue if sqrt((odd_number - prime) / 2.0) % 1 == 0: is_goldbach = True break if not is_goldbach: return odd_number
def test_seive(): """Tests covering the prime number Seive """ for number in seive_generator(7919): assert number in PRIME_NUMBERS
def problem_7(): """ Attempt to solve the problem... """ return [x for x in seive_generator(300000)][10000]