Answers are grounded in this paper and cite their sources.
Let K K be a field of characteristic 0 0 and let ( G n ( x ) ) n = 0 β (Gβ(x))ββββ be a linear recurring sequence of degree d d in K [ x ] K[x] defined by the initial terms G 0 , β¦ , G d β 1 β K [ x ] G_0,β¦ ,Gd-1β K[x] and by the difference equation \[ G n + d ( x ) = A d β 1 ( x ) G n + d β 1 ( x ) + β― + A 0 ( x ) G n ( x ) , for n β₯ 0 , Gn+d(x)=Ad-1(x)Gn+d-1(x)+β― +A_0(x)Gβ(x), for \,\, nβ₯ 0, \] with A 0 , β¦ , A d β 1 β K [ x ] A_0,β¦ ,Ad-1β K[x] . Finally, let P ( x ) P(x) be an element of K [ x ] K[x] . In this paper we are giving fairly general conditions depending only on G 0 , β¦ , G d β 1 , G_0,β¦ ,Gd-1, on P P , and on A 0 , β¦ , A d β 1 A_0,β¦ ,Ad-1 under which the Diophantine equation \[ G n ( x ) = G m ( P ( x ) ) Gβ(x)=Gβ(P(x)) \] has only finitely many solutions ( n , m ) β Z 2 , n , m β₯ 0 (n,m)β ZΒ²,n,mβ₯ 0 . Moreover, we are giving an upper bound for the number of solutions, which depends only on d d . This paper is a continuation of the work of the authors on this equation in the case of second-order linear recurring sequences.
No takes yet. Share an insight, caveat, or question.
Fuchs et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: