BK Patel, AP Chaves - Mediterranean Journal of Mathematics, 2021 - Springer
Let (F n) n≥ 0 be the Fibonacci sequence given by F n+ 2= F n+ 1+ F n for n≥ 0, where F 0= 0 and F 1= 1. In this paper, we explicitly find all solutions of the title Diophantine equation …
BK Patel, WC Teh - Bulletin of the Malaysian Mathematical Sciences …, 2021 - Springer
An Exponential Diophantine Equation Related to Powers of Three Consecutive Fibonacci Numbers | Bulletin of the Malaysian Mathematical Sciences Society Skip to main content …
Let p be a prime number and let x, k> 1 be integers. We find all nonnegative integer solutions (n, m, x, p, k) to the Diophantine equations Fx n±Fx m= pk for 0≤ m< n, where Fn …
In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a …
Seja (fórmula) a sequência de Fibonacci dada por (fórmula) para (fórmula), onde (fórmula) e (fórmula). Existem várias identidades interessantes envolvendo os termos desta sequência …