Multiplicative dependence between \(k\)-Fibonacci and \(k\)-Lucas numbers (Q2221018): Difference between revisions

The \(k\)th generalized Fibonacci \(F_n^{(k)}\) and \(k\)th generalized Lucas \(L_n^{(k)}\) numbers in the title are defined via \(k\)th order linear recursion: \(u_n^{(k)}= u_{n-1}^{(k)}+\dots+u_{n-k}^{(k)}\) for \(n\ge k\) with initial conditions \(u_{-(k-2)}^{(k)}=\dots=u_{-1}^{(k)}=0\) and \((u_0^{(k)},u_1^{(k)})=(0,1)\) in the case of Fibonacci numbers or \((u_0^{(k)},u_1^{(k)})=(2,1)\) in the case of Lucas ones, respectively. The authors give all the pairs of \(k\)-Fibonacci and \(k\)-Lucas numbers which are multiplicatively dependent, more precisely they list all the triples \((k,n,m)\) for which the Diophantine equation \(\left(F_n^{(k)}\right)^x=\left(L_m^{(k)}\right)^y\) is solvable with \(k\ge 2\), \(n\ge1\), \(m\ge0\) and \(x,y\) positive integers. The related equation \(\left(F_n^{(k)}\right)^x=\left(F_m^{(k)}\right)^y\) is solved in \textit{C. A. Gómez Ruiz} and \textit{F. Luca} [Lith. Math. J. 56, No. 4, 503--517 (2016; Zbl 1355.11010)].