document.write( "Question 116640This question is from textbook Mc Dougal Littel Algebra 2
\n" ); document.write( ": Give the recursive formula for the series 4,16,64... \n" ); document.write( "
Algebra.Com's Answer #84824 by Edwin McCravy(20081)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "Give the recursive formula for the series 4,16,64...\r\n" );
document.write( "0 solutions\r\n" );
document.write( "\r\n" );
document.write( "16, the 2nd term, is 4 times the first term 4\r\n" );
document.write( "64, the 3rd term, is 4 times the second term 16\r\n" );
document.write( "\r\n" );
document.write( "So apparently,\r\n" );
document.write( "\r\n" );
document.write( "Each term = 4 times the previous term\r\n" );
document.write( "\r\n" );
document.write( "There are two acceptable ways to write that sentence\r\n" );
document.write( "as a recursion formula:\r\n" );
document.write( "\r\n" );
document.write( "If you think of it as\r\n" );
document.write( "\r\n" );
document.write( "The nth term is 4 times the (n-1)st term\r\n" );
document.write( "\r\n" );
document.write( "then the recursion formula is\r\n" );
document.write( "\r\n" );
document.write( "an = 4·an-1, a1 = 4 where n > 1\r\n" );
document.write( "\r\n" );
document.write( "Or if you think of it as\r\n" );
document.write( "\r\n" );
document.write( "The (n+1)st term is 4 times the nth term\r\n" );
document.write( "\r\n" );
document.write( "then the recursion formula is\r\n" );
document.write( "\r\n" );
document.write( "an+1 = 4·an, a1 = 4 where n > 0\r\n" );
document.write( "\r\n" );
document.write( "They are both correct, and equivalent.\r\n" );
document.write( "\r\n" );
document.write( "Edwin

\n" ); document.write( " \n" ); document.write( "
\n" );