博客

1000以内的回文素数

参考了其他blog，已经很简短了

用的函数很普通：

from math import sqrt

def prime_judge(n):

for i in range (2,int (sqrt (n))+1):

if n%i

0:

return False

return True

def palindrome_number_judge(n):

b=n[::-1]

if n

b:

return True

return False

for i in range (2,1000):

if prime_judge(i)==True and palindrone_number_judge(str (i))==True:

print (i) #如果单行输出可以加，end=” ”