I need to solve this: $\sum\limits_{k=0}^n k\\$
Using this specific method: $n + \sum\limits_{k=0}^{n-1} k\ = 0 + \sum\limits_{k=1}^n k\\$
Now this has to evaluate to: $\ n+\frac{n(n-1)}{2} = \frac{n(n+1)}{2} \\$
I don't know how to reach that result using that method, my results don't look like this.
Writing $n + \sum\limits_{k=0}^{n-1} k = 0 + \sum\limits_{k=1}^n k$ does not take you much far, but the method is good if you consider the sums of squares instead. Set $$ S_1(n)=\sum_{k=0}^n k, \quad S_2(n)=\sum_{k=0}^n k^2, $$ and write \begin{align} S_2(n)+(n+1)^2 &=S_2(n+1)\\ &=0+\sum_{k=1}^{n+1}k^2\\ &=\sum_{k=0}^{n}(k+1)^2\\ &=\sum_{k=0}^{n}(k^2+2k+1)\\ &=\sum_{k=0}^{n}k^2+2\sum_{k=0}^{n}k+\sum_{k=0}^{n}1\\ &=S_2(n)+2S_1(n)+(n+1) \end{align} Comparing the starting point to the final one, we get $$ 2S_1(n)=(n+1)^2-(n+1)=n(n+1) $$