Give a combinatoric proof for:
For $n \in \mathbb N$ $$\sum_{k=1}^{n}k \binom{n}{k} = n2^{n-1}$$
PS: Do not derive the formula by differentiating another formula.
Give a combinatoric proof for:
For $n \in \mathbb N$ $$\sum_{k=1}^{n}k \binom{n}{k} = n2^{n-1}$$
PS: Do not derive the formula by differentiating another formula.
We have $n$ people. We want to select some of them, then choose a chief for the selected group (among the chosen people). If we first choose the group, then the chief, we have $\sum_{k=1}^{n}\binom{n}{k}\cdot k$ ways for accomplishing our task. On the other hand, we may also select the chief first, then the other people in his/her group, and this leads to $n 2^{n-1}$ as wanted.
$k{n\choose k} = k\frac {n!}{k!(n-k)!} = \frac {n!}{(k-1)!(n-k)!} = \frac {n(n-1)!}{{k-1}!(n-k)!} = n{n-1\choose k-1}$
$\sum_\limits{k=1}^{n}k {n \choose k} = n\sum_\limits{k=0}^{n-1}{n-1 \choose k} = n2^{n-1}$