Abstract
Let be a finite, non-empty set of distinct prime numbers. For a non-zero integer , write , where are non-negative integers and is an integer relatively prime to . We define the -part of by . Let be a linear recurrence sequence of integers. Under certain necessary conditions, we establish that for every , there exists an integer such that holds for . Our proof is ineffective in the sense that it does not give an explicit value for . Under various assumptions on , we also give effective, but weaker, upper bounds for of the form , where is positive and depends only on and .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.