Generalization of Greatest Common Divisor of Shifted Fibonacci Numbers
Tran Quang Do and Luu Ba Thang
Department of Mathematics and Informatics
Hanoi National University of Education
136 Xuan Thuy
Let Fn denote the n'th Fibonacci number
and let k be a positive integer. We find
necessary and sufficient conditions on s and t
so that the function
n → gcd(Fn + s,
Fn + k + t) is unbounded.
Full version: pdf,
(Concerned with sequences
Received October 18 2022;
revised versions received November 8 2022; November 11 2022.
Published in Journal of Integer Sequences,
November 13 2022.
Journal of Integer Sequences home page