1. Visiting early at prime times
- Author
-
Haddad, Tony, Leung, Sun-Kai, and Sabuncu, Cihan
- Subjects
Mathematics - Number Theory ,Mathematics - Dynamical Systems ,11N13, 37A44 - Abstract
Given an integer $m \geq 2$ and a sufficiently large $q$, we apply a variant of the Maynard--Tao sieve weight to establish the existence of an arithmetic progression with common difference $q$ for which the $m$-th least prime in such progression is $\ll_m q$, which is best possible. As we vary over progressions instead of fixing a particular one, the nature of our result differs from others in the literature. Furthermore, we generalize our result to dynamical systems. The quality of the result depends crucially on the first return time, which we illustrate in the case of Diophantine approximation., Comment: 15 pages
- Published
- 2024