Art of Problem Solving

Lucas Numbers: Difference between revisions

Swamih (talk | contribs)
No edit summary
Cozzmo (talk | contribs)
No edit summary
Line 1: Line 1:
Lucas Numbers are a recursive sequence defined as <cmath>L_0=2\\L_1=1\\L_n=L_{n-1}+L_{n-2}</cmath>.
Lucas Numbers are a recursive sequence defined as <cmath>L_0=2\\L_1=1\\L_n=L_{n-1}+L_{n-2}</cmath>.
[hide]The Lucas numbers <math>L_n</math> are given by the recursion <math>L_0 = 2, L_1 = 1</math>, and <math>L_n = L_{n-1} + L_{n-2}</math>.[/hide]

Revision as of 17:06, 31 July 2021

Lucas Numbers are a recursive sequence defined as \[L_0=2\\L_1=1\\L_n=L_{n-1}+L_{n-2}\].


[hide]The Lucas numbers $L_n$ are given by the recursion $L_0 = 2, L_1 = 1$, and $L_n = L_{n-1} + L_{n-2}$.[/hide]