I'm looking to generalize this to a formula with only n. I have figured out that $\sum_{k=0} ^n \binom{n}{k}\cdot k = n \cdot 2^{n-1}$ but I'm not quite sure how to leverage this to find this formula
Asked
Active
Viewed 69 times
1
-
2Hint: Differentiate \begin{eqnarray} (1+x)^n = \sum_{k=0}^{n} \binom{n}{k} x^k. \end{eqnarray} Now multiply by $x$ and differentiate again. – Donald Splutterwit Sep 24 '20 at 23:27
-
See also this answer. – Brian M. Scott Sep 24 '20 at 23:33
1 Answers
3
We have the convenient formula $\binom nk = \frac nk \cdot \binom{n-1}{k-1} = \frac nk \cdot \frac{n-1}{k-1} \cdot \binom{n-2}{k-2}$.
This makes it easier to compute $$ \sum_{k=0}^n k(k-1) \binom nk $$ because we can rewrite this sum (skipping the zero terms for $k=0$ and $k=1$) as $$ \sum_{k=2}^n k(k-1) \frac{n(n-1)}{k(k-1)} \binom{n-2}{k-2} = n(n-1) \sum_{k=2}^n \binom{n-2}{k-2} $$ (which you should already know how to simplify).
But we can express the sum of $k^2 \binom nk$ as the sum of $k(k-1) \binom nk$ plus the sum of $k \binom nk$.

Misha Lavrov
- 142,276