query: Combinatorial Proof of $n(n+1)2^{n-2} = \sum_{i=1}^ni^2\binom{n}{i}$
positive_passages.docid: 10917
positive_passages.text: Give a combinatorial proof: $ n(n+1)2^{n-2} = \sum_{k=1}^{n}k^2\binom{n}{k} $
negative_passages.docid: 154722
negative_passages.text: How do I prove $2 \binom n2 + 4 \binom n4 + 6 \binom n6 + \cdots = n 2^{n-2}$
negative_passages.docid: 71564
negative_passages.text: Combinatorial proof of identity involving central binomial coefficients
negative_passages.docid: 136580
negative_passages.text: Proving $\sum_{k=0}^n\binom{2n}{2k} = 2^{2n-1}$
negative_passages.docid: 34299
negative_passages.text: Combinatorial proof of $\sum_{k=0}^n k \cdot k! = (n+1)! -1$
negative_passages.docid: 89576
negative_passages.text: Proof of a binomial identity $\sum_{k=0}^n {n \choose k}^{\!2} = {2n \choose n}.$
negative_passages.docid: 92440
negative_passages.text: Let $n \in \mathbb{Z}^+$, prove the identity $ \sum_{k=1}^{n-1} \binom {n} {k} \frac{kn^{n-k}}{k+1}=\frac{n(n^{n}-1)}{n+1}$
negative_passages.docid: 30338
negative_passages.text: How to prove that $\sum_{k=0}^n \binom nk k^2=2^{n-2}(n^2+n)$
negative_passages.docid: 90904
negative_passages.text: Combinatorial proof of an identity with squared binomial coefficients
negative_passages.docid: 118372
negative_passages.text: Combination proof for $n(n+1)2^{n-2}=\sum_{k=1}^{n}k^2\binom{n}{k}$
negative_passages.docid: 113321
negative_passages.text: Hint proving this $\sum_{k=0}^{n}\binom{2n}{k}k=n2^{2n-1}$
negative_passages.docid: 122005
negative_passages.text: Can $n(n+1)2^{n-2} = \sum_{i=1}^{n} i^2 \binom{n}{i}$ be derived from the binomial theorem?
negative_passages.docid: 25004
negative_passages.text: Proving $\binom{m}{n} + \binom{m}{n-1} = \binom{m+1}{n}$ algebraically
negative_passages.docid: 4610
negative_passages.text: Proving an identity with a combinatorial proof: $\binom{n}{k}\binom{k}{r}=\binom{n}{r}\binom{n-r}{k-r}$
negative_passages.docid: 345
negative_passages.text: Proving $ \sum _{k=0} ^m \binom nk \binom{n-k}{m-k} = 2^m \binom {n}{m}$.
negative_passages.docid: 107071
negative_passages.text: Prove $\sum_{k= 0}^{n} k \binom{n}{k} = n \cdot 2^{n - 1}$ using the binomial theorem
negative_passages.docid: 33082
negative_passages.text: Proving $\sum_{i=0}^n 2^i=2^{n+1}-1$ by induction.