PYTHON judgment palindromic prime

1. For python judgment prime

def isprime(x):
    if x<2:
        return False
    for i in range(2,x):
        if x % i == 0:
            return False
    return True

Further optimized

import math


def isprime(x):
    if x<2:
        return False
    for i in range(2,int(math.sqrt(x))):
        if x % i == 0:
            return False
    return True

2. Use python to judge the number of palindrome

def ispalindrome(x):
    p = x
    k = 0
    while p!=0:
        k = k*10 + p%10
        p = p // 10
    if k==x:
        return True
    else:
        return False

3. Combining the two, we get a program for judging the prime number of palindrome

def isprime(x):
    if x<2:
        return False
    for i in range(2,x):
        if x % i == 0:
            return False
    return True


def ispalindrome(x):
    p = x
    k = 0
    while p!=0:
        k = k*10 + p%10
        p = p // 10
    if k==x:
        return True
    else:
        return False


for i in range(10,1000,1):
    if isprime(i) == 1 and ispalindrome(i):
        print(i)