24
$\begingroup$

How do I prove this by induction?

Prove that for every natural number n, $ 2^0 + 2^1 + ... + 2^n = 2^{n+1}-1$

Here is my attempt.

Base Case: let $ n = 0$ Then, $2^{0+1} - 1 = 1$ Which is true.

Inductive Step to prove is: $ 2^{n+1} = 2^{n+2} - 1$

Our hypothesis is: $2^n = 2^{n+1} -1$

Here is where I'm getting off track. Lets look at the right side of the last equation: $2^{n+1} -1$ I can rewrite this as the following.

$2^1(2^n) - 1$ But, from our hypothesis $2^n = 2^{n+1} - 1$ Thus:

$2^1(2^{n+1} -1) -1$ This is where I get lost. Because when I distribute through I get this.

$2^{n+2} -2 -1$ This is wrong is it not? Am I not applying the rules of exponents correctly here? I have the solution so I know what I'm doing is wrong. Here is the correct proof. enter image description here

  • 3
    Your induction hypothesis and what you are trying to prove for induction are both incorrect. What you are trying to prove is that **the sum of the powers of $2$ up to $n$** is equal to $2^{n+1}-1$. So your inductive hypothesis should be that this result is true for $k$; that is, that $$2^0+2^1+\cdots+2^k = 2^{k+1}-1.$$What you want to prove is that from this it follows that the result is true for $k+1$, that is, that$$2^0+2^1+\cdots+2^{k}+2^{k+1} = 2^{(k+1)+1}-1\quad\mbox{holds.}$$Instead, you are trying to prove that $2^m = 2^{m+1}-1$ for all $m$, which is false.2011-02-18

4 Answers 4