document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1131897>Question 1131897</A>: <I><SPAN STYLE=\"word-break: break-all;\"> If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0<BR>\n" );
document.write( "then f(2) is equal to? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #748617 by </B><A HREF=/tutors/aboutme.mpl?userid=greenestamps><B>greenestamps(13200)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=greenestamps><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=greenestamps><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=748617\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "f(0)=2; for n >= 0, f(n+1) = -2*f(n)+3.<br><BR>\n" );
document.write( "Set n = 0 in the recursive definition to find f(1):<BR>\n" );
document.write( "n=0:  f(1) = -2*f(0)+3 = -2(2)+3 = -4+3 = -1<br><BR>\n" );
document.write( "Set n = 1 in the recursive definition to find f(2):<BR>\n" );
document.write( "n=1:  f(2) = -2*f(1)+3 = -2(-1)+3 = 2+3 = 5<br><BR>\n" );
document.write( "ANSWER: f(2) = 5 </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );