Intervals without primes near an iterated linear recurrence sequence

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

Publication Details

Journal
ArXiv.org
Published
2025-04-21
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Intervals without primes near an iterated linear recurrence sequence

ArXiv.org
semigroups and automata theory
article

Intervals without primes near an iterated linear recurrence sequence

article en

Abstract

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

ArXiv.org
Japan Society for the Promotion of Science
Openalex Percentile: Top 48%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.