PalindromicPrimes2.py

#PalindromicPrimes2.py
#Uses iteration for greater range of numbers
#Python2.7
#By Chris Clarke
#Version: 2 uses square root
#08.05.2015

import math

def isPrime(n): # iterative not recursive, range > 100000 (see also RecursivePalindromicPrimes.py)
    if n<2:
        return False
    root_n = int(math.sqrt(n) + 1) # using square root speeds things up
    for i in range(2, root_n):
        if n%i==0:
            return False
    return True


def isPalindrome(word):
    return word == word[::-1]


lower = int(input("Enter lower limit: "))
upper = int(input("Enter upper limit: "))

for n in range(lower, upper):
    if isPrime(n):
        if isPalindrome(str(n)):
            print n, "is a palindromic prime"