Integers represented by Lucas sequences

From MaRDI portal





For integers \(A,B\), the sequence \(U=\{U_n\}_{n=0}^{\infty}\) with \(U_0=0\), \(U_1=1\) satisfying the binary recurrence relation\N\[ \NU_n=AU_{n-1} - BU_{n-2}\qquad (n\ge 2),\N\] \Nis called a Lucas sequence. In the paper under review, the authors study the sets of integers which are \(n\)-th terms of Lucas sequences. They establish lower- and upper bounds for the size of these sets. These bounds are sharp for sufficiently large \(n\). Furthermore, they also develop bounds on the growth order of the terms of Lucas sequences that are independent of the parameters of the sequence, which is a new feature.\N\NTo prove their main results, the authors use a clever combination of techniques in number theory, the usual properties of Lucas sequences, and the theory of lower bounds for linear forms in logarithms of algebraic numbers.



Cites work









This page was built for publication: Integers represented by Lucas sequences

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