query: How to show that ${m \choose n} + {m \choose n-1} = {m+1 \choose n}$?
positive_passages.docid: 25004
positive_passages.text: Proving $\binom{m}{n} + \binom{m}{n-1} = \binom{m+1}{n}$ algebraically
negative_passages.docid: 4991
negative_passages.text: Proving by induction that $ \sum_{k=0}^n{n \choose k} = 2^n$
negative_passages.docid: 62382
negative_passages.text: I suppose $(a,m)=(a-1,m)=1$, show that $1+a+a^2+\ldots+a^{\phi(m)-1}\equiv0\pmod m$
negative_passages.docid: 93031
negative_passages.text: How to show that $\mathbb{Z}$ with the operation $m*n=m+(-1)^m n$ is associative?
negative_passages.docid: 44484
negative_passages.text: Combinatorial identity $i{n \choose i } =n {n-1 \choose i - 1}$
negative_passages.docid: 24588
negative_passages.text: Proving the combinatorial identity ${n \choose k} = {n-2\choose k-2} + 2{n-2\choose k-1} + {n-2\choose k}$
negative_passages.docid: 37252
negative_passages.text: How can I show that $\begin{pmatrix} 1 & 1 \\ 0 & 1\end{pmatrix}^n = \begin{pmatrix} 1 & n \\ 0 & 1\end{pmatrix}$?
negative_passages.docid: 120074
negative_passages.text: Prove by Combinatorial Argument that $\binom{n}{k}= \frac{n}{k} \binom{n-1}{k-1}$
negative_passages.docid: 142666
negative_passages.text: Algebric proof for the identity $n(n-1)2^{n-2}=\sum_{k=1}^n {k(k-1) {n \choose k}}$
negative_passages.docid: 92784
negative_passages.text: Intuitive (combinatorial) proof of $2^n=\sum_{k=0}^n {n\choose k}$
negative_passages.docid: 37569
negative_passages.text: Prove that $\binom{n}{r} + \binom{n}{r+1} = \binom{n+1}{r+1} $
negative_passages.docid: 136037
negative_passages.text: ${n\choose 2} - {k\choose 2} = {n-k\choose 2} +k(n-k)$ Marked box or unmarked box
negative_passages.docid: 5149
negative_passages.text: Show $\binom{a}{b}\binom{b}{c}=\binom{a}{a-c}\binom{a-c}{a-b}$
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: 40784
negative_passages.text: $\sum_{k=m}^{n}(-1)^k\binom{n}{k}\binom{k}{m}=0, n>m\geq 0$
negative_passages.docid: 48839
negative_passages.text: Show that the order of $a\times b$ is equal to $nm$ if gcd(n,m)=1
negative_passages.docid: 35381
negative_passages.text: Sum with binomial coefficients: $\sum_{k=1}^m  \frac{1}{k}{m \choose k} $