On the sum of powers of two consecutive Fibonacci numbers

From MaRDI portal
Publication:632997

DOI10.3792/pjaa.86.174zbMath1222.11024OpenAlexW2048623400MaRDI QIDQ632997

Diego Marques, Alain S. Togbé

Publication date: 29 March 2011

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.86.174




Related Items (20)

An exponential Diophantine equation involving the sum or difference of powers of two Pell numbersTerms of generalized Fibonacci sequences that are powers of their ordersOn the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)On the sum of powers of terms of a linear recurrence sequenceThe Diophantine equations \(P_n^x+P_{n+1}^y=P_m^x\) or \(P_n^y+P_{n+1}^x=P_m^x\)Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)On the equation \(\sum_{j = 1}^k j F_j^p = F_n^q\)On a Diophantine equation involving powers of Fibonacci numbersLinear combinations of prime powers in sums of terms of binary recurrence sequencesUnnamed ItemOn the sum of squares of consecutive $k$-bonacci numbers which are $l$-bonacci numbersAn exponential Diophantine equation related to powers of three consecutive Fibonacci numbersAn exponential Diophantine equation related to powers of two consecutive Fibonacci numbersOn the Diophantine equation $\sum _{j=1}^kjF_j^p=F_n^q$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 equationsOn the exponential Diophantine equation Pxn+Pxn+1=PmPrime powers in sums of terms of binary recurrence sequencesA Diophantine equation related to the sum of powers of two consecutive generalized Fibonacci numbersOn the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}



Cites Work


This page was built for publication: On the sum of powers of two consecutive Fibonacci numbers