Abstract
Let B be a nonzero integer. Let define the sequence of polynomials Gn(x) by G0(x) = 0, G1(x) = 1, Gn+1(x) = xGn(x) +BGn−1(x), n ∈ N. We prove that the diophantine equation Gm(x) = Gn(y) for m,n ≥ 3, m 6= n has only finitely many solutions.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
