Abstract
Some Identities Involving the Generalized Lucas Numbers
Highlights
In the theory of numbers, the Fibonacci sequence has been always fertile ground for the mathematicians
There are several ways in which it has been generalized. One of these ways is by preserving the initial conditions and changing the recurrence relation
{ } generalizations of the Lucas sequence is the class of sequences
Summary
In the theory of numbers, the Fibonacci sequence has been always fertile ground for the mathematicians. The terms of the sequence of Lucas numbers {Ln } can be obtained by L0 = 2, L1 =1 and the recurrence relation Ln = Ln−1 + Ln−2 ; for n ≥ 2 . One of these ways is by preserving the initial conditions and changing the recurrence relation. Whereas one more way is to preserve the recurrence relation and alternate the initial conditions.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Journal of Interdisciplinary Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
