document.write( "Question 1175605: 1. Evaluate the following sums given the sequence: 16, 14, 30, 44,... \r
\n" ); document.write( "\n" ); document.write( "F(1) + F(2) + F(3) = ______
\n" ); document.write( "F(1) + F(2) + F(3) + F(4) = _____
\n" ); document.write( "F(1) + F(2) + F(3) + F(4) + F(5) = _____ \r
\n" ); document.write( "\n" ); document.write( "2. Determine the pattern in the successive sums from the previous question. What will be the sum of F(1) + F(2) + … + F(10)? \r
\n" ); document.write( "\n" ); document.write( "3. If you have a wooden board that is 0.75 meters wide, how long should you cut it such that the Golden Ratio is observed? Use 1.618034 as the value of the Golden Ratio. (
\n" ); document.write( "

Algebra.Com's Answer #801241 by ikleyn(52786)\"\" \"About 
You can put this solution on YOUR website!
.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "

H I N T

\r
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "Notice that the terms starting from the third, are the sum of the two preceding terms.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "It gives you the recursive formula   F(n+1) = F(n-1) + F(n),  n = 2, 3, 4, . . . \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Having this HINT, you can complete the assignment on your own.\r\n" );
document.write( "
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );