Python is_prime_sieve示例

示例#1

文件： p049.py 项目： gstarmvp/Various

from helpers import is_prime_sieve
is_prime = is_prime_sieve(10000)

for i in range(1000, 10000 - 6660):
    if is_prime(i):
        a = sorted(str(i))
        b = sorted(str(i + 3330))
        c = sorted(str(i + 6660))
        if a == b == c and is_prime(i + 3330) and is_prime(i + 6660):
            print i, i + 3330, i + 6660

示例#2

from helpers import is_prime_sieve

def term(m,n):
    #mth term along nth diagonal
    return 1 + (2*n)*m + 4*(m-1)*m

is_prime = is_prime_sieve(term(13121,4))

m = 0
termcount = 0
while True:
    m += 1
    termcount += len([1 for n in range(1,5) if is_prime(term(m,n))])
    ratio = termcount/(m*4.0+1)
    if ratio < 0.10:
        print m*2+1, ratio
        break

示例#3

import itertools
from helpers import is_prime_sieve

is_prime = is_prime_sieve(7654321)

print reduce(
    max,
    filter(is_prime,
           map(lambda x: int(''.join(x)), itertools.permutations('1234567'))))

示例#4

文件： p049.py 项目： LewisJEllis/Various

from helpers import is_prime_sieve
is_prime = is_prime_sieve(10000)

for i in range(1000,10000-6660):
    if is_prime(i):
        a = sorted(str(i))
        b = sorted(str(i + 3330))
        c = sorted(str(i + 6660))
        if a == b == c and is_prime(i+3330) and is_prime(i+6660):
            print i, i + 3330, i + 6660

示例#5

文件： p041.py 项目： LewisJEllis/Various

import itertools
from helpers import is_prime_sieve

is_prime = is_prime_sieve(7654321)

print reduce(max, filter(is_prime, map(lambda x: int(''.join(x)), itertools.permutations('1234567'))))