English

Arbitrarily long strings of consecutive primes in special sets

Number Theory 2025-08-26 v2

Abstract

Let F(x)F(x) be a function of the form i=1rdixρi \sum_{i=1}^r d_i x^{\rho_i} where d1,,drRd_1,\ldots,d_r\in\mathbb{R}, 0ρ1<<ρr,0 \leq \rho_1 < \ldots < \rho_r, ρr∉Z,ρiR\rho_r \not\in \mathbb{Z},\rho_i \in \mathbb{R} for 1ir 1 \leq i \leq r and dr0d_r\not=0. We prove that sets of the form {nN:{F(n)}U}\{ n \in \mathbb{N}: \{ F(n) \} \in U \} for any non-empty open set U[0,1)U \subset [0,1) contain arbitrarily long strings of consecutive primes.

Keywords

Cite

@article{arxiv.2311.18701,
  title  = {Arbitrarily long strings of consecutive primes in special sets},
  author = {Sai Sanjeev Balakrishnan and Félix Houde and Vahagn Hovhannisyan and Maryna Manskova and Yiqing Wang},
  journal= {arXiv preprint arXiv:2311.18701},
  year   = {2025}
}

Comments

v2: 35 pages, incorporated changes suggested by referees