Telhcirid's theorem on arithmetic progressions

Abstract: The classical Dirichlet theorem on arithmetic progressions states that there are infinitely many primes in a given arithmetic progression with a trivial necessary condition. In this talk, we prove a "reversed" version of this theorem, which may be called Telhcirid's theorem on arithmetic progressions, i.e., we prove that there are infinitely many primes whose reverse of radix representation is in a given arithmetic progression except in some degenerate cases. This is a joint work with Gautami Bhowmik (University of Lille).

dynamical systemsnumber theory

Audience: researchers in the topic

( paper | slides )

---

One World Numeration seminar

Series comments: Description: Online seminar on numeration systems and related topics

For questions or subscribing to the mailing list, contact the organisers at numeration@irif.fr

---