PROOF (Sequences & Series); Can anyone help me out?

sdrmybrat
Messages
1
Reaction score
0
Prove that:
∀ n€N [(the) sum of an (infinite?) series (a1,+a2,...+,an)] (where a_{n}=\frac{n}{(n+1)!})
\sum \frac{n}{(n+1)!} (is equal to/gives/yields) = 1 - \frac{1}{(n+1)!}

Prove that:
∀ n \in N \sum \frac{n}{(n+1)!} = 1 - \frac{1}{(n+1)!}

THX in advance
 
Physics news on Phys.org
What is the summation index?
 
how it can be
\sum\frac{n}{n+1!}=\sum\frac{1}{n!}\frac{1}{n+1!}
there is a negative sign between last two expessions in n
e-1-(e-2)=1
 
Last edited:
Hey there,

A possible derivation of the sum requested uses the telescoping series property.
Note that for every j, Aj can be expended to -

Aj = j / ( j + 1 )! = 1 / j! - 1 / ( j + 1)!

Summing over 1,...,n would then yield the desired result.
 
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...

Similar threads

Back
Top