Lucas number

The Lucas sequence is an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and the closely related Fibonacci sequence. Individual numbers in the Lucas sequence are known as Lucas numbers. Lucas numbers and Fibonacci numbers form complementary instances of Lucas sequences.

The Lucas sequence has the same recursive relationship as the Fibonacci sequence, where each term is the sum of the two previous terms, but with different starting values. This produces a sequence where the ratios of successive terms approach the golden ratio, and in fact the terms themselves are roundings of integer powers of the golden ratio. The sequence also has a variety of relationships with the Fibonacci numbers, like the fact that adding any two Fibonacci numbers two terms apart in the Fibonacci sequence results in the Lucas number in between.

The first few Lucas numbers are
: 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, ... .

which coincides for example with the number of independent vertex sets for cyclic graphs $C_n$ of length $n\geq2$.

Definition

As with the Fibonacci numbers, each Lucas number is defined to be the sum of its two immediately previous terms, thereby forming a Fibonacci integer sequence. The first two Lucas numbers are $L_0=2$ and $L_1=1$, which differs from the first two Fibonacci numbers $F_0=0$ and $F_1=1$. Though closely related in definition, Lucas and Fibonacci numbers exhibit distinct properties.

The Lucas numbers may thus be defined as follows:
:$L_n := \begin 2 & \text n = 0; \\ 1 & \text n = 1; \\ L_+L_ & \text n > 1. \end$
(where ''n'' belongs to the natural numbers)

All Fibonacci-like integer sequences appear in shifted form as a row of the Wythoff array; the Fibonacci sequence itself is the first row and the Lucas sequence is the second row. Also like all Fibonacci-like integer sequences, the ratio between two consecutive Lucas numbers converges to the golden ratio.

Extension to negative integers

Using $L_=L_-L_$, one can extend the Lucas numbers to negative integers to obtain a doubly infinite sequence:
:..., −11, 7, −4, 3, −1, 2, 1, 3, 4, 7, 11, ... (terms $L_n$ for $-5\leqn\leq5$ are shown).
The formula for terms with negative indices in this sequence is
: $L_=(-1)^nL_n.\!$

Relationship to Fibonacci numbers

The Lucas numbers are related to the Fibonacci numbers by many identities. Among these are the following:
* $L_n = F_+F_ = 2F_-F_n$
* $L_ = L_F_+L_mF_$
* $F_ = L_n F_n$
* $F_ + (-1)^k F_ = L_k F_n$
* $2F_ = L_ F_ + L_ F_$
* $L_ = 5 F_n^2 + 2(-1)^n = L_n^2 - 2(-1)^n$, so $\lim_ \frac=\sqrt$.
* $\vert L_n - \sqrt F_n \vert = \frac \to 0$
* $L_ - (-1)^k L_ = 5 F_n F_k$; in particular, $F_n =$, so $5F_n + L_n = 2L_$.

Their closed formula is given as:
:$L_n = \varphi^n + (1-\varphi)^ = \varphi^n + (- \varphi)^=\left(\right)^n + \left(\right)^n\, ,$

where $\varphi$ is the golden ratio. Alternatively, as for $n>1$ the magnitude of the term $(-\varphi)^$ is less than 1/2, $L_n$ is the closest integer to $\varphi^n$ or, equivalently, the integer part of $\varphi^n+1/2$, also written as $\lfloor \varphi^n+1/2 \rfloor$.

Combining the above with Binet's formula,

:$F_n = \frac\, ,$

a formula for $\varphi^n$ is obtained:

:$\varphi^n = \, .$

For integers ''n'' ≥ 2, we also get:

:$\varphi^n = L_n - (- \varphi)^ = L_n - (-1)^n L_n^ - L_n^ + R$

with remainder ''R'' satisfying

:$\vert R \vert < 3 L_n^$.

Lucas identities

Many of the Fibonacci identities have parallels in Lucas numbers. For example, the Cassini identity becomes

:$L_n^2 - L_L_ = (-1)^5$

Also

:$\sum_^n L_k = L_ - 1$

:$\sum_^n L_k^2 = L_nL_ + 2$

:$2L_^2 + L_n^2 = L_ + 5F_^2$

where $\textstyle F_n=\frac$.

:$L_n^k = \sum_^ (-1)^ \binom L'_$

where $L'_n=L_n$ except for $L'_0=1$.

For example if ''n'' is odd, $L_n^3 = L'_-3L'_n$ and $L_n^4 = L'_-4L'_+6L'_0$

Checking, $L_3=4, 4^3=64=76-3(4)$, and $256=322-4(18)+6$

Generating function

Let

:$\Phi(x) = 2 + x + 3x^2 + 4x^3 + \cdots = \sum_^\infty L_nx^n$

be the generating function of the Lucas numbers. By a direct computation,

:$\begin \Phi(x) &= L_0 + L_1x + \sum_^\infty L_nx^n \\ &= 2 + x + \sum_^\infty (L_ + L_)x^n \\ &= 2 + x + \sum_^\infty L_nx^ + \sum_^\infty L_nx^ \\ &= 2 + x + x(\Phi(x) - 2) + x^2 \Phi(x) \end$

which can be rearranged as

:$\Phi(x) = \frac$

$\Phi\!\left(-\frac\right)$ gives the generating function for the negative indexed Lucas numbers, $\sum_^\infty (-1)^nL_nx^ = \sum_^\infty L_x^$, and

:$\Phi\!\left(-\frac\right) = \frac$

$\Phi(x)$ satisfies the functional equation

:$\Phi(x) - \Phi\!\left(-\frac\right) = 2$

As the generating function for the Fibonacci numbers is given by

:$s(x) = \frac$

we have

:$s(x) + \Phi(x) = \frac$

which proves that

:$F_n + L_n = 2F_,$

and

:$5s(x) + \Phi(x) = \frac2x\Phi(-\frac1x) = 2\frac + 4\frac$

proves that

:$5F_n + L_n = 2L_$

The partial fraction decomposition is given by

:$\Phi(x) = \frac + \frac$

where $\phi = \frac$ is the golden ratio and $\psi = \frac$ is its conjugate.

This can be used to prove the generating function, as

:$\sum_^\infty L_nx^n = \sum_^\infty (\phi^n + \psi^n)x^n = \sum_^\infty \phi^nx^n + \sum_^\infty \psi^nx^n = \frac + \frac = \Phi(x)$

Congruence relations

If $F_n\geq 5$ is a Fibonacci number then no Lucas number is divisible by $F_n$.

The Lucas numbers satisfy Gauss congruence. This implies that $L_n$ is congruent to 1 modulo $n$ if $n$ is prime. The composite values of $n$ which satisfy this property are known as Fibonacci pseudoprimes.

$L_n-L_$ is congruent to 0 modulo 5.

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, 3010349, 54018521, 370248451, 6643838879, ... .

The indices of these primes are (for example, ''L''₄ = 7)
:0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, 37, 41, 47, 53, 61, 71, 79, 113, 313, 353, 503, 613, 617, 863, 1097, 1361, 4787, 4793, 5851, 7741, 8467, ... .
, the largest confirmed Lucas prime is ''L''₁₄₈₀₉₁, which has 30950 decimal digits. , the largest known Lucas probable prime is ''L''_5466311, with 1,142,392 decimal digits.

If ''L_n'' is prime then ''n'' is 0, prime, or a power of 2. ''L''_2^''m'' is prime for ''m'' = 1, 2, 3, and 4 and no other known values of ''m''.

Lucas polynomials

In the same way as Fibonacci polynomials are derived from the Fibonacci numbers, the Lucas polynomials $L_(x)$ are a polynomial sequence derived from the Lucas numbers.

Continued fractions for powers of the golden ratio

Close rational approximations for powers of the golden ratio can be obtained from their continued fractions.

For positive integers ''n'', the continued fractions are:
: \varphi^ = _; L_, L_, L_, \ldots
: \varphi^ = _-1; 1, L_-2, 1, L_-2, 1, L_-2, 1, \ldots.

For example:
: \varphi^5 = 1; 11, 11, 11, \ldots
is the limit of
:$\frac, \frac, \frac, \frac, \ldots$
with the error in each term being about 1% of the error in the previous term; and
: \varphi^6 = 8 - 1; 1, 18 - 2, 1, 18 - 2, 1, 18 - 2, 1, \ldots= 7; 1, 16, 1, 16, 1, 16, 1, \ldots
is the limit of
:$\frac, \frac, \frac, \frac, \frac, \frac, \frac, \frac, \ldots$
with the error in each term being about 0.3% that of the ''second'' previous term.

Applications

Lucas numbers are the second most common pattern in sunflowers after Fibonacci numbers, when clockwise and counter-clockwise spirals are counted, according to an analysis of 657 sunflowers in 2016.

See also

* Generalizations of Fibonacci numbers

References

External links

*
*
*
*
The Lucas Numbers
, Dr Ron Knott



A Lucas Number Calculator can be found here.
*

{{series (mathematics)

Eponymous numbers in mathematics
Integer sequences
Fibonacci numbers
Recurrence relations
Unsolved problems in mathematics

bn:লুকাস ধারা
fr:Suite de Lucas
he:סדרת לוקאס
pt:Sequência de Lucas