ON THE LARGEST PRIME FACTOR OF THE k-FIBONACCI NUMBERS
From MaRDI portal
Publication:2840311
DOI10.1142/S1793042113500309zbMath1292.11034arXiv1210.4101OpenAlexW2156386999WikidataQ114072051 ScholiaQ114072051MaRDI QIDQ2840311
Publication date: 17 July 2013
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4101
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Related Items (18)
Terms of generalized Fibonacci sequences that are powers of their orders ⋮ Unnamed Item ⋮ On the largest prime factor of the ratio of two generalized Fibonacci numbers ⋮ \(k\)-Fibonacci powers as sums of powers of some fixed primes ⋮ Generalized Cullen numbers in linear recurrence sequences ⋮ Unnamed Item ⋮ Mersenne k-Fibonacci numbers ⋮ Multiplicative dependence between \(k\)-Fibonacci and \(k\)-Lucas numbers ⋮ Generalized Fibonacci numbers of the form \(2^a + 3^b + 5^c\) ⋮ On prime factors of the sum of two k-Fibonacci numbers ⋮ Multiplicative independence in \(k\)-generalized Fibonacci sequences ⋮ On some combinations of terms of a recurrence sequence ⋮ k-generalized Fibonacci numbers which are concatenations of two repdigits ⋮ Unnamed Item ⋮ Even perfect numbers among generalized Fibonacci sequences ⋮ On the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbers ⋮ Generalized Lucas numbers which are concatenations of two repdigits ⋮ k−Fibonacci numbers close to a power of 2
Cites Work
- On the greatest prime factor of terms of a linear recurrence sequence
- On binary recurrence sequences
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Generalized Fibonacci Numbers and Associated Matrices
- On Generalized Fibonacci Numbers
- The n -th Prime is Greater than n logn
- Number Theory
This page was built for publication: ON THE LARGEST PRIME FACTOR OF THE k-FIBONACCI NUMBERS
