On \(k\)-Pell numbers close to power of 2
From MaRDI portal
Publication:6667496
DOI10.15446/RECOLMA.V58N1.117434MaRDI QIDQ6667496
Alain S. Togbé, Mohamadou Bachabi
Publication date: 20 January 2025
Published in: Revista Colombiana de Matemáticas (Search for Journal in Brave)
Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Common terms of \(k\)-pell numbers and Padovan or Perrin numbers
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Powers of two in generalized Fibonacci sequences
- On a generalization of the Pell sequence
- k−Fibonacci numbers close to a power of 2
- Repdigits in generalized Pell sequences
- Powers of two as sums of two k-Fibonacci numbers
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- The \(k\)-generalized Lucas numbers close to a power of 2
This page was built for publication: On \(k\)-Pell numbers close to power of 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667496)