Near squares in linear recurrence sequences
The author considers a class of binary linear recurrences of the form \(U_0= 0\), \(U_1= 1\), \(U_n= 2TU_{n-1}- U_{n-2}\) for \(n\geq 2\), where the integer \(T> 1\). Let \(\{P_n\}\), \(\{Q_n\}\) denote the Pell and associated Pell sequences respectively, that is, \(P_0= 0\), \(P_1= Q_0= Q_1= 1\) and both sequences satisfy the recurrence: \(w_n= 2w_{n-1}+ w_{n-2}\) for \(n\geq 2\). (The reader should note that the reviewer's notation for the two Pell sequences differs from the author's.) The author proves the following two results: (1) If \(T= P_{2i+1}\) for some \(i\geq 1\), then the equation \(U_n= 2x^2\pm 1\) has precisely two solutions in positive integers, namely \((n,x)= (1,1)\), \((3,Q_{2i+1})\). (2) If \(T\neq P_{2i+1}\) and \(c\) is even, then the equation \(U_n= cx^2\pm 1\) has at most one solution in positive integers \((n, x)\), and if such a solution exists, then necessarily \(n< c\).
- On \(Y\)-coordinates of Pell equations which are members of a fixed binary recurrence
- Recurrence relations for the squares of the Horadam numbers and some associated consequences
- scientific article; zbMATH DE number 1182976 (Why is no real title available?)
- scientific article; zbMATH DE number 1336409 (Why is no real title available?)
- Terms of recurrence sequences in the solution sets of generalized Pell equations
- On Pillai’s problem with X-coordinates of Pell equations and powers of 2 II
- Near-squares in binary recurrence sequences
This page was built for publication: Near squares in linear recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4463602)
