S-parts of sums of terms of linear recurrence sequences
Abstract
Let S= \ p1, …, ps\ be a finite, non-empty set of distinct prime numbers and (Un)n ≥ 0 be a linear recurrence sequence of integers of order r. For any positive integer k, we define (Uj(k))j≥ 1 an increasing sequence composed of integers of the form Unk +·s + Un1, \ nk>·s >n1. Under certain assumptions, we prove that for any ε >0, there exists an integer n0 such that [Uj(k)]S < (Uj(k))ε, for j > n0, where [m]S denote the S-part of the positive integer m. On further assumptions on (Un)n ≥ 0, we also compute an effective bound for [Uj(k)]S of the form (Uj(k))1-c, where c is a positive constant depends only on (Un)n ≥ 0 and S.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.