in Combinatory
97 views
0 votes
0 votes
Give a combinatorial proof that if n is a positive integer then $\displaystyle\sum_{k = 0}^{n} k^{2} \binom{n} {k} = n(n + 1)2^{n−2}.$ [Hint: Show that both sides count the ways to select a subset of a set of $n$ elements together with two not necessarily distinct elements from this subset. Furthermore, express the right-hand side as $n(n − 1)2^{n−2} + n2^{n−1}.]$
in Combinatory

Please log in or register to answer this question.

Related questions