On \(k\)-generalized Fibonacci Diophantine triples
From MaRDI portal
Publication:6621967
Publication date: 21 October 2024
Published in: Mathematical Communications (Search for Journal in Brave)
Diophantine equations in many variables (11D72) 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?)
- Diophantine triples and \(k\)-generalized Fibonacci sequences
- 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 conjecture about repdigits in \(k\)-generalized Fibonacci sequences
- Lucas Diophantine Triples
- Fibonacci Diophantine triples
- Diophantine quadruples with values in k-generalized Fibonacci numbers
- Only finitely many Tribonacci Diophantine triples exist
- Powers of two as sums of two k-Fibonacci numbers
- A simplified Binet formula for k-generalized Fibonacci numbers
- Diophantine triples and reduced quadruples with the Lucas sequence of recurrence un=Aun-1-un-2
- The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
This page was built for publication: On \(k\)-generalized Fibonacci Diophantine triples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621967)