document.write( "Question 1049756: 2. If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0 then f(2) is equal to
\n" ); document.write( "A. -11
\n" ); document.write( "B. 1
\n" ); document.write( "C. 5
\n" ); document.write( "D. 17
\n" ); document.write( "

Algebra.Com's Answer #665335 by MathLover1(20850)\"\" \"About 
You can put this solution on YOUR website!

\n" ); document.write( " given:
\n" ); document.write( " \"f%280%29+=+2+\" and
\n" ); document.write( "\"f%28n%2B1%29+=+-2f%28n%29+%2B+3+\"for \"n+%3E=+0\", \r
\n" ); document.write( "\n" ); document.write( "here is the sequence for the first three numbers:
\n" ); document.write( "
\n" ); document.write( "\"n+=+0\":
\n" ); document.write( "
\n" ); document.write( "\"f%280%2B1%29+=+-2+%2A+f%280%29+%2B+3\"
\n" ); document.write( "\"f%281%29+=+-2+%2A+2+%2B+3\"
\n" ); document.write( "\"f%281%29+=+-4+%2B+3\"
\n" ); document.write( "\"f%281%29+=+-1\"
\n" ); document.write( "
\n" ); document.write( "\"n+=+1\":
\n" ); document.write( "
\n" ); document.write( "\"f%281%2B1%29+=+-2+%2A+f%281%29+%2B+3\"
\n" ); document.write( "\"f%282%29+=+-2+%2A%28+-1%29+%2B+3\"
\n" ); document.write( "\"f%282%29+=+2+%2B+3\"
\n" ); document.write( "\"f%282%29+=+5\"\r
\n" ); document.write( "\n" ); document.write( "\"n+=+2\"
\n" ); document.write( "
\n" ); document.write( "\"f%283%29+=+-2+%2A+f%282%29+%2B+3\"
\n" ); document.write( "\"f%283%29+=+-2+%2A+5+%2B+3\"
\n" ); document.write( "\"f%283%29+=+-10+%2B+3\"
\n" ); document.write( "\"f%283%29+=+-7\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "so, \"f%282%29\" is equal to \"5\" and your answer is C. \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );