document.write( "Question 1021450: Let f_n be the nth Fibonacci number. Show that for every natural n
\n" );
document.write( "f_1 + f_2 + . . . + f_n = f_(n+2) − 1. \n" );
document.write( "
Algebra.Com's Answer #637172 by richard1234(7193)![]() ![]() You can put this solution on YOUR website! You can show by induction on n.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "When n = 1, we have \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "For some \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Therefore, the equation holds for all natural n. \n" ); document.write( " |