query: Prove that $\sum_{k=1}^{n}k\binom{n}{k}=n\cdot2^{n-1}$
positive_passages.docid: 1158
positive_passages.text: How to prove this binomial identity $\sum_{r=0}^n {r {n \choose r}} = n2^{n-1}$?
negative_passages.docid: 9522
negative_passages.text: Proving $k \binom{n}{k} = n \binom{n-1}{k-1}$
negative_passages.docid: 145524
negative_passages.text: Proving this identity $\sum_k\frac{1}{k}\binom{2k-2}{k-1}\binom{2n-2k+1}{n-k}=\binom{2n}{n-1}$ using lattice paths
negative_passages.docid: 47827
negative_passages.text: Prove that $\sum^{n}_{r=0}(-1)^r\cdot \large\frac{\binom{n}{r}}{\binom{r+3}{r}} = \frac{3!}{2(n+3)}$
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: 145048
negative_passages.text: Prove $\sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^n = n!$ and $\sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^m = 0$
negative_passages.docid: 70128
negative_passages.text: Prove that $(fg)^{(n)} = \sum_{k=0}^n \binom{n}{k}f^{(k)}(x)g^{(n-k)}(x)$
negative_passages.docid: 27922
negative_passages.text: prove that $\binom{n}{0}^2+\binom{n}{1}^2+\binom{n}{2}^2+\cdots+\binom{n}{n}^2=\binom{2n}{n}$
negative_passages.docid: 143337
negative_passages.text: How to prove that $\sum_{i=0}^n 2^i\binom{2n-i}{n} = 4^n$.
negative_passages.docid: 113321
negative_passages.text: Hint proving this $\sum_{k=0}^{n}\binom{2n}{k}k=n2^{2n-1}$
negative_passages.docid: 143365
negative_passages.text: Is $\sum_{i=1}^{n-1}i=\binom{n}{2}$?
negative_passages.docid: 11612
negative_passages.text: How to show that $\sum_{k=1}^n k(n+1-k)=\binom{n+2}3$?
negative_passages.docid: 40784
negative_passages.text: $\sum_{k=m}^{n}(-1)^k\binom{n}{k}\binom{k}{m}=0, n>m\geq 0$
negative_passages.docid: 31196
negative_passages.text: Prove $\binom{n}{a}\binom{n-a}{b-a} = \binom{n}{b}\binom{b}{a}$
negative_passages.docid: 5049
negative_passages.text: Proving $\sum_{k=0}^n(-1)^k\binom nk=0$
negative_passages.docid: 116461
negative_passages.text: Prove the identity $\sum_{k=0}^{n}(-1)^{k}\binom{n}{k}=0$ using a combinatorial interpretation of the positive and negative terms
negative_passages.docid: 146533
negative_passages.text: Having problems proving $ \sum_{r=0}^{n}(r+1) \binom{n}{r} = (n+2)2^{n-1} $