1.用python判断素数
def isprime(x):
if x<2:
return False
for i in range(2,x):
if x % i == 0:
return False
return True
进一步优化得
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.用python判断回文数
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.两者相结合,我们就得到了一个判断回文素数的程序
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)