Near squares in linear recurrence sequences (Q4463602)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2069656
Language Label Description Also known as
default for all languages
No label defined
    English
    Near squares in linear recurrence sequences
    scientific article; zbMATH DE number 2069656

      Statements

      Near squares in linear recurrence sequences (English)
      0 references
      27 May 2004
      0 references
      linear recurrence
      0 references
      0 references
      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\).
      0 references

      Identifiers