query: Prove that ${n\choose 0}+{n+1\choose 1}+\dots +{n+k\choose k}={n+k+1\choose k}$
positive_passages.docid: 8476
positive_passages.text: Proof of the Hockey-Stick Identity: $\sum\limits_{t=0}^n \binom tk = \binom{n+1}{k+1}$
negative_passages.docid: 44484
negative_passages.text: Combinatorial identity $i{n \choose i } =n {n-1 \choose i - 1}$
negative_passages.docid: 74730
negative_passages.text: Combinatorial Proof of ${{n}\choose{k}} {{k}\choose{j}} = {{n}\choose{j}} {{n-j}\choose{k-j}}$
negative_passages.docid: 63879
negative_passages.text: Prove that $\sum_{k=0}^r {m \choose k} {n \choose r-k} = {m+n \choose r}$
negative_passages.docid: 37569
negative_passages.text: Prove that $\binom{n}{r} + \binom{n}{r+1} = \binom{n+1}{r+1} $
negative_passages.docid: 116913
negative_passages.text: Whats the difference between the following? $n+k-1 \choose k$ ${{n+k-1}\choose{k-1}}$ ${{n+k-1}\choose{n}}$
negative_passages.docid: 34738
negative_passages.text: Prove that $\gcd(n!+1,(n+1)!+1)=1$
negative_passages.docid: 120976
negative_passages.text: Proving $\sum_{k=0}^{n}k{n\choose k}^2 = n{2n-1 \choose n-1} $
negative_passages.docid: 109576
negative_passages.text: Prove that $\binom{m+n}{m}=\sum\limits_{i=0}^m \binom{m}{i}\binom{n}{i}$
negative_passages.docid: 6366
negative_passages.text: Combinatorial proof of summation of $\sum\limits_{k = 0}^n {n \choose k}^2= {2n \choose n}$
negative_passages.docid: 1158
negative_passages.text: How to prove this binomial identity $\sum_{r=0}^n {r {n \choose r}} = n2^{n-1}$?
negative_passages.docid: 34929
negative_passages.text: Prove ${M}\choose{N_1}$ ${M}\choose{N_2}$ $\leq$ ${2M}\choose{N_1+N_2}$ for $M, N_1, N_2 \in \mathbb{N},\,M\geq N_1,N_2$.
negative_passages.docid: 54442
negative_passages.text: Sum of $k {n \choose k}$ is $n2^{n-1}$
negative_passages.docid: 20317
negative_passages.text: Proving $\sum_{k=1}^{n}{(-1)^{k+1} {{n}\choose{k}}\frac{1}{k}=H_n}$
negative_passages.docid: 133150
negative_passages.text: Fibonacci combinatorial identity: $F_{2n} = {n \choose 0} F_0 + {n\choose 1} F_1 + ... {n\choose n} F_n$
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: 59006
negative_passages.text: Proof of $\gcd(n!+1, (n+1)!+1)=1$?