Abstract:Let (Un) n∈N be a fixed linear recurrence sequence defined over the integers (with some technical restrictions). We prove that there exist effectively computable constants B and N 0 such that for any b, c ∈ Z with b > B the equation Un − b m = c has at most two distinct solutions (n, m) ∈ N 2 with n ≥ N 0 and m ≥ 1. Moreover, we apply our result to the special case of Tribonacci numbers given by T 1 = T 2 = 1, T 3 = 2 and Tn = T n−1 + T n−2 + T n−3 for n ≥ 4. By means of the LLL-algorithm and continued fractio… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.