Find prime n such that reversed n is also prime: Difference between revisions

=={{header|Python}}==

<lang python>#!/usr/bin/python

def isPrime(n):

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

if n % i == 0:

return False

return True

def isBackPrime(n):

if not isPrime(n):

return False

m = 0

while n:

m *= 10

m += n % 10

n //= 10

return isPrime(m)

if __name__ == '__main__':

for n in range(2, 499):

if isBackPrime(n):

print(n, end=' ');</lang>

{{out}}

<pre>2 3 5 7 11 13 17 31 37 71 73 79 97 101 107 113 131 149 151 157 167 179 181 191 199 311 313 337 347 353 359 373 383 389</pre>