0

I am referring to this older question, which I found here for preparation:

Proof by induction that $\sum_{j=0}^n 2^j = 2^{n+1} - 1$

Could somebody outline the Induction outset and the goal? I am unsure where to put in my (n + 1). My approach would be: 2⁰ - 1 + 2^(n+1) -1

Luise
  • 3

2 Answers2

0

Base case $n=0$: $\sum\limits_{j=0}^0 2^j=2^{1}-1$.

Inductive step: assuming $\sum\limits_{j=0}^n 2^j=2^{n+1}-1$, show that $\sum\limits_{j=0}^{n\color{blue}{+1}} 2^j=2^{(n\color{blue}{+1})+1}-1$.

(Put $n\color{blue}{+1}$ wherever $n$ appeared.)

J. W. Tanner
  • 63,683
  • 4
  • 43
  • 88
0

Generalise: $$1+x+x^2+\dots +x^n=\frac{x^{n+1}-1}{x-1}.$$ This formula is the simplest nontrivial model when one teaches proofs by induction.

The inductive step begins with \begin{align} 1+x+x^2+\dots+x^{n+1}&=(1+x+x^2+\dots +x^n)+x^{n+1}\\ &=\frac{x^{n+1}-1}{x-1}+x^{n+1}=\dots \end{align}

Bernard
  • 179,256
  • I would basically need the meaning of the sum sign as I am unsure about the power of j – Luise Nov 23 '20 at 16:04
  • @Luise: it means what's on the left side of the first equation of my answer, with $2$ in the place of $x$ – you add all powers of $2$, from $0$ to the $n$-th power. – Bernard Nov 23 '20 at 16:10