Prove this by induction: $$\sum_{i=1}^n i(i!) = (n+1)!-1$$
So I wrote:
Base Case: $n=1$ so $1(1!) = 1$ and $(1+1)!-1 = 1$.
Let $n=k$ so that $$\sum_{i=1}^ki(i!)=(k+1)!-1$$
$n=k+1$ $$\sum_{i=1}^{k+1}i(i!)=((k+1)+1)!-1$$
But I'm stuck here. Also is there any easier way I can write out summation on stack exchange? A format for writing it out on one line? Or is my way preferred?
$\sum_1^n i\cdot i!$is how I wrote the sum. You can read more here: http://math.stackexchange.com/editing-help – Jared Apr 07 '14 at 04:32