python输出最大的素数_Python中的最大素数回文

我正在尝试创建一个程序，它输出的质数最高，而不是回文，并且小于1000。预期产量应为929

尝试1number = 1

prime = 1

maxNumber = 1000

while number > maxNumber:

if str(number) == str(number)[::-1]: #Inverts the string

for number in range(number,maxNumber): #Increments number until 1000

for i in range(2, number): #Checks current number and divides all lower

if number % i == 0:

break

else:

prime = number

print(prime)

尝试2

^{pr2}$

尝试三，我按照建议将两个函数分开，以减少处理时间for number in xrange(1000):

if str(number) == str(number)[::-1]: and is_prime(number):

prime = number

print(number)

#Method to find prime numbers

def is_prime(n):

if n == 2 or n == 3:

return True

elif n < 2 or n%2 == 0:

return False

elif n < 9:

return True

elif n%3 == 0:

return False

r = int(n**0.5)

f = 5

while f <= r:

if n%f == 0:

return False

if n%(f+2) == 0:

return False

f +=6

return True

尝试4:接收错误[未定义名称'is_prime']for number in range(1000,3,-1):

if str(number) == str(number)[::-1] and is_prime(number):

print(number)

break

#Method to check if number is prime

def is_prime(n):

if n == 2 or n == 3: return True

if n < 2 or n%2 == 0: return False

if n < 9: return True

if n%3 == 0: return False

r = int(n**0.5)

f = 5

while f <= r:

if n%f == 0: return False

if n%(f+2) == 0: return False

f +=6

return True

最后的解决方案：谢谢大家的帮助。这比我预想的更有帮助。在#Method to check if number is prime

def is_prime(n):

if n == 2 or n == 3: return True

if n < 2 or n%2 == 0: return False

if n < 9: return True

if n%3 == 0: return False

r = int(n**0.5)

f = 5

while f <= r:

if n%f == 0: return False

if n%(f+2) == 0: return False

f +=6

return True

#Checking for numbers that are palindromes and prime

for number in range(1000,3,-1):

if str(number) == str(number)[::-1] and is_prime(number):

print(number)

break