I am preparing for a test and I came across this example:
Find the closed form generating function of:
$$\dbinom{50}{1}, 2\dbinom{50}{2}, 3\dbinom{50}{3},..., 50\dbinom{50}{50},0,0,0,0$$
I know that I should use the binomial theorem and that:
$$G(x) = \sum_{k=0}^{49}(k+1)\dbinom{50}{k+1}$$
Can I cancel the two $(k+1)$'s. If so, can you explain it please?
EDIT: I made a mistake above, it should be: $$G(x) = \sum_{k=0}^{49}(k+1)\dbinom{50}{k+1}x^k$$ Since I need to find the generating function.
You have $$(k+1) \binom n {k+1} = (k+1) \frac{n!}{(k+1)!(n-k-1)!} =$$ $$= \frac{n!}{k!(n-1-k)!} = n \frac{(n-1)!}{k!(n-1-k)!}= n \binom{n-1} k$$ You then have $$\sum_{k=0}^{49} (k+1) \binom{50}{k+1} x^k = \sum_{k=0}^{49} 50 \binom{49}{k} x^k = 50 \cdot (1+x)^{49}$$ because $$\sum_{k=0}^n \binom n k x^k= (x+1)^n$$.