arXiv:1706.10294 [math.NT]AbstractReferencesReviewsResources
On perfect powers that are sums of two Fibonacci numbers
Published 2017-06-30Version 1
We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.
Related articles: Most relevant | Search more
arXiv:2204.08455 [math.NT] (Published 2022-04-18)
On perfect powers that are sum of two balancing numbers
arXiv:2104.04808 [math.NT] (Published 2021-04-10)
Sums of $S$-units and perfect powers in recurrence sequences
arXiv:2103.14487 [math.NT] (Published 2021-03-26)
Sums of Fibonacci numbers that are perfect powers