Squares in Lucas sequenceshaving an even first parameter (Q4236804)
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 1270178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Squares in Lucas sequenceshaving an even first parameter |
scientific article; zbMATH DE number 1270178 |
Statements
Squares in Lucas sequenceshaving an even first parameter (English)
0 references
28 March 1999
0 references
Lucas sequences
0 references
recursive sequences
0 references
perfect squares
0 references
0 references
0 references
0.93845516
0 references
0 references
0.9285863
0 references
0.9273586
0 references
Let \(P\) and \(Q\) be non-zero relatively prime integers and let \(U_n\) be a sequence of integers defined by \(U_n= PU_{n-1}- QU_{n-2}\) with \(U_0=0\), \(U_1=1\). The following main theorem is proved in the paper. ``Let \(n>0\). If \(P\) is even, \(Q\equiv 1\pmod 4\) and \(U_n\) is a perfect square, then \(n\) is a square or twice an odd square and all prime factors of \(n\) divide \(P^2- 4Q\) if \(p^t>2\) is a prime divisor of \(n\) and \(1\leq u\leq t\), then \(U_{p^u}\) is a square if \(u\) is even and \(U_{p^u}\) is of the form \(pq^2\) if \(u\) is odd. If \(n\) is even, then \(U_n\) is a square only if, in addition, \(P\) is a square or twice a square.'' Some other similar results are also proved.
0 references