Jump to content

Lucas sequence

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 217.233.244.103 (talk) at 07:42, 19 October 2004 (+de:). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics a Lucas sequence is a generalisation of the Fibonacci numbers and Lucas numbers. Lucas sequences were first studied by French mathematician Edouard Lucas.

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

Algebraic relations

If the roots of the characteristic equation

are a and b 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

Other relations

The numbers in Lucas sequences satisfy relations that are analogues of the relations between Fibonacci numbers and Lucas numbers. For example :-

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