SOLUTION: show that 1/2!+2/3!+3/4!+...+n/(n+1)!=1-1/(n+1)!. where n!=1*2*3*...*n. note:*=multiply

Algebra ->  Sequences-and-series -> SOLUTION: show that 1/2!+2/3!+3/4!+...+n/(n+1)!=1-1/(n+1)!. where n!=1*2*3*...*n. note:*=multiply       Log On


   



Question 878891: show that 1/2!+2/3!+3/4!+...+n/(n+1)!=1-1/(n+1)!. where n!=1*2*3*...*n.


note:*=multiply

Answer by Edwin McCravy(20056) About Me  (Show Source):
You can put this solution on YOUR website!
1%2F2%21%2B2%2F3%21%2B3%2F4%21%2B%22%22%2A%22%22%2A%22%22%2A%22%22%2Bn%2F%28n%2B1%29%21%22%22=%22%221-1%2F%28n%2B1%29%21

First we prove that when n=1, and there is just 1 term on the left,
the the above is true:

1%2F2%21%22%22=%22%221%2F%281%2B1%29%21

That is true since 1+1=2

Now since we have a value of n where it works, we can assume that
there is at least one value of n=k where it works, for we know it
works for k=1 as we just showed.

So we can be sure that there is at least one value of k where

1%2F2%21%2B2%2F3%21%2B3%2F4%21%2B%22%22%2A%22%22%2A%22%22%2A%22%22%2Bk%2F%28k%2B1%29%21%22%22=%22%221-1%2F%28k%2B1%29%21

is true, even if it were only true only for k=1.

Now we will add the next term red%28%28k%2B1%29%2F%28k%2B2%29%21%29 to both sides:

%22%22=%22%221-1%2F%28k%2B1%29%21%2Bred%28%28k%2B1%29%2F%28k%2B2%29%21%29%29

                              %22%22=%22%221-1%2F%28k%2B1%29%21%2Bred%28%28k%2B1%29%2F%28k%2B2%29%28k%2B1%29%21%29%29

                              %22%22=%22%22

                              %22%22=%22%22

                              %22%22=%22%221-%28k%2B2%29%2F%28k%2B2%29%21%2B%28k%2B1%29%2F%28k%2B2%29%21%29

Notice there is a "-" before the %28k%2B2%29%2F%28k%2B2%29%21

                              %22%22=%22%221%2B%28-k-2%29%2F%28k%2B2%29%21%2B%28k%2B1%29%2F%28k%2B2%29%21%29

                              %22%22=%22%221%2B%28-k-2%2Bk%2B1%29%2F%28k%2B2%29%21

                              %22%22=%22%221%2B%28-1%29%2F%28k%2B2%29%21

%22%22=%22%221-1%2F%28k%2B2%29%21

That's the formula with n equaling to k+1

So we have shown that if the formula works for some n=k, then it works 
also for n=k+1

Therefore since we have shown that it works for n=k=1, this proves that it
also works for n=k=2.
Therefore since we have shown that it works for n=k=2, this proves that it
also works for n=k=3.
Therefore since we have shown that it works for n=k=3, this proves that it
also works for n=k=4.

etc. etc.

So it works for ALL values of n

Edwin