The Diophantine equation _j=1ᵏ jF_j^p=L_n^q
From MaRDI portal
Publication:5088682
Recommendations
- On the Diophantine equation \(\sum_{j=1}^kjF_j^p=F_n^q\).
- On the exponential Diophantine equation \(F_n^x+F_{n+1}^x+\cdots+F_{n+k-1}^x=F_m\)
- Balancing with Fibonacci powers
- On a Diophantine equation involving powers of Fibonacci numbers
- The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
Cites work
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- scientific article; zbMATH DE number 17619 (Why is no real title available?)
- Lucas balancing numbers
- On a Diophantine equation involving powers of Fibonacci numbers
- On the diophantine equation ${n \choose k} = x^l$
- On the Diophantine equation \(\sum_{j=1}^kjF_j^p=F_n^q\).
- On the Diophantine equation \(\sum_{j=1}^kjP_j^p=P_n^q\)
- On the equation \(\sum_{j = 1}^k j F_j^p = F_n^q\)
Cited in
(11)- On a Diophantine equation involving powers of Fibonacci numbers
- On the equation \(\sum_{j = 1}^k j F_j^p = F_n^q\)
- On the Diophantine equation \(L_n=\binom{x}{5}\)
- Balancing with Fibonacci powers
- Integer solutions of some Diophantine equations via Fibonacci and Lucas numbers
- About a Diophantine equation
- On the Diophantine equation \(\sum_{j=1}^kjF_j^p=F_n^q\).
- A Diophantine equation involving \(C\)-nomial coefficients
- scientific article; zbMATH DE number 7523832 (Why is no real title available?)
- On the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}
- Extension of the equation \(\sum^k_{j=1} j F_j^p = F_n^p\) to a family of Lucas sequences
This page was built for publication: The Diophantine equation \(\sum_{j=1}^k jF_j^p=L_n^q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088682)
