SS-parts of terms of integer linear recurrence sequences

preprint2016arXivOpen access

Abstract

Let S={q1,…,qs}S = \{q_1, \ldots , q_s\} be a finite, non-empty set of distinct prime numbers. For a non-zero integer mm, write m=q1r1…qsrsMm = q_1^{r_1} \ldots q_s^{r_s} M, where r1,…,rsr_1, \ldots , r_s are non-negative integers and MM is an integer relatively prime to q1…qsq_1 \ldots q_s. We define the SS-part [m]S[m]_S of mm by [m]S:=q1r1…qsrs[m]_S := q_1^{r_1} \ldots q_s^{r_s}. Let (un)n≥0(u_n)_{n \ge 0} be a linear recurrence sequence of integers. Under certain necessary conditions, we establish that for every ε>0\varepsilon > 0, there exists an integer n0n_0 such that [un]S≤∣un∣ε[u_n]_S\leq |u_n|^{\varepsilon} holds for n>n0n > n_0. Our proof is ineffective in the sense that it does not give an explicit value for n0n_0. Under various assumptions on (un)n≥0(u_n)_{n \ge 0}, we also give effective, but weaker, upper bounds for [un]S[u_n]_S of the form ∣un∣1−c|u_n|^{1 -c}, where cc is positive and depends only on (un)n≥0(u_n)_{n \ge 0} and SS.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.