Proving f(n) = 5 x 3^n - 4 with Mathematical Induction

AI Thread Summary
The discussion focuses on proving the formula f(n) = 5 x 3^n - 4 using mathematical induction, starting with the recurrence relation f(n + 1) = 3f(n) + 8 and the base case f(1) = 11. Participants suggest assuming the formula holds for n=k and then proving it for n=k+1. A method is proposed to find a solution of the form a_n = α·3^n + β, which simplifies the process of finding values for α and β. The conversation highlights the importance of establishing the base case and the inductive step in the proof.
BasilBrush
Messages
2
Reaction score
0

Homework Statement


Let f(n + 1) = 3f(n) + 8, with f(1) = 11. Prove by induction that f(n) = 5 x 3^n - 4.

Homework Equations


The Attempt at a Solution


I don't even know where to start! Any help would be appreciated. Thanks. :-)
 
Physics news on Phys.org
Well since it gives you the base case, f(1)=1, you can show it's true for the base case n=0.

Now you assume it is true for n=k, that is,
3f(k)+8=5.3^k-4

Now prove it true for n=k+1,

3f(k+1)+8=5.3^{k+1}-4
 
You don't really need induction, the recurrence relation is given by:
<br /> a_{n+1}=3a_{n}+8<br />
This suggests you look for a solution of the form:
<br /> a_{n}=\alpha\cdot 3^{n}+\beta<br />
For some \alpha ,\beta, then it is just a matter of plugging this into the equation to obtain values for \alpha and \beta.

Mat
 
Mentallic said:
Well since it gives you the base case, f(1)=1, you can show it's true for the base case n=0.

Now you assume it is true for n=k, that is,
3f(k)+8=5.3^k-4

Now prove it true for n=k+1,

3f(k+1)+8=5.3^{k+1}-4

Nice one, thanks!
 
Back
Top