query: Proving that $\binom{r}{r} + \binom{r + 1}{r} + \cdots + \binom{n}{r} = \binom{n + 1}{r + 1}$
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: 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: 94580
negative_passages.text: Prove that, $\binom{3n}{r}=\binom{3n-1}{r} + \binom{3n-1}{r-1}$
negative_passages.docid: 111298
negative_passages.text: Direct Proof that $1 + 3 + 5 + \cdots+ (2n - 1) = n\cdot n$
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: 76368
negative_passages.text: Proving the Binomial theorem
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: 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: 44621
negative_passages.text: Simple binomial theorem proof: $\sum_{j=0}^{k} \binom{a+j}j = \binom{a+k+1}k$
negative_passages.docid: 49771
negative_passages.text: Prove that $\sum\limits_{k=0}^r\binom{n+k}k=\binom{n+r+1}r$ using combinatoric arguments.
negative_passages.docid: 128093
negative_passages.text: Regarding the values that n and r can take in $\binom{n}{r}$
negative_passages.docid: 25004
negative_passages.text: Proving $\binom{m}{n} + \binom{m}{n-1} = \binom{m+1}{n}$ algebraically
negative_passages.docid: 87411
negative_passages.text: Prove that $\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_n} \geq (n-1) \left (\frac{1}{\sqrt{x_1}}+\frac{1}{\sqrt{x_2}}+\cdots+\frac{1}{\sqrt{x_n}} \right )$
negative_passages.docid: 158508
negative_passages.text: Combinatorial Proof for Binomial Identity: $\sum_{k = 0}^n \binom{k}{p} = \binom{n+1}{p+1}$
negative_passages.docid: 133181
negative_passages.text: Hint on how to prove the identity $\sum_{0 \leq k \leq n } \binom{k}{m} = \binom{n + 1}{m + 1}$
negative_passages.docid: 61666
negative_passages.text: Proving $ [(\vec{a}+\vec{b})\times(\vec{b}+\vec{c})]\cdot(\vec{c}+\vec{a})=2\vec{c}\cdot(\vec{b}\times\vec{a})$
negative_passages.docid: 59252
negative_passages.text: Show $\sum_{k=0}^{m} \binom{n-k}{m-k}=\binom{n+1}{m}$