Lucas sequence
From Wikipedia, the free encyclopedia
The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. |
In mathematics, a Lucas sequence is a particular generalisation of the Fibonacci numbers and Lucas numbers. Lucas sequences are named after French mathematician Edouard Lucas.
Contents |
[edit] Recurrence relations
Given two integer parameters P and Q which satisfy
the Lucas sequences U(P,Q) and V(P,Q) are defined by the recurrence relations
and
[edit] Algebraic relations
If the roots of the characteristic equation
are a and b with a > b or (a - b)/i > 0, then U(P,Q) and V(P,Q) can also be defined in terms of a and b by
from which we can derive the relations
(where the square root means its principal value).
Note that a and b are distinct because P2 − 4Q is not 0.
[edit] Other relations
The numbers in Lucas sequences satisfy relations that are generalisations of the relations between Fibonacci numbers and Lucas numbers. For example:
General | P=1, Q=-1 |
---|---|
Vn = Un + 1 − QUn − 1 | Vn = Un + 1 + Un − 1 |
U2n = UnVn | U2n = UnVn |
Un + m = UnUm + 1 − QUmUn − 1 | Un + m = UnUm + 1 + UmUn − 1 |
[edit] Specific names
The Lucas sequences for some values of P and Q have specific names:
- Un(1,−1) : Fibonacci numbers
- Vn(1,−1) : Lucas numbers
- Un(2,−1) : Pell numbers
- Un(1,−2) : Jacobsthal numbers
[edit] Applications
- LUC is a cryptosystem based on Lucas sequences.
[edit] References
- Ribenboim, Paulo (2000). My Numbers, My Friends: Popular Lectures on Number Theory. Springer-Verlag New York Inc.. ISBN 0-387-98911-0.