Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


jokie
Posts:
1
Registered:
2/9/13


Proof induction
Posted:
Feb 9, 2013 4:06 AM


Stuck on a question , im very confused.
Use mathematical induction to show that S(n) = 3 × 2 n1 2 is the solution for the recurrence relation: T(n) = 2T(n ? 1) + 2 for n > 1 and T(1) = 1
Ive answered
T(n) = 2T(n ? 1) + 3 = 2T(n 2) + 2 = 2(2T(n ? 2) + 1) + 1 = 2(3 × 2^(n2) 2) + 2 S(n) = 3 × 2 n1 2 S = 0 , T=0
It just dosnt make sense to me, the coursework is so large im running out of time to try work this out.
please help


Date

Subject

Author

2/9/13


jokie

2/16/13


grei


