On the sum of powers of two consecutive Fibonacci numbers
From MaRDI portal
Let \(F_n\) be the Fibonacci numbers, \(s\) a positive integer. The authors prove that if \(F_n^s+F_{n+1}^s \) is a Fibonacci number for all suficiently large \(n\), then \(s=1\) or \(2\).
Recommendations
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- On the sum of powers of terms of a linear recurrence sequence
- ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
- On perfect powers that are sums of two Fibonacci numbers
- On a powerful relation between Fibonacci and Lucas numbers
Cites work
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Linear forms in two logarithms and interpolation determinants II
- Perfect powers among Fibonomial coefficients
- The (fabulous) Fibonacci numbers. With an afterword by Herbert A. Hauptman
- The Fibonacci Numbers: Exposed
Cited in
(36)- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- On perfect powers that are sums of two Fibonacci numbers
- On the sum of powers of terms of a linear recurrence sequence
- On a Diophantine equation involving powers of Fibonacci numbers
- An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)
- An exponential Diophantine equation related to the sum of powers of two consecutive terms of a Lucas sequence and \(x\)-coordinates of Pell equations
- An exponential Diophantine equation involving the sum or difference of powers of two Pell numbers
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
- On the equation \(\sum_{j = 1}^k j F_j^p = F_n^q\)
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- Prime powers in sums of terms of binary recurrence sequences
- A Diophantine equation related to the sum of powers of two consecutive generalized Fibonacci numbers
- On Fibonacci numbers as sum of powers of two consecutive tribonacci numbers
- On a powerful relation between Fibonacci and Lucas numbers
- Terms of generalized Fibonacci sequences that are powers of their orders
- scientific article; zbMATH DE number 2020848 (Why is no real title available?)
- PERFECT POWERS THAT ARE SUMS OF TWO POWERS OF FIBONACCI NUMBERS
- Fibonacci numbers that are not sums of two prime powers
- On the Diophantine equation \(\sum_{j=1}^kjF_j^p=F_n^q\).
- Extension of an inequality for Fibonacci numbers
- scientific article; zbMATH DE number 7640090 (Why is no real title available?)
- Sums of powers over equally spaced Fibonacci numbers
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- On Fibonacci powers
- The square sum character of Fibonacci numbers with Yang Hui triangle's row being coefficient
- On the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbers
- On the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}
- The Diophantine equations \(P_n^x+P_{n+1}^y=P_m^x\) or \(P_n^y+P_{n+1}^x=P_m^x\)
- Sums of Fibonacci numbers that are perfect powers
- On sums of two Fibonacci numbers that are powers of numbers with limited Hamming weight
- Linear combinations of prime powers in sums of terms of binary recurrence sequences
- An exponential Diophantine equation with generalized Pell numbers
- On the exponential Diophantine equation P_m^2+ P_n^2= 2a
- On the Diophantine equation F_n^x + F_k^x = F_m^y
- On the Diophantine equation (an)^x + (bn)^y = (cn)^z
This page was built for publication: On the sum of powers of two consecutive Fibonacci numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632997)
