query: Prove by Double Counting Method $\sum\limits_{k = 0}^m \binom{m}{k}\binom{n}{r + k} = \binom{m + n}{m + r}$
positive_passages.docid: 48434
positive_passages.text: Prove that $\sum\limits_{k=0}^m\binom{m}k\binom{n}{r+k}=\binom{m+n}{m+r}$ using combinatoric arguments.
negative_passages.docid: 148442
negative_passages.text: Show that the sum $\sum_{k = 0}^n 2^k \binom{n}{k}$ is equal to $3^n$
negative_passages.docid: 89552
negative_passages.text: proving combinatorics identity - $\sum_{k=0}^m{n-k \choose m-k}={n+1 \choose m}$
negative_passages.docid: 58972
negative_passages.text: Proof/Derivation of Closed form of Binomial Expression $\sum\limits_{k=0}^{2n}(-1)^k\binom{2n}{k}^2$
negative_passages.docid: 59252
negative_passages.text: Show $\sum_{k=0}^{m} \binom{n-k}{m-k}=\binom{n+1}{m}$
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: 1167
negative_passages.text: How to prove that $\sum_{k=0}^{n}(-1)^k \binom {n}{k}=0 $
negative_passages.docid: 10211
negative_passages.text: Proving that $\sum\limits_{k=0}^{n} {{m+k} \choose{m}} = { m+n+1 \choose m+1 }$
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: 87479
negative_passages.text: Closed form for $\sum_{k=0}^{n-p}\binom{n}{k}\binom{n}{p+k}$
negative_passages.docid: 23557
negative_passages.text: Algebraic Proof that $\sum\limits_{i=0}^n \binom{n}{i}=2^n$
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: 98082
negative_passages.text: Another combinatorics problem: $\sum\limits_{k = 0}^n (-1)^k \binom{2n-k}k2^{2n-2k}=2n+1$
negative_passages.docid: 92704
negative_passages.text: Prove that $\sum_{k=1}^{n}k\binom{n}{k}=n\cdot2^{n-1}$
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: 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: 30414
negative_passages.text: Prove using combinatorics $\sum\limits_{k=0}^n 2^k \binom{n}{k} \binom{n-k}{\lfloor{\frac{n-k}{2}}\rfloor}=\binom{2n+1}{n}$