Add to ORKGIn this paper, we find all solutions to the Diophantine equation $F_n+F_m=2^a(F_r+F_s)$, where ${F_k}_{kge 0}$ is the Fibonacci sequence. This paper continues and extends a previous work which investigated the powers of 2 which are sums of two Fibonacci numbers
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
The Fibonacci numbers are sequences of numbers of the form: 0,1,1,2,3,5,8,13,... Among n...
This paper deals with the diophantine equation F-1(p) + 2F(2)(p )+ . . . + kF(k)(p) = F-n(q), an equ...
International audienceLet $ \{F_{n}\}_{n\geq 0} $ be the sequence of Fibonacci numbers defined by $...
The $k-$generalized Fibonacci sequence $\big(F_{n}^{(k)}\big)_{n}$ resembles the Fibonacci sequence ...
Let $\sigma_k(n)$ be the sum of the $k$th powers of the divisors of $n$. Here, we prove that if $(F_...
In this paper, we find all the solutions of the title Diophantine equation in positive integer varia...
Let $\sigma_k(n)$ be the sum of the $k$th powers of the divisors of $n$. Here, we prove that if $(F_...
A generalization of the well-known Fibonacci sequence is the k-generalized Fibonacci sequence (F_n^{...
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $k$-generalized Fibonacci se...
For an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $k$--generalized Fibonacci sequence...
The original solution of Problem B-1166 in the problem section of this journal. It was acquired to p...
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
© 2014 Walter de Gruyter GmbH, Berlin/Boston. In this paper we find closed forms for certain finite ...
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
The Fibonacci numbers are sequences of numbers of the form: 0,1,1,2,3,5,8,13,... Among n...
This paper deals with the diophantine equation F-1(p) + 2F(2)(p )+ . . . + kF(k)(p) = F-n(q), an equ...
International audienceLet $ \{F_{n}\}_{n\geq 0} $ be the sequence of Fibonacci numbers defined by $...
The $k-$generalized Fibonacci sequence $\big(F_{n}^{(k)}\big)_{n}$ resembles the Fibonacci sequence ...
Let $\sigma_k(n)$ be the sum of the $k$th powers of the divisors of $n$. Here, we prove that if $(F_...
In this paper, we find all the solutions of the title Diophantine equation in positive integer varia...
Let $\sigma_k(n)$ be the sum of the $k$th powers of the divisors of $n$. Here, we prove that if $(F_...
A generalization of the well-known Fibonacci sequence is the k-generalized Fibonacci sequence (F_n^{...
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $k$-generalized Fibonacci se...
For an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $k$--generalized Fibonacci sequence...
The original solution of Problem B-1166 in the problem section of this journal. It was acquired to p...
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
© 2014 Walter de Gruyter GmbH, Berlin/Boston. In this paper we find closed forms for certain finite ...
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci seq...
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
The Fibonacci numbers are sequences of numbers of the form: 0,1,1,2,3,5,8,13,... Among n...
This paper deals with the diophantine equation F-1(p) + 2F(2)(p )+ . . . + kF(k)(p) = F-n(q), an equ...