On perfect powers that are sums of two Fibonacci numbers (Q1748132)

First an interesting but short excursion to the origin of the Fibonacci numbers is made, stating ``that heir first known occurrence dates back to around 700 AD, in the work of Virahaṅka. \dots The sequence is discussed rigorously in the work of Jain scholar Acharya Hemachandra (c. 1150, living in what is known today as Gujarat) about 50 years earlier than Fibonacci's Liber Abaci (1202).'' Then the authors prove the following theorem: All solutions of the Diophantine equation \[ F_n \pm F_m 0 y^p,\quad p\ge 2 \tag{\(\ast\)}\] in integers \((n,m, y, p)\) with \(n\equiv m\pmod 2\) either have \(\max\{|n|, |m|\} \le 36\), or \(y = 0\) and \(|n| = |m|\). Finally a complete list of solutions to equation (2) with \(\max{|n|, |m|} \le 1000\) without the parity restriction is given. It is still an open problem to find all solutions to equation \((\ast)\) in the case \(n\not\equiv m\pmod 2\).