Results 1 to 3 of 3

Math Help - Strong Induction Problem using Summations

  1. #1
    Newbie
    Joined
    Mar 2009
    Posts
    9

    Strong Induction Problem using Summations

    Let an be the recurrence defined by a_{0} = 1 (for all n > 0)
    a_{n} = 1 + \sum_{i=0}^{n-1}a_{i}

    Prove using strong induction that (for all n greater than or equal to 0) a_{n} = 2^{n}

    Any help is appreciated!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Behold, the power of SARDINES!
    TheEmptySet's Avatar
    Joined
    Feb 2008
    From
    Yuma, AZ, USA
    Posts
    3,764
    Thanks
    78
    Quote Originally Posted by tshare1 View Post
    Let an be the recurrence defined by a0 = 1 (for all n > 0)
    a_{n} = 1 + \sum_{i=0}^{n-1}

    Prove using strong induction that (for all n greater than or equal to 0) a_{n} = 2^{n}

    Any help is appreciated!
    Your summation is empty
    I think you have a typo
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Mar 2009
    Posts
    9
    Sorry, I was figuring out the latex thing.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] strong induction problem involving power set
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 8th 2011, 01:32 AM
  2. [SOLVED] some problem in strong induction
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 6th 2011, 07:05 PM
  3. Strong induction vs. structural induction?
    Posted in the Discrete Math Forum
    Replies: 13
    Last Post: April 21st 2011, 12:36 AM
  4. Strong induction
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: November 22nd 2008, 01:00 PM
  5. Strong Induction Problem
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 31st 2008, 05:09 AM

Search Tags


/mathhelpforum @mathhelpforum