Luca's numbers....

Just like Fibonacci numbers , there are \(\color{Blue}{Luca's}\) numbers... They are defined by following recurrence relation. \[L_0=2\] \[L_1 =1\] \[\text{and}\] \[L_n = L_{n-1} + L_{n-2}\]

Find the value of \(\displaystyle \sum_{n=0} ^{10} L_n\)

Note :- I read about Luca's numbers at this problem in the tag recurrence relations, and i think the same thing as why the maker had chosen \(L_{10}\) as asked answer, the same is why I also have chosen it to be sum till 10. After you get the answer, you'll come to know it, \(\color{Red}{\text{the answer number looks very good.}}\)

×

Problem Loading...

Note Loading...

Set Loading...