Results 1 to 1 of 1

Math Help - Strong Induction proof

  1. #1
    Newbie
    Joined
    Nov 2008
    Posts
    11

    Strong Induction proof

    Use strong induction to show that every positive integer n can be written
    as a sum of distinct powers of two, that is, as a sum of a subset of the integers
    2^0=1 ,261=2, 2^2=4,... [Hint: For the inductive step separately consider the case where
    k+1 is even and where it is odd. When it is even note that (k+2)/2 is an integer.]
    Last edited by dh214; November 5th 2008 at 12:53 PM. Reason: missing symbols
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. proof by strong induction
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: November 27th 2011, 04:06 PM
  2. Strong Induction proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: August 24th 2010, 10:01 AM
  3. Proof by strong induction?
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 5th 2009, 07:51 AM
  4. Proof Using Strong Induction
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 23rd 2009, 10:26 AM
  5. Strong induction proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 7th 2008, 09:48 PM

Search Tags


/mathhelpforum @mathhelpforum