document.write( "Question 1188737: Find the Fibonacci number when n= 10 (𝐹10), using recursive relation. Take 𝐹0=2 and 𝐹1 =5. Upload your solution. \n" ); document.write( "

Algebra.Com's Answer #819910 by ikleyn(52781) $\"\"$ $\"About$

You can put this solution on YOUR website!
.
\n" ); document.write( "

\r\n" );
document.write( "\r\n" );
document.write( "Use the formula for the Fibonacci sequense\r\n" );
document.write( "\r\n" );
document.write( "    F(n+2) = F(n) + F(n+1).\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The second term is  F(2) = F(1) + F(0) = 5 + 2 = 7;\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The third term is   F(3) = F(2) + F(1) = 7 + 5 = 12\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "and so on.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Continue these calculations until you will get the 10-th term.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "This exercise is a good job for a student, who wants to develop his (or her) skills and knowledge.\r\n" );
document.write( "

\r
\n" ); document.write( "\n" ); document.write( "Happy calculations (!)\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );