Arbitrarily long strings of consecutive primes in special sets
Acta Arithmetica
MSC: Primary 11N05; Secondary 11N36
DOI: 10.4064/aa240201-25-5
Published online: 24 September 2025
Abstract
Let $F(x)$ be a function of the form $ \sum_{i=1}^r d_i x^{\rho_i}$, where $d_1,\ldots ,d_r\in \mathbb {R}$, $0 \leq \rho_1 \lt \cdots \lt \rho_r$, $\rho _r \notin \mathbb Z$, $\rho _i \in \mathbb R$ for $ 1 \leq i \leq r$ and $d_r\ne 0$. We prove that the sets of the form $\{ n \in \mathbb N: \{ F(n) \} \in U \}$ for any non-empty open set $U \subset [0,1)$ contain arbitrarily long strings of consecutive primes.
