Prime.py

def is_prime(num):
    if num <= 1:
        return False
    if num == 2:
        return True

    for i in range (2,num):
        if num % i == 0:
            return False

    return True

def sum_of_digits(num):
    s = (str)(num)

    sum = 0

    for i in s:
        digit = (int)(i)
        sum += digit

    return sum

def is_primey(num):
    return is_prime(num) and is_prime(num + sum_of_digits(num))

def pause(msg = ''):
    pause = raw_input(msg)


def get_primes_in_range(min,max):
    primes = []
    for i in range (min,max):
        if is_prime(i):
            primes.append(i)
    return primes

'''
min = 100
max = 1000

primes = get_primes_in_range(min,max)

for i in primes:
    print i

print 'Number of primes in range (' + (str)(min) + '-' + (str)(max) + '): ' + (str)(len(primes))

pause()
#'''