Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » discretemath

Topic: Proof induction
Replies: 1   Last Post: Feb 16, 2013 3:05 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ] Topics: [ Previous | Next ]
jokie

Posts: 1
Registered: 2/9/13
Proof induction
Posted: Feb 9, 2013 4:06 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Stuck on a question , im very confused.

Use mathematical induction to show that
S(n) = 3 × 2 n-1 -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^(n-2) -2) + 2
S(n) = 3 × 2 n-1 -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
Read Proof induction
jokie
2/16/13
Read Re: Proof induction
grei

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.