English

Intervals without primes near an iterated linear recurrence sequence

Number Theory 2025-04-22 v1

Abstract

Let MM be a fixed positive integer. Let (Rj(n))n1(R_{j}(n))_{n\ge 1} be a linear recurrence sequence for every j=0,1,,Mj=0,1,\ldots, M, and we set f(n)=(R0RM)(n)f(n)=(R_0\circ \cdots \circ R_M)(n), where (ST)(n)=S(T(n))(S\circ T)(n)= S(T(n)). In this paper, we obtain sufficient conditions on (R0(n))n1,,(RM(n))n1(R_{0}(n))_{n\ge 1},\ldots, (R_{M}(n))_{n\ge 1} so that the intervals (f(n)clogn,f(n)+clogn)(|f(n)|-c\log n, |f(n)|+c\log n) do not contain any prime numbers for infinitely many integers n1n\ge 1, where cc is an explicit positive constant depending only on the orders of R0,,RMR_0,\ldots, R_M. As a corollary, we show that if for each j=1,2,,Mj=1,2,\ldots, M, the sequence (Rj(n))n1(R_j(n))_{n\ge 1} is positive, strictly increasing, and the constant term of its characteristic polynomial is ±1\pm 1, then for every Pisot or Salem number α\alpha, the numbers α(R1RM)(n)\lfloor \alpha^{(R_1\circ \cdots \circ R_M)(n)} \rfloor are composite for infinitely many integers n1n\ge 1.

Keywords

Cite

@article{arxiv.2504.14968,
  title  = {Intervals without primes near an iterated linear recurrence sequence},
  author = {Kota Saito},
  journal= {arXiv preprint arXiv:2504.14968},
  year   = {2025}
}

Comments

9 pages

R2 v1 2026-06-28T23:05:21.412Z