Diophantine equations for second-order recursive sequences of polynomials

From MaRDI portal





Let \(G_n(X)\) be the sequence of generalized Fibonacci polynomials defined by NEWLINE\[NEWLINEG_0(X)=0, \quad G_1(X)=1, \quad G_{n+1}(X)= xG_n(X)+ BG_{n-1}(X), \quad n\in \mathbb{N},NEWLINE\]NEWLINE where \(B\) is a nonzero integer. In this paper the authors, using a finiteness criterion [\textit{Y. Bilu} and \textit{R. Tichy}, Acta Arith. 95, 261-288 (2000; Zbl 0958.11049)], prove that the equation \(G_n(X)= G_m(Y)\), where \(m,n\geq 3\) and \(m\neq n\), has only finitely many integer solutions. Furthermore, some effective results for the cases \(n=3,5\) are given.











This page was built for publication: Diophantine equations for second-order recursive sequences of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2730923)