defisPrime(number):
divisor =2while divisor <= number /2:if number % divisor ==0:returnFalseelse:
a = number //100%10
b = number %100%10if a == b:returnTrue
divisor +=1# return TruedefprintPrimeNumbers(numberOfPrimes):# 这个代码之前就没有用,作者写的目的是什么呢?
NUMBER_OF_PRIMES =50
NUMBER_OF_PRIMES_PER_LINE =10# 如果用count 做while 那么应该是1000个回文数
count =0
number =2# 这个条件就是1000个数以内的回文素数while count < numberOfPrimes:if isPrime(number):
count +=1print(number, end=" ")if count % NUMBER_OF_PRIMES_PER_LINE ==0:print()
number +=1defmain():print("The prime numbers is in 100")
printPrimeNumbers(100)
main()