Abstract
LetPn(x) � n≥0 be a sequence of polynomials obeying a linear second order recurrence Pn+1(x )= xPn(x )+ cnPn−1(x), n ≥ 0, with rational parameters cn .W e give sufficient conditions depending on the parameters cn under which the Diophan- tine equation Pn(x )= Pm(y) has at most finitely many integer solutions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
