Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$S$-parts of sums of terms of linear recurrence sequences (2004.06988v1)

Published 15 Apr 2020 in math.NT

Abstract: Let $S= { p_1, \ldots, p_s}$ be a finite, non-empty set of distinct prime numbers and $(U_{n}){n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j{(k)}){j\geq 1}$ an increasing sequence composed of integers of the form $U_{n_k} +\cdots + U_{n_1}, \ n_k>\cdots >n_1$. Under certain assumptions, we prove that for any $\epsilon >0,$ there exists an integer $n_{0}$ such that $[U_j{(k)}]_S < \left(U_j{(k)}\right){\epsilon},$ for $ j > n_0,$ where $[m]S$ denote the $S$-part of the positive integer $m$. On further assumptions on $(U{n}){n \geq 0},$ we also compute an effective bound for $[U_j{(k)}]_S$ of the form $\left(U_j{(k)}\right){1-c}$, where $c $ is a positive constant depends only on $(U{n})_{n \geq 0}$ and $S.$

Summary

We haven't generated a summary for this paper yet.