query: Prove identity $\sum_{k}{n\brack k}{k\brace m}=\binom{n}{m}\frac{(n-1)!}{(m-1)!}$
positive_passages.docid: 154703
positive_passages.text: Use combinatorics to prove $L\left(n,k\right)=\sum_{j=0}^{n}{ n\brack j}{j\brace k}$
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: 122006
negative_passages.text: Proving combinatorial identity $\sum_{k=0}^{n}(-1)^k \binom{2n-k}k 2^{2n-2k} = 2n+1$ "directly"
negative_passages.docid: 9046
negative_passages.text: Prove that $\sum_{k=0}^{m}\frac{\binom{m}{k}}{\binom{n}{k}}=\frac{n+1}{n+1-m}$
negative_passages.docid: 61483
negative_passages.text: Prove the following identity combinatorially
negative_passages.docid: 36786
negative_passages.text: Prove $\sum\limits_{i=0}^n\binom{i+k-1}{k-1}=\binom{n+k}{k}$ (a.k.a. Hockey-Stick Identity)
negative_passages.docid: 133905
negative_passages.text: Intuitive proof of $\sum_{k=1}^{n} \binom{n}{k} k^{k-1} (n-k)^{n-k} = n^n$
negative_passages.docid: 90904
negative_passages.text: Combinatorial proof of an identity with squared binomial coefficients
negative_passages.docid: 108688
negative_passages.text: An identity involving products of sums
negative_passages.docid: 32791
negative_passages.text: Proving this binomial identity $\sum_{k=0}^n {n+k \choose k} \frac{1}{2^{k}}= 2^{n}$
negative_passages.docid: 110441
negative_passages.text: Closed form for a formula with a summation over $i\binom{n-i}{k-1}$, and combinatorial proof?
negative_passages.docid: 79124
negative_passages.text: Proving $\binom {n-1}{r-1}=\sum_{k=0}^r(-1)^k\binom r k \binom{n+r-k-1}{r-k-1}$
negative_passages.docid: 155769
negative_passages.text: Prove $\sum_{k= 0}^{n} k \binom{n}{k} = n \cdot 2^{n-1}$ using the binomial theorem for $n\geq1$
negative_passages.docid: 13236
negative_passages.text: Proving equality - a sum including binomial coefficient $\sum_{k=1}^{n}k{n \choose k}2^{n-k}=n3^{n-1}$
negative_passages.docid: 94784
negative_passages.text: $\sum_{k=-m}^{n} \binom{m+k}{r} \binom{n-k}{s} =\binom{m+n+1}{r+s+1}$ using Counting argument
negative_passages.docid: 63553
negative_passages.text: Show that $\frac{1}{(n+1)!}(1+\frac{1}{(n+1)}+\frac{1}{(n+1)^2}+\frac{1}{(n+1)^3}+\cdots)=\frac{1}{n!n}$
negative_passages.docid: 89576
negative_passages.text: Proof of a binomial identity $\sum_{k=0}^n {n \choose k}^{\!2} = {2n \choose n}.$