On Fibonacci numbers as sum of powers of two consecutive tribonacci numbers (Q2670724)

Let \( k\ge 2 \) be a fixed integer. The sequence \( (F_n^{(k)})_{n\ge -(k-2)} \) of \(k\)-generalized Fibonacci numbers is defined by the linear recurrence: \[ F_n^{(k)}=F_{n-1}^{(k)}+\cdots+ F_{n-k}^{(k)}\text{ for all } n\ge 2-k, \] with the initial conditions \( F^{(k)}_{-(k-2)}=F^{(k)}_{-(k-3)} =\cdots = F^{(k)}_{0}=0\) and \( F^{(k)}_{1}=1 \). When \( k=2 \), this sequence coincides with the classical Fibonacci sequence. When \( k=3 \), it coincides with the Tribonacci sequence. And so on. In the paper under review, the authors further study the Diophantine equation: \[ (F_n^{(k)})^{s}+(F_{n+1}^{(k)})^{s}=F_m^{(\ell)},\tag{1} \] for \( \min\{n,m,s\}\ge 2 \), with signature \( (k, \ell, s) \). This research is a continuation of the research of \textit{D. Bednařík} et al. in [Colloq. Math. 156, No. 1, 153--164 (2019; Zbl 1452.11021)]. The main result of the authors in this paper is the following. Theorem 1. The only solution of the Diophantine equation (1) for the signature \( (3,2,s) \) is \( (n,m,s)=(2,5,2) \). Furthermore, the authors conjecture that all the solutions of the Diophantine equation (1) for the signature \( (k, \ell,s) \), with \( k\ne \ell \) are: \( (n,m,k,\ell,s)=(3,6,2,3,2) \) or \( (n,m,k,\ell,s)\in \{(2,5,k,2,2):k\ge 3\} \). There is numerical evidence via a \texttt{Mathematica} routine to support this conjecture in the ranges \( \max\{n,m\}<10^{8} \) and \( \max\{k, \ell,s\}<10^{4} \). To prove Theorem 1, the authors use a clever combination of techniques in Diophantine number theory, the usual properties of the \( k \)-generalized Fibonacci sequence, Baker's theory of nonzero linear forms in logarithms of algebraic numbers, as well as reduction techniques involving the theory of continued fractions plus the LLL-algorithm. All computations are done with the aid of a computer program in \texttt{Mathematica}.