Here is my attempt to solve this difficlt problem:
we are looking for the sum ( kK!) as K from 2 to n.
First , we can easily eliminate first and second choices, because the first one ( n!+1) is vritually too small to be the sum we are looking for;
The second choice ( n+1)! is even; and the sum we are looking for is odd;
Now choices are narrowed to the three choices that countain the expression ( n+1)!
Let's examine the following difference :
(n+1)! - [ 1*1! + 2*2! +........+ n *n! )] = (n+1)*n! - [ 1*1! + 2*2! +........+ n *n! )] = n! - [ 1*1! + 2*2! +........+ (n-1) *(n-1)! )] = n ( n-1)! - [ 1*1! + 2*2! +........+ (n-1) *(n-1)! )] = (n-1)(n-2)! - [ 1*1! + 2*2! +........+ (n-2) *(n-2)! )]
THE GENERAL FORMULA, when doing so (k) times, is
(n-K+1)(n-K)! - [ 1*1! + .......+ (n-k) *(n-K)! )]
Therfore at the end ; k is (n-1), so the sum becomes :
2*(1)! - [ 1*1!] = 1 = (n+1)! - [ 1*1! + 2*2! +........+ n *n! )] = 1
So,
[ 1*1! + 2*2! +........+ n *n! )] = (n+1)! -1
I hope I am not abusively simplifying things,
please, any comment !!!!!