I've know that
$\sum\limits_{i=1}^n k$ is $ \frac{n(n+1)}{2}$.
Then why
$\sum\limits_{j=2}^n j = \frac{n(n+1)}{2} -1$ ? I understand that i=1 $\neq$ j=2 is the key, but I can't get further.
from : Introduction to Algorithms (3rd edition) p. 27
I've know that
$\sum\limits_{i=1}^n k$ is $ \frac{n(n+1)}{2}$.
Then why
$\sum\limits_{j=2}^n j = \frac{n(n+1)}{2} -1$ ? I understand that i=1 $\neq$ j=2 is the key, but I can't get further.
from : Introduction to Algorithms (3rd edition) p. 27
$${n(n+1)\over 2}=\sum_{k=1}^n k = 1 + \sum_{k=2}^n k.$$