Lucas sequence

Template:Short description Template:Distinguish

In mathematics, the Lucas sequences $U_{n} (P, Q)$ and $V_{n} (P, Q)$ are certain constant-recursive integer sequences that satisfy the recurrence relation

x_{n} = P \cdot x_{n - 1} - Q \cdot x_{n - 2}

where $P$ and $Q$ are fixed integers. Any sequence satisfying this recurrence relation can be represented as a linear combination of the Lucas sequences $U_{n} (P, Q)$ and $V_{n} (P, Q) .$

More generally, Lucas sequences $U_{n} (P, Q)$ and $V_{n} (P, Q)$ represent sequences of polynomials in $P$ and $Q$ with integer coefficients.

Famous examples of Lucas sequences include the Fibonacci numbers, Mersenne numbers, Pell numbers, Lucas numbers, Jacobsthal numbers, and a superset of Fermat numbers (see below). Lucas sequences are named after the French mathematician Édouard Lucas.

Recurrence relations

Given two integer parameters $P$ and $Q$ , the Lucas sequences of the first kind $U_{n} (P, Q)$ and of the second kind $V_{n} (P, Q)$ are defined by the recurrence relations:

\begin{matrix} U_{0} (P, Q) & = 0, \\ U_{1} (P, Q) & = 1, \\ U_{n} (P, Q) & = P \cdot U_{n - 1} (P, Q) - Q \cdot U_{n - 2} (P, Q) for n > 1, \end{matrix}

and

\begin{matrix} V_{0} (P, Q) & = 2, \\ V_{1} (P, Q) & = P, \\ V_{n} (P, Q) & = P \cdot V_{n - 1} (P, Q) - Q \cdot V_{n - 2} (P, Q) for n > 1 . \end{matrix}

It is not hard to show that for $n > 0$ ,

\begin{matrix} U_{n} (P, Q) & = \frac{P \cdot U_{n - 1} (P, Q) + V_{n - 1} (P, Q)}{2}, \\ V_{n} (P, Q) & = \frac{(P^{2} - 4 Q) \cdot U_{n - 1} (P, Q) + P \cdot V_{n - 1} (P, Q)}{2} . \end{matrix}

The above relations can be stated in matrix form as follows:

[\begin{matrix} U_{n} (P, Q) \\ U_{n + 1} (P, Q) \end{matrix}] = [\begin{matrix} 0 & 1 \\ - Q & P \end{matrix}] \cdot [\begin{matrix} U_{n - 1} (P, Q) \\ U_{n} (P, Q) \end{matrix}],

[\begin{matrix} V_{n} (P, Q) \\ V_{n + 1} (P, Q) \end{matrix}] = [\begin{matrix} 0 & 1 \\ - Q & P \end{matrix}] \cdot [\begin{matrix} V_{n - 1} (P, Q) \\ V_{n} (P, Q) \end{matrix}],

[\begin{matrix} U_{n} (P, Q) \\ V_{n} (P, Q) \end{matrix}] = [\begin{matrix} P / 2 & 1 / 2 \\ (P^{2} - 4 Q) / 2 & P / 2 \end{matrix}] \cdot [\begin{matrix} U_{n - 1} (P, Q) \\ V_{n - 1} (P, Q) \end{matrix}] .

Examples

Initial terms of Lucas sequences $U_{n} (P, Q)$ and $V_{n} (P, Q)$ are given in the table:

\begin{matrix} n & U_{n} (P, Q) & V_{n} (P, Q) \\ 0 & 0 & 2 \\ 1 & 1 & P \\ 2 & P & P^{2} - 2 Q \\ 3 & P^{2} - Q & P^{3} - 3 P Q \\ 4 & P^{3} - 2 P Q & P^{4} - 4 P^{2} Q + 2 Q^{2} \\ 5 & P^{4} - 3 P^{2} Q + Q^{2} & P^{5} - 5 P^{3} Q + 5 P Q^{2} \\ 6 & P^{5} - 4 P^{3} Q + 3 P Q^{2} & P^{6} - 6 P^{4} Q + 9 P^{2} Q^{2} - 2 Q^{3} \end{matrix}

Explicit expressions

The characteristic equation of the recurrence relation for Lucas sequences $U_{n} (P, Q)$ and $V_{n} (P, Q)$ is:

x^{2} - P x + Q = 0

It has the discriminant $D = P^{2} - 4 Q$ and the roots:

a = \frac{P + \sqrt{D}}{2} and b = \frac{P - \sqrt{D}}{2} .

Thus:

a + b = P,

a b = \frac{1}{4} (P^{2} - D) = Q,

a - b = \sqrt{D} .

Note that the sequence $a^{n}$ and the sequence $b^{n}$ also satisfy the recurrence relation. However these might not be integer sequences.

Distinct roots

When $D \neq 0$ , a and b are distinct and one quickly verifies that

a^{n} = \frac{V_{n} + U_{n} \sqrt{D}}{2}

b^{n} = \frac{V_{n} - U_{n} \sqrt{D}}{2} .

It follows that the terms of Lucas sequences can be expressed in terms of a and b as follows

U_{n} = \frac{a^{n} - b^{n}}{a - b} = \frac{a^{n} - b^{n}}{\sqrt{D}}

V_{n} = a^{n} + b^{n}

Repeated root

The case $D = 0$ occurs exactly when $P = 2 S and Q = S^{2}$ for some integer S so that $a = b = S$ . In this case one easily finds that

U_{n} (P, Q) = U_{n} (2 S, S^{2}) = n S^{n - 1}

V_{n} (P, Q) = V_{n} (2 S, S^{2}) = 2 S^{n} .

Properties

Generating functions

The ordinary generating functions are

\sum_{n \geq 0} U_{n} (P, Q) z^{n} = \frac{z}{1 - P z + Q z^{2}};

\sum_{n \geq 0} V_{n} (P, Q) z^{n} = \frac{2 - P z}{1 - P z + Q z^{2}} .

Pell equations

When $Q = \pm 1$ , the Lucas sequences $U_{n} (P, Q)$ and $V_{n} (P, Q)$ satisfy certain Pell equations:

V_{n} (P, 1)^{2} - D \cdot U_{n} (P, 1)^{2} = 4,

V_{n} (P, - 1)^{2} - D \cdot U_{n} (P, - 1)^{2} = 4 (- 1)^{n} .

Relations between sequences with different parameters

For any number c, the sequences $U_{n} (P^{'}, Q^{'})$ and $V_{n} (P^{'}, Q^{'})$ with

P^{'} = P + 2 c

Q^{'} = c P + Q + c^{2}

have the same discriminant as

U_{n} (P, Q)

and

V_{n} (P, Q)

:

P'^{2} - 4 Q^{'} = (P + 2 c)^{2} - 4 (c P + Q + c^{2}) = P^{2} - 4 Q = D .

For any number c, we also have

U_{n} (c P, c^{2} Q) = c^{n - 1} \cdot U_{n} (P, Q),

V_{n} (c P, c^{2} Q) = c^{n} \cdot V_{n} (P, Q) .

Other relations

The terms of Lucas sequences satisfy relations that are generalizations of those between Fibonacci numbers $F_{n} = U_{n} (1, - 1)$ and Lucas numbers $L_{n} = V_{n} (1, - 1)$ . For example:

\begin{matrix} General case & (P, Q) = (1, - 1), D = P^{2} - 4 Q = 5 \\ D U_{n} = V_{n + 1} - Q V_{n - 1} = 2 V_{n + 1} - P V_{n} & 5 F_{n} = L_{n + 1} + L_{n - 1} = 2 L_{n + 1} - L_{n} \\ V_{n} = U_{n + 1} - Q U_{n - 1} = 2 U_{n + 1} - P U_{n} & L_{n} = F_{n + 1} + F_{n - 1} = 2 F_{n + 1} - F_{n} \\ U_{m + n} = U_{n} U_{m + 1} - Q U_{m} U_{n - 1} = U_{m} V_{n} - Q^{n} U_{m - n} & F_{m + n} = F_{n} F_{m + 1} + F_{m} F_{n - 1} = F_{m} L_{n} - (- 1)^{n} F_{m - n} \\ U_{2 n} = U_{n} (U_{n + 1} - Q U_{n - 1}) = U_{n} V_{n} & F_{2 n} = F_{n} (F_{n + 1} + F_{n - 1}) = F_{n} L_{n} \\ U_{2 n + 1} = U_{n + 1}^{2} - Q U_{n}^{2} & F_{2 n + 1} = F_{n + 1}^{2} + F_{n}^{2} \\ V_{m + n} = V_{m} V_{n} - Q^{n} V_{m - n} = D U_{m} U_{n} + Q^{n} V_{m - n} & L_{m + n} = L_{m} L_{n} - (- 1)^{n} L_{m - n} = 5 F_{m} F_{n} + (- 1)^{n} L_{m - n} \\ V_{2 n} = V_{n}^{2} - 2 Q^{n} = D U_{n}^{2} + 2 Q^{n} & L_{2 n} = L_{n}^{2} - 2 (- 1)^{n} = 5 F_{n}^{2} + 2 (- 1)^{n} \\ U_{m + n} = \frac{U_{m} V_{n} + U_{n} V_{m}}{2} & F_{m + n} = \frac{F_{m} L_{n} + F_{n} L_{m}}{2} \\ V_{m + n} = \frac{V_{m} V_{n} + D U_{m} U_{n}}{2} & L_{m + n} = \frac{L_{m} L_{n} + 5 F_{m} F_{n}}{2} \\ V_{n}^{2} - D U_{n}^{2} = 4 Q^{n} & L_{n}^{2} - 5 F_{n}^{2} = 4 (- 1)^{n} \\ U_{n}^{2} - U_{n - 1} U_{n + 1} = Q^{n - 1} & F_{n}^{2} - F_{n - 1} F_{n + 1} = (- 1)^{n - 1} \\ V_{n}^{2} - V_{n - 1} V_{n + 1} = D Q^{n - 1} & L_{n}^{2} - L_{n - 1} L_{n + 1} = 5 (- 1)^{n - 1} \\ 2^{n - 1} U_{n} = (\binom{n}{1}) P^{n - 1} + (\binom{n}{3}) P^{n - 3} D + \dots & 2^{n - 1} F_{n} = (\binom{n}{1}) + 5 (\binom{n}{3}) + \dots \\ 2^{n - 1} V_{n} = P^{n} + (\binom{n}{2}) P^{n - 2} D + (\binom{n}{4}) P^{n - 4} D^{2} + \dots & 2^{n - 1} L_{n} = 1 + 5 (\binom{n}{2}) + 5^{2} (\binom{n}{4}) + \dots \end{matrix}

Divisibility properties

Among the consequences is that $U_{k m} (P, Q)$ is a multiple of $U_{m} (P, Q)$ , i.e., the sequence $(U_{m} (P, Q))_{m \geq 1}$ is a divisibility sequence. This implies, in particular, that $U_{n} (P, Q)$ can be prime only when n is prime. Another consequence is an analog of exponentiation by squaring that allows fast computation of $U_{n} (P, Q)$ for large values of n. Moreover, if $\gcd (P, Q) = 1$ , then $(U_{m} (P, Q))_{m \geq 1}$ is a strong divisibility sequence.

Other divisibility properties are as follows:^[1]

If n is an odd multiple of m, then $V_{m}$ divides $V_{n}$ .
Let N be an integer relatively prime to 2Q. If the smallest positive integer r for which N divides $U_{r}$ exists, then the set of n for which N divides $U_{n}$ is exactly the set of multiples of r.
If P and Q are even, then $U_{n}, V_{n}$ are always even except $U_{1}$ .
If P is odd and Q is even, then $U_{n}, V_{n}$ are always odd for every $n > 0$ .
If P is even and Q is odd, then the parity of $U_{n}$ is the same as n and $V_{n}$ is always even.
If P and Q are odd, then $U_{n}, V_{n}$ are even if and only if n is a multiple of 3.
If p is an odd prime, then $U_{p} \equiv (\frac{D}{p}), V_{p} \equiv P (\mod p)$ (see Legendre symbol).
If p is an odd prime which divides P and Q, then p divides $U_{n}$ for every $n > 1$ .
If p is an odd prime which divides P but not Q, then p divides $U_{n}$ if and only if n is even.
If p is an odd prime which divides Q but not P, then p never divides $U_{n}$ for any $n > 0$ .
If p is an odd prime which divides D but not PQ, then p divides $U_{n}$ if and only if p divides n.
If p is an odd prime which does not divide PQD, then p divides $U_{l}$ , where $l = p - (\frac{D}{p})$ .

The last fact generalizes Fermat's little theorem. These facts are used in the Lucas–Lehmer primality test. Like Fermat's little theorem, the converse of the last fact holds often, but not always; there exist composite numbers n relatively prime to D and dividing $U_{l}$ , where $l = n - (\frac{D}{n})$ . Such composite numbers are called Lucas pseudoprimes.

A prime factor of a term in a Lucas sequence which does not divide any earlier term in the sequence is called primitive. Carmichael's theorem states that all but finitely many of the terms in a Lucas sequence have a primitive prime factor.^[2] Indeed, Carmichael (1913) showed that if D is positive and n is not 1, 2 or 6, then $U_{n}$ has a primitive prime factor. In the case D is negative, a deep result of Bilu, Hanrot, Voutier and Mignotte^[3] shows that if n > 30, then $U_{n}$ has a primitive prime factor and determines all cases $U_{n}$ has no primitive prime factor.

Specific names

The Lucas sequences for some values of P and Q have specific names:

Template:Math : Fibonacci numbers

Template:Math : Lucas numbers

Template:Math : Pell numbers

Template:Math : Pell–Lucas numbers (companion Pell numbers)

Template:Math : Jacobsthal numbers

Template:Math : Jacobsthal–Lucas numbers

Template:Math : Mersenne numbers 2ⁿ − 1

Template:Math : Numbers of the form 2ⁿ + 1, which include the Fermat numbers^[2]

Template:Math : The square roots of the square triangular numbers.

Template:Math : Fibonacci polynomials

Template:Math : Lucas polynomials

Template:Math : Chebyshev polynomials of second kind

Template:Math : Chebyshev polynomials of first kind multiplied by 2

Template:Math : Repunits in base x

Template:Math : xⁿ + 1

Some Lucas sequences have entries in the On-Line Encyclopedia of Integer Sequences:

$P$	$Q$	$U_{n} (P, Q)$	$V_{n} (P, Q)$
−1	3	Template:OEIS2C
1	−1	Template:OEIS2C	Template:OEIS2C
1	1	Template:OEIS2C	Template:OEIS2C
1	2	Template:OEIS2C	Template:OEIS2C
2	−1	Template:OEIS2C	Template:OEIS2C
2	1	Template:OEIS2C	Template:OEIS2C
2	2	Template:OEIS2C
2	3	Template:OEIS2C
2	4	Template:OEIS2C
2	5	Template:OEIS2C
3	−5	Template:OEIS2C	Template:OEIS2C
3	−4	Template:OEIS2C	Template:OEIS2C
3	−3	Template:OEIS2C	Template:OEIS2C
3	−2	Template:OEIS2C	Template:OEIS2C
3	−1	Template:OEIS2C	Template:OEIS2C
3	1	Template:OEIS2C	Template:OEIS2C
3	2	Template:OEIS2C	Template:OEIS2C
3	5	Template:OEIS2C
4	−3	Template:OEIS2C	Template:OEIS2C
4	−2	Template:OEIS2C
4	−1	Template:OEIS2C	Template:OEIS2C
4	1	Template:OEIS2C	Template:OEIS2C
4	2	Template:OEIS2C	Template:OEIS2C
4	3	Template:OEIS2C	Template:OEIS2C
4	4	Template:OEIS2C
5	−3	Template:OEIS2C
5	−2	Template:OEIS2C
5	−1	Template:OEIS2C	Template:OEIS2C
5	1	Template:OEIS2C	Template:OEIS2C
5	4	Template:OEIS2C	Template:OEIS2C
6	1	Template:OEIS2C	Template:OEIS2C

Applications

Lucas sequences are used in probabilistic Lucas pseudoprime tests, which are part of the commonly used Baillie–PSW primality test.
Lucas sequences are used in some primality proof methods, including the Lucas–Lehmer–Riesel test, and the N+1 and hybrid N−1/N+1 methods such as those in Brillhart-Lehmer-Selfridge 1975.^[4]
LUC is a public-key cryptosystem based on Lucas sequences^[5] that implements the analogs of ElGamal (LUCELG), Diffie–Hellman (LUCDIF), and RSA (LUCRSA). The encryption of the message in LUC is computed as a term of certain Lucas sequence, instead of using modular exponentiation as in RSA or Diffie–Hellman. However, a paper by Bleichenbacher et al.^[6] shows that many of the supposed security advantages of LUC over cryptosystems based on modular exponentiation are either not present, or not as substantial as claimed.

Software

Sagemath implements $U_{n}$ and $V_{n}$ as lucas_number1() and lucas_number2(), respectively.^[7]

Notes

Template:Reflist

References

↑ For such relations and divisibility properties, see Template:Harv, Template:Harv or Template:Harv.
↑ ^2.0 ^2.1 Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite book
↑ Template:Cite web

[1] For such relations and divisibility properties, see Template:Harv, Template:Harv or Template:Harv.

[Yabuta-2] 2.0 ^2.1 Template:Cite journal

[3] Template:Cite journal

[BLS75-4] Template:Cite journal

[5] Template:Cite journal

[6] Template:Cite book

[7] Template:Cite web

[1]

[2]

[3]

[4]

[5]

[6]

[7]

Lucas sequence

Contents

Recurrence relations

Examples

Explicit expressions

Distinct roots

Repeated root

Properties

Generating functions

Pell equations

Relations between sequences with different parameters

Other relations

Divisibility properties

Specific names

Applications

Software

See also

Notes

References

Navigation menu

Lucas sequence

Recurrence relations

Examples

Explicit expressions

Distinct roots

Repeated root

Properties

Generating functions

Pell equations

Relations between sequences with different parameters

Other relations

Divisibility properties

Specific names

Applications

Software

See also

Notes

References

Navigation menu

Search