On the largest prime factor of the k-Fibonacci numbers

DOI10.1142/S1793042113500309MaRDI QIDQ2840311zbMATH OpenOpenAlexWikidataFDO

Authors Jhon J. Bravo, Florian Luca

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

zbMATH Keywords

linear forms in logarithmsexplicit estimate\(k\)-Fibonacci numbersgreatest prime factor

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)

Abstract: Let $P(m)$ denote the largest prime factor of an integer $mgeq2$, and put $P(0)=P(1)=1$. For an integer $kgeq2$, let $(F_n^{(k)}{)}_{ngeq2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,\mathrm{...},0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. Here, we show that if $ngeqk+2$, then $P(F_n^{(k)})>cloglogn$, where $c>0$ is an effectively computable constant. Furthermore, we determine all the $k-$Fibonacci numbers $F_n^{(k)}$ whose largest prime factor is less than or equal to 7.

Recommendations

• On the largest prime factor of the ratio of two generalized Fibonacci numbers
• On prime factors of the sum of two \(k\)-Fibonacci numbers
• \(k\)-Fibonacci numbers close to a power of 2
• Mersenne \(k\)-Fibonacci numbers
• \(k\)-generalized Fibonacci numbers of the form \(1+2^{n_1}+4^{n_2}+\cdots +(2^{k})^{n_k}\)

Cites work

• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Generalized Fibonacci Numbers and Associated Matrices
• Number Theory
• On Generalized Fibonacci Numbers
• On binary recurrence sequences
• On the greatest prime factor of terms of a linear recurrence sequence
• The n -th Prime is Greater than n logn

Cited in

(21)

• On the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbers
• Multiplicative dependence between \(k\)-Fibonacci and \(k\)-Lucas numbers
• scientific article; zbMATH DE number 7639921 (Why is no real title available?)
• \(k\)-generalized Fibonacci numbers which are concatenations of two repdigits
• Solutions to a Pillai-type equation involving tribonacci numbers and \(S\)-units
• scientific article; zbMATH DE number 7662498 (Why is no real title available?)
• Generalized Lucas numbers which are concatenations of two repdigits
• Mersenne \(k\)-Fibonacci numbers
• On the intersection of \(k\)-Fibonacci and Pell numbers
• Multiplicative independence in k-generalized Fibonacci sequences
• Terms of generalized Fibonacci sequences that are powers of their orders
• Even perfect numbers among generalized Fibonacci sequences
• On the discriminant of the \(k\)-generalized Fibonacci polynomial. II.
• Generalized Fibonacci numbers of the form \(2^a + 3^b + 5^c\)
• \(k\)-Fibonacci powers as sums of powers of some fixed primes
• \(k\)-Fibonacci numbers close to a power of 2
• On the Largest Prime factor of the k-generalized Lucas numbers
• On prime factors of the sum of two \(k\)-Fibonacci numbers
• On the largest prime factor of the ratio of two generalized Fibonacci numbers
• On some combinations of terms of a recurrence sequence
• Generalized Cullen numbers in linear recurrence sequences

This page was built for publication: On the largest prime factor of the \(k\)-Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840311)