# Proof of infinitude of primes whose reversal in base 10 is also prime [closed]

Is there any proof of infinitude of A007500 primes?

If you want to generate them here is trivial and naive python program.

def is_prime(n):
i = 2
while i*i <= n:
if n%i == 0:
return False
i = i + 1
else:
return True

print [x for x in range(1,200) if is_prime(x) and is_prime(int(str(x)[::-1]))]

-

## closed as too localized by Mark Sapir, Felipe Voloch, Dmitri Pavlov, Benjamin Steinberg, quidDec 9 '11 at 14:59

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question.

Mark Sapir: that page is about a subset of the set OP asks about, and does not say whether that subset is infinite. Thus, I don't see how this answers the question. –  Zsbán Ambrus Dec 9 '11 at 9:49
It says that "the largest known ... is ...". What else do you want? All such problems are open. The maximal result about a natural set of numbers with infinite subset of primes is the Dirichlet theorem. Everybody with access to Google can learn it in a few minutes. –  Mark Sapir Dec 9 '11 at 10:01
The OP is not asking about palindromes which are primes, and that is why the linked mathworld page is irrelevant. The OP is asking about primes whose reverses are also primes, regardless of whether the number and its reverse are the same. –  Sridhar Ramesh Dec 9 '11 at 11:01

-