Lucas number
From Wikipedia, the free encyclopedia
The Lucas numbers are an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and the closely related Fibonacci numbers (both are Lucas sequences). Much like the Fibonacci numbers, each Lucas number is defined to be the sum of its two immediate previous terms. Consequently, the ratio between two consecutive Lucas numbers converges to the golden ratio.
However, the first two Lucas numbers are L0 = 2 and L1 = 1 instead of 0 and 1, and the properties of Lucas numbers are therefore somewhat different from those of Fibonacci numbers.
A Lucas number may thus be defined as follows:
The sequence of Lucas numbers begins:
Contents |
[edit] Extension to negative integers
Using Ln-2 = Ln - Ln-1, one can extend the Lucas numbers to negative integers. So we get: ... -11, 7, -4, 3, -1, 2, 1, 3, 4, 7, 11, ... .
[edit] Relationship to Fibonacci numbers
The Lucas numbers are related to the Fibonacci numbers by the identities
Their closed formula is given as:
where 
is the Golden ratio.
Also:
As 
approaches infinity 
approaches 
[edit] Congruence Relation
Ln is congruent to 1 mod n if n is prime, but some composite values of n also have this property.
[edit] Lucas primes
A Lucas prime is a Lucas number that is prime. The first few Lucas primes are
2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, 9349, ... (sequence A005479 in OEIS)
Except for the cases n = 0, 4, 8, 16, if Ln is prime then n is prime. The converse is false, however.
See also Fibonacci prime.
