Lucas sequence

In mathematics, the Lucas sequences U n ( P , Q ) {\displaystyle U_{n}(P,Q)} and V n ( P , Q ) {\displaystyle V_{n}(P,Q)} are certain constant-recursive integer sequences that satisfy the recurrence relation x n = P ⋅ x n − 1 − Q ⋅ x n − 2 {\displaystyle x_{n}=P\cdot x_{n-1}-Q\cdot x_{n-2}} where P {\displaystyle P} and Q {\displaystyle 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 ) {\displaystyle U_{n}(P,Q)} and V n ( P , Q ) .

Source: Wikipedia — Lucas sequence (CC BY-SA 4.0)

Lucas sequence

In mathematics, the Lucas sequences U n ( P , Q ) {\displaystyle U_{n}(P,Q)} and V n ( P , Q ) {\displaystyle V_{n}(P,Q)} are certain constant-recursive integer sequences that satisfy the recurrence relation x n = P ⋅ x n − 1 − Q ⋅ x n − 2 {\displaystyle x_{n}=P\cdot x_{n-1}-Q\cdot x_{n-2}} where P {\displaystyle P} and Q {\displaystyle 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 ) {\displaystyle U_{n}(P,Q)} and V n ( P , Q ) .

Source: Wikipedia "Lucas sequence" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy