On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\) (Q2212657)

Let \( \{F_n\}_{n\ge 0} \) be the sequence of \textit{Fibonacci numbers} defined by the linear recursive relation as \( F_0=0 \), \( F_1=1 \), and \( F_n = F_{n-1}+F_{n-2} \) for all \( n\ge 2 \). In the paper under review, the authors consider the Diophantine equation: \begin{align*} F_n \pm F_m =y^{a}, \quad \text{where} ~ n\ge m\ge 0, ~ y\ge 2, ~ a\ge 2. \tag{1}\end{align*} Their main results are two-fold: Theorem 2 For a fixed integer \( y\ge 2 \), any solution in nonnegative integers \( (n,m,a) \) of the Diophantine equation (1) satisfies \( a<n<6\times 10^{29}(\log y)^4 \). Theorem 3. Assume that the \( abc \)-conjecture holds. Then the Diophantine equation (1) has only finitely many nonnegative integer solutions \( (n,m,y,a) \) with \( n\ge m \), \( y\ge 2 \), and \( a\ge 2 \). The proofs of Theorem 2 and Theorem 3 follow from a clever combination of techniques in number theory, the usual properties of the Fibonacci sequences, the theory of nonzero linear forms in logarithms of algebraic numbers ``à la Baker'', the Subspace Theorem, and the \( abc \)-conjecture. Furthermore, as a corollary to Theorem 2, the authors prove a numerical result. The proof of this numerical corollary involves the application of a reduction procedure that involves the theory of continued fractions. All computations are done with the aid of a computer program in \texttt{Mathematica}.