In:
International Journal of Number Theory, World Scientific Pub Co Pte Ltd, Vol. 14, No. 04 ( 2018-05), p. 1171-1195
Abstract:
We consider for integers [Formula: see text] the [Formula: see text] -generalized Fibonacci sequences [Formula: see text], whose first [Formula: see text] terms are [Formula: see text] and each term afterwards is the sum of the preceding [Formula: see text] terms. We give a lower bound for the largest prime factor of the sum of two terms in [Formula: see text]. As a consequence of our main result, for every fixed finite set of primes [Formula: see text] , there are only finitely many positive integers [Formula: see text] and [Formula: see text] -integers which are a non-trivial sum of two [Formula: see text]-Fibonacci numbers, and all these are effectively computable.
Type of Medium:
Online Resource
ISSN:
1793-0421
,
1793-7310
DOI:
10.1142/S1793042118500720
Language:
English
Publisher:
World Scientific Pub Co Pte Ltd
Publication Date:
2018
SSG:
17,1
Bookmarklink