SOLUTION: Prove that for all positive integers n, 1•1!+2•2!+3•3!+...+n•n!=(n+1)!-1

Algebra.Com
Question 804680: Prove that for all positive integers n,
1•1!+2•2!+3•3!+...+n•n!=(n+1)!-1

Answer by Edwin McCravy(20054)   (Show Source): You can put this solution on YOUR website!
Prove:

1•1!+2•2!+3•3!+...+n•n! = (n+1)!-1

The proof is by induction.

It is true for n=1

1•1! = 1 and (1+1)!-1 = 2!-1 = 2-1 = 1

Assume k is such that the proposition is true for n ≦ k

We are assuming that 

(1)   1•1!+2•2!+3•3!+...+k•k! = (k+1)!-1

We must use (1) to show (2) 

(2)   1•1!+2•2!+3•3!+...+(k+1)•(k+1)! = ((k+1)+1)!-1 = (k+2)!-1

We start with

(1)   1•1!+2•2!+3•3!+...+k•k! = (k+1)!-1

We add (k+1)•(k+1)! to both sides

      1•1!+2•2!+3•3!+...+k•k!+(k+1)•(k+1)! = (k+1)!-1+(k+1)•(k+1)!

= (k+1)!+(k+1)•(k+1)!-1 =

Factor (k+1)! out of the first two terms:

(k+1)!•[1+(k+1)]-1 = (k+1)!•[1+k+1]-1 = (k+1)!•(k+2)-1 = (k+2)!-1

So we have shown (2)

We know that it is true for n=1, and for n=k=1 we know that it is true for
n=k=2.  That means we know it is true for n=k=3, and that means we know it
is true for n=k=4, and so on.

QED

Edwin

RELATED QUESTIONS

show that 1(1!)+2(2!)+3(3!)+...+n(n!)= (n+1)!-1 for all positive integers... (answered by venugopalramana)
Prove that (n+1)! >2 n for all n>1. (answered by rothauserc)
use mathematical induction to prove that 1^2 + 2^2 + 3^2 +...+ n^2 = n(n+1)(2n+1)/6... (answered by solver91311)
prove that: 1+2+3+....+n =... (answered by ikleyn)
Show that (1/((1)^(1/2))) +... (answered by khwang)
Prove by induction that 3^n ≥ 2n +1 for all positive... (answered by josgarithmetic)
Prove by mathematical induction that: 2^2n - 1 is divisible by 3 for all positive... (answered by Edwin McCravy)
Prove 1 + 2^n < 3^n for n... (answered by checkley77)
Determine all positive integers n for which {{{2^n + 1}}} is divisible by... (answered by mathie123)