Let $n\in \mathbb{N}$. Can someone help me prove this by induction:
$$\sum _{i=0}^{n}{i} =\frac { n\left( n+1 \right) }{ 2 } .$$
Let $n\in \mathbb{N}$. Can someone help me prove this by induction:
$$\sum _{i=0}^{n}{i} =\frac { n\left( n+1 \right) }{ 2 } .$$
On
HINT: Induction works like this: you start by the lower most value and put it in the equation to verify it. Next, you assume the equation to be true for some value $k$. Then try to prove that it works for $k+1$ as well.
Using $\sum_{i=1}^{k}i=\frac{k(k+1)}{2}$, can you prove that $\sum_{i=1}^{k+1} i=\frac{(k+1)(k+2)}{2}$ as well?
when $n=0$ then the formula is true.
suppose that $\sum_{i=0}^{n-1} i=\frac{1}{2}(n(n-1))$.
$\sum_{i=0}^{n} i=n+\sum_{i=0}^{n-1} i=n+\frac{1}{2}(n(n-1))=\frac{1}{2}(n(n+1))$