On the nonnegative integer solutions to the equation F_n F_m = y^a
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}.
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Diophantine equations with power sums and universal Hilbert sets
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- Fibonacci numbers at most one away from a perfect power
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- Nonnegative integer solutions of the equation \(F_{n}-F_{m}=5^{a}\)
- On Diophantine quadruples of Fibonacci numbers
- On perfect powers that are sums of two Fibonacci numbers
- On solutions of the Diophantine equation F_n-F_m=3a
- On the Diophantine equation F_n + F_m=2a
- On the Diophantine equation \(F_n - F_m=2^a\)
- Perfect powers from products of terms in Lucas sequences
- Polynomial-exponential equations involving multi-recurrences
- Shifted powers in Lucas-Lehmer sequences
- On the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m^y\)
- scientific article; zbMATH DE number 998228 (Why is no real title available?)
- ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a
- On the nonnegative integer solutions of the equation Fn ± Fm = ya
- Nonnegative integer solutions of the equation \(F_{n}-F_{m}=5^{a}\)
- Mersenne numbers as a difference of two Lucas numbers
- Sums of Fibonacci numbers that are perfect powers
- On perfect powers as sums or differences of two k-generalised Pell numbers
- On the Diophantine equation \(F_n^2+F_m^2=2^{\alpha}\)
- On the equation F_n-F_m=F_t^a
- On the solutions of the Diophantine equation \(F_{n_1} + F_{n_2} + F_{n_3} + F_{n_4} = 11^a\)
- Powers as Fibonacci sums
- On the resolution of the Diophantine equation U_n + U_m = x^q
- Representing an integer and its powers in two unrelated number systems
- On the solutions of the Diophantine equation F_n F_m=3s y^b
This page was built for publication: On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212657)
