On Telhcirid's theorem on arithmetic progressions

In this paper, we study the distribution of the digital reverses of prime numbers, which we call the “reversed primes”. We prove the infinitude of reversed primes in any arithmetic progression satisfying straightforward necessary conditions provided the base is sufficiently large. We indeed prove an effective Siegel–Walfisz type result for reversed primes, which has a larger admissible level of modulus than the classical case.