Combinatorial Proofs with Summation on One Side

58 Views Asked by At

How do I go about approaching the following problem?

$$\sum_{k=1}^n k^2 C(n,k) = n(n+1)2^{n-2}$$

I don't know how to interpret the summation of something combinatorially, especially with a k^2 term. Any help or tips would be greatly appreciated!

1

There are 1 best solutions below

1
On BEST ANSWER

The combinatorial proof: Given $n$ people, choose a committee of size $k$, then choose a chairperson and a vice chair person (possibly the same person) ... This the LHS.

Another way ... if the the chair & vice are the same person $n2^{n-1}$ ... & if the are different $n(n-1) 2^{n-2}$ ... add these, this is the RHS.