Lucas sequences whose nth term is a square or an almost square

From MaRDI portal



Abstract: (Below, Box means "perfect square") Let P and Q be non-zero integers. The Lucas sequence Un(P,Q) is defined by U0=0, U1=1, Un=PUn−1−QUn−2, (ngeq2). Historically, there has been much interest in when the terms of such sequences are perfect squares (or higher powers). Here, we summarize results on this problem, and investigate for fixed k solutions of Un(P,Q)=kBox, (P,Q)=1. We show finiteness of the number of solutions, and under certain hypotheses on n, describe explicit methods for finding solutions. These involve solving finitely many Thue-Mahler equations. As an illustration of the methods, we find all solutions to Un(P,Q)=kBox where k=pm1,pm2, and n is a power of 2.












This page was built for publication: Lucas sequences whose nth term is a square or an almost square

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