The square terms in Lucas sequences (Q1914032): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jnth.1996.0068 / rank
Normal rank
 
Property / author
 
Property / author: Paulo Ribenboim / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Péter Kiss / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jnth.1996.0068 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968837781 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JNTH.1996.0068 / rank
 
Normal rank

Latest revision as of 12:46, 16 December 2024

scientific article
Language Label Description Also known as
English
The square terms in Lucas sequences
scientific article

    Statements

    The square terms in Lucas sequences (English)
    0 references
    0 references
    0 references
    9 July 1996
    0 references
    Let \(P\) and \(Q\) be relatively prime odd integers and define the sequences \(\{U_n\}\) and \(\{V_n\}\) by \(U_n = PU_{n - 1} - QU_{n - 2}\) with \(U_0 = 0\), \(U_1 = 1\) and \(V_n = PV_{n - 1} - QV_{n - 2}\) with \(V_0 = 2\), \(V_1 = P\). The main results of the paper are the following. (i) If \(V_n\) is a square, then \(n = 1,3\) or 5. (ii) If \(2V_n\) is a square, then \(n = 0,3\) or 6. (iii) If \(U_n\) is a square, then \(n = 0,1,2,3,6\) or 12. (iv) If \(2U_n\) is a square, then \(n = 0,3\) or 6. These results are nice extensions of some earlier ones concerning special (e.g. Fibonacci and Lucas) sequences.
    0 references
    square terms
    0 references
    Lucas sequence
    0 references
    recursive sequences
    0 references
    Fibonacci sequences
    0 references
    0 references

    Identifiers