def build_pairs(prime_n, primes):
"""Builds pairs for given prime_n"""
pair_primes = set([])
for pair_prime in primes:
if isprime(int("".join([str(prime_n), str(pair_prime)]))) \
and isprime(int("".join([str(pair_prime), str(prime_n)]))):
pair_primes.add(pair_prime)
return pair_primes
def all_permutations_prime(prime_set):
"""
Returns True if all permuations of pairs in the set
will concatenate into a prime.
"""
for pair in permutations(prime_set, 2):
if not isprime(int("".join([str(i) for i in pair]))):
return False
return True
def prime_check(x):
'''
if is a variable
'''
if isvar(x):
'''
return the sequence of prime numbers
'''
return condeseq([(eq, x, p)] for p in map(prime, it.count(1)))
else:
'''
else if is successful then check is prime and if is not then it fails
'''
return success if isprime(x) else fail
def check_prime(x):
if lc.isvar(x):
return lc.condeseq([(lc.eq, x, p)] for p in map(prime, it.count(1)))
else:
return lc.success if isprime(x) else lc.fail
def primo(x):
""" x is a prime number """
if isvar(x):
return condeseq([(eq, x, p)] for p in it.imap(prime, it.count(1)))
else:
return success if isprime(x) else fail
def check_prime(x):
if isvar(x):
return condeseq([(eq, x, p)] for p in map(prime, it.count(1)))
else:
return success if isprime(x) else fail
def prime_test(n):
if isvar(n):
return condeseq([(eq, n, p)] for p in map(prime, it.count(1)))
else:
return success if isprime(n) else fail
def primo(x):
""" x is a prime number """
if isvar(x):
return condeseq([(eq, x, p)] for p in map(sg.prime, it.count(1)))
else:
return success if sg.isprime(x) else fail
def pp(lst):
return isprime(int("".join([str(lst[0])+str(lst[1])]))) and \
isprime(int("".join([str(lst[1])+str(lst[0])])))
def _primo(x):
if isvar(x):
return lambda s: (assoc(s, x, p) for p in it.imap(prime, it.count(1)))
else:
return success if isprime(x) else fail
def check_prime(x) : #Is this prime number?
if isvar(x) :
return condeseq([eq(x, p)] for p in map(prime, it.count(1)))
else :
return success if isprime(x) else fail
