Prove 1*1! + 2*2! + 3*3!+ ... + n*n! + (n+1)*(n+1)! = (n+2)! -1

  • Thread starter Thread starter darkvalentine
  • Start date Start date
  • Tags Tags
    Permutation
darkvalentine
Messages
11
Reaction score
0

Homework Statement



Prove that 1/2 P(2,1) + 2/3 P(3,2)+3/4 P(4,3)+ ... + n/(n+1) P(n+1,n) = (n+1)! - 1

Please help!

Homework Equations


P(n,r) = n!/(n-r)!

The Attempt at a Solution


The inequation can be simplified to:
1*1! + 2*2! + 3*3!+ ... + n*n! = (n+1)! - 1 (*)
Use the induction method:
1/Base case: n=1 -> 1=1 true
2/Inductive case: suppose (*) is true
Need to prove: 1*1! + 2*2! + 3*3!+ ... + (n+1)*(n+1)! = (n+2)! -1
 
Physics news on Phys.org
i think you;re pretty much there, so assume f(n) = (*) is true, then you need to show
f(n+1) = (n+2)! - 1 = f(n) + (n+1)(n+1)!

substituting for f(n) gives
(n+2)! - 1 = (n+1)! - 1 + (n+1)(n+1)!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top