Difference between revisions of "Lucas Numbers"
(Stub) |
|||
| (One intermediate revision by one other user not shown) | |||
| 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>. | ||
| + | |||
| + | |||
| + | 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>. | ||
| + | |||
| + | |||
| + | {{stub}} | ||
Latest revision as of 11:44, 30 July 2025
Lucas Numbers are a recursive sequence defined as ![\[L_0=2\\L_1=1\\L_n=L_{n-1}+L_{n-2}\]](http://latex.artofproblemsolving.com/a/8/4/a840756cb79a8913119c8899e662b38db99d443a.png)
.
The Lucas numbers 
are given by the recursion 
, and 
.
This article is a stub. Help us out by expanding it.
