Ask questions and get helpful responses.

Mathematical induction. I'm stuck. So far I have..

For all integers n ≥ 1, prove the following statement using mathematical induction. 1+2^1 +2^2 +...+2^n = 2^(n+1) −1

Here's what I have so far
1. Prove the base step

let n=1
2^1=2^(1+1)-1
False.

Someone else suggested that the base step is :
1+2^1=2^(1+1)-1
This returns a true value of 3=3 but doesn't work for any other n... Can some one tell me what the base step is? and why?

2. State the inductive hypothesis.

Assume the statement is also true for k

3. State what you have to show.

4. Proof proper:

  1. 👍
  2. 👎
  3. 👁
  4. ℹ️
  5. 🚩
  1. sure it works.
    1 = 2^1-1
    1+2 = 2^2-1
    1+2+4 = 2^3-1
    ...
    So, the base step works fine.

    Assume it's true for n=k. Now, if n=k+1 we have

    1+2+4+...+2^k+2^(k+1) = 2^(k+1)-1 + 2^(k+1)
    = 2*2^(k+1)-1
    = 2^(k+2)-1
    = 2^((k+1)+1)-1

    QED

    1. 👍
    2. 👎
    3. ℹ️
    4. 🚩

Respond to this Question

First Name

Your Response

Still need help? You can ask a new question.