Repdigits as sums of two \(k\)-Fibonacci numbers
From MaRDI portal
Publication:2514254
DOI10.1007/s00605-014-0622-6zbMath1390.11034OpenAlexW2104847151MaRDI QIDQ2514254
Publication date: 3 February 2015
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-014-0622-6
Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Related Items
On Fermat and Mersenne numbers expressible as product of two \(k\)-Fibonacci numbers, Repdigits as sums of two generalized Lucas numbers, On repdigits which are sums or differences of two \(k\)-Pell numbers, \(k\)-Fibonacci and \(k\)-Lucas numbers as product of two repdigits, Unnamed Item, Repdigits in Narayana's Cows Sequence and their Consequences
Cites Work
- The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- On a conjecture about repdigits in k-generalized Fibonacci sequences
- Generalized Fibonacci and Lucas Sequences and Rootfinding Methods
- Generalized Fibonacci Numbers and Associated Matrices
- On the Periods of Generalized Fibonacci Recurrences
- A simplified Binet formula for k-generalized Fibonacci numbers
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- On Generalized Fibonacci Numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item