document.write( "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
\n" );
document.write( "F_n = \frac{\alpha^n - \beta^n}{\sqrt{5}},
\n" );
document.write( "where \alpha = \frac{1 + \sqrt{5}}{2} and \beta = \frac{1 - \sqrt{5}}{2}.\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "The Lucas sequence is defined as follows: L_0 = 2, L_1 = 1, and
\n" );
document.write( "L_n = L_{n - 1} + L_{n - 2}
\n" );
document.write( "for n \ge 2. What is L_4?
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #850743 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "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). \n" ); document.write( "The sequence in this problem is A Lucas sequence with first two terms 2 and 1. \n" ); document.write( "Subsequent terms of the sequence are found using the given recursive definition. \n" ); document.write( "L(0)=2 \n" ); document.write( "L(1)=1 \n" ); document.write( "L(2)=L(0)+L(1)=2+1=3 \n" ); document.write( "L(3)=L(1)+L(2)=1+3=4 \n" ); document.write( "L(4)=L(2)+L(3)=3+4=7 \n" ); document.write( "L(5)=L(3)+L(4)+4+7=11 \n" ); document.write( "etc... \n" ); document.write( "ANSWER: L(4)=7 \n" ); document.write( " \n" ); document.write( " |