Let Gn be a linear recursive sequence of integers and P(y) be a polynomial with integer coefficients. In this paper we are given a survey on results on the solutions of diophantine equation Gn = P(y). We prove especially that if Gn is of order three such that its characteristic polynomial is irreducible and has a dominating root then there are only finitely many perfect powers in Gn.
|Number of pages||16|
|Journal||Acta Mathematica Academiae Paedagogicae Nyiregyhaziensis|
|Publication status||Published - Dec 1 2001|
- Linear forms in logarithms of algebraic numbers, subspace theorem
- Linear recursive sequence, characteristic polynomial
ASJC Scopus subject areas