document.write( "Question 1180276: If f(1) = 3 and f(n) = -2f(n-1) + 1, then what is f(5)? \n" ); document.write( "

Algebra.Com's Answer #809891 by greenestamps(13200) $\"\"$ $\"About$

You can put this solution on YOUR website!

\n" ); document.write( "This is a recursively defined sequence, where each number is found from the preceding number based on a pattern. The recursive definition

\n" ); document.write( "f(n) = -2f(n-1) + 1

\n" ); document.write( "means each term (f(n), term \"n\") is found by multiplying the previous term (f(n-1), the preceding term) by -2 and adding 1.

\n" ); document.write( "Given: f(1)=3

\n" ); document.write( "f(2)=-2*f(1)+1 = -2(3)+1 = -6+1 = -5
\n" ); document.write( "f(3)=-2*f(2)+1 = -2(-5)+1 = 10+1 = 11

\n" ); document.write( "Continue using the pattern to find f(5).

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

\n" );