Example #1
0
def prime(k):
    while True:
        q = Prime.prime(k)
        p = 2*q+1
        test = Prime.miller(p, 100)
        if test:
            return p
def prime_factor(num):
    import Prime
    prime_factor_list = []
    factor = 2
    while num != 1:
        if not Prime.prime(factor) :
            factor += 1
            continue
        if num % factor != 0:
            factor += 1
            continue
        else:
            num = num / factor
            prime_factor_list.append(factor)
    return prime_factor_list
Example #3
0
## EMIRP
##
## challenge #67 (easy)
## http://www.reddit.com/r/dailyprogrammer/comments/vfylp/6222012_challenge_68_easy/
##
##
## [email protected]
##

import Prime
num = int(raw_input("Enter a number: "))
emirp_list = []
for i in xrange(10,num+1):
    if Prime.prime(i):
        temp = int(str(i)[::-1])
        if Prime.prime(temp) and i != temp:
            emirp_list.append(str(i))
print ", ".join(emirp_list)
Example #4
0
## EMIRP
##
## challenge #67 (easy)
## http://www.reddit.com/r/dailyprogrammer/comments/vfylp/6222012_challenge_68_easy/
##
##
## [email protected]
##

import Prime
num = int(raw_input("Enter a number: "))
emirp_list = []
for i in xrange(10, num + 1):
    if Prime.prime(i):
        temp = int(str(i)[::-1])
        if Prime.prime(temp) and i != temp:
            emirp_list.append(str(i))
print ", ".join(emirp_list)