A Diophantine Equation With Powers of Three Consecutive k-Fibonacci Numbers
From MaRDI portal
A Diophantine Equation With Powers of Three Consecutive $$k-$$Fibonacci Numbers
Recommendations
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- A Diophantine equation related to the sum of powers of two consecutive generalized Fibonacci numbers
- Terms of generalized Fibonacci sequences that are powers of their orders
- The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
- A Diophantine equation related to the sum of squares of consecutive k-generalized Fibonacci numbers
Cites work
- A simplified Binet formula for k-generalized Fibonacci numbers
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- Generalized Fibonacci Numbers and Associated Matrices
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- scientific article; zbMATH DE number 1175369 (Why is no real title available?)
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- scientific article; zbMATH DE number 1467843 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- Multiplicative independence in k-generalized Fibonacci sequences
- On a conjecture about repdigits in \(k\)-generalized Fibonacci sequences
- On Generalized Fibonacci Numbers
- On the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbers
- Powers of two as sums of two k-Fibonacci numbers
- Powers of two in generalized Fibonacci sequences
- Some identities for r-Fibonacci numbers
Cited in
(5)- \(k\)-Fibonacci numbers which are Padovan or Perrin numbers
- The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
- Diophantine equation with weighted k-Fibonacci numbers
- On k-generalized Fibonacci Diophantine triples
- A Pair of Diophantine Equations Involving the Fibonacci Numbers
This page was built for publication: A Diophantine Equation With Powers of Three Consecutive $$k-$$Fibonacci Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495895)
