SOLUTION: The Fibonacci sequence, is defined by F_0 = 0, F_1 = 1, and F_n = F_{n - 2} + F_{n - 1}. It turns out that
F_n = \frac{\alpha^n - \beta^n}{\sqrt{5}},
where \alpha = \frac{1 + \s
Algebra ->
Sequences-and-series
-> SOLUTION: The Fibonacci sequence, is defined by F_0 = 0, F_1 = 1, and F_n = F_{n - 2} + F_{n - 1}. It turns out that
F_n = \frac{\alpha^n - \beta^n}{\sqrt{5}},
where \alpha = \frac{1 + \s
Log On
Question 1209828: The Fibonacci sequence, is defined by F_0 = 0, F_1 = 1, and F_n = F_{n - 2} + F_{n - 1}. It turns out that
F_n = \frac{\alpha^n - \beta^n}{\sqrt{5}},
where \alpha = \frac{1 + \sqrt{5}}{2} and \beta = \frac{1 - \sqrt{5}}{2}.
The Lucas sequence is defined as follows: L_0 = 2, L_1 = 1, and
L_n = L_{n - 1} + L_{n - 2}
for n \ge 2. What is L_4?
The sequence with first two terms 2 and 1 with the recursive definition that each term is the sum of the previous two terms is NOT "THE" Lucas sequence. A Lucas sequence is ANY sequence in which each term is a linear combination of the two preceding terms (and the first two terms can be any numbers).
The sequence in this problem is A Lucas sequence with first two terms 2 and 1.
Subsequent terms of the sequence are found using the given recursive definition.
