On prime factors of the sum of two k-Fibonacci numbers

DOI10.1142/S1793042118500720zbMath1421.11018OpenAlexW2765622810WikidataQ114071992 ScholiaQ114071992MaRDI QIDQ4639974

Florian Luca, Carlos Alexis Gómez Ruiz

Publication date: 15 May 2018

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042118500720

zbMATH Keywords

generalized Fibonacci numbers\(S\)-integerslower bounds for non-zero linear forms in logarithms of algebraic numbers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Existence of primitive divisors of Lucas and Lehmer numbers
• An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
• ON THE LARGEST PRIME FACTOR OF THE k-FIBONACCI NUMBERS
• Generalized Fibonacci Numbers and Associated Matrices
• On The diophantine equationFn+F_m=2^a
• Powers of two as sums of two k-Fibonacci numbers
• A simplified Binet formula for k-generalized Fibonacci numbers
• On Generalized Fibonacci Numbers
• Number Theory

This page was built for publication: On prime factors of the sum of two k-Fibonacci numbers