query: Show combinatorially that $S(n+1, k) = \binom n0 S(0,k-1) + \binom n1 S(1,k-1) + \cdots + \binom nn S(n,k-1)$
positive_passages.docid: 23093
positive_passages.text: Proof of recursion formula for Stirling number of the second kind
negative_passages.docid: 71564
negative_passages.text: Combinatorial proof of identity involving central binomial coefficients
negative_passages.docid: 121279
negative_passages.text: Proving an Combination formula $ \binom{n}{k} = \binom{n-1}{k}+\binom{n-1}{k-1}$
negative_passages.docid: 35342
negative_passages.text: Show that $ \sum_{n=2}^m \binom{n}{2} = \binom{m+1}{3}$
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: 37569
negative_passages.text: Prove that $\binom{n}{r} + \binom{n}{r+1} = \binom{n+1}{r+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: 147910
negative_passages.text: Prove that $\sum_{n=0}^N\binom{2N-n}N2^n(n+1)=(1+2N)\binom{2N}N$
negative_passages.docid: 25004
negative_passages.text: Proving $\binom{m}{n} + \binom{m}{n-1} = \binom{m+1}{n}$ algebraically
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}$
negative_passages.docid: 103347
negative_passages.text: combinatorial proof of summation
negative_passages.docid: 107021
negative_passages.text: Finding a combinatorial argument for an interesting identity: $\sum_k \binom nk \binom{m+k}n = \sum_i \binom ni \binom mi 2^i$
negative_passages.docid: 72639
negative_passages.text: Show that $\sum_{k=0}^n\binom{3n}{3k}=\frac{8^n+2(-1)^n}{3}$
negative_passages.docid: 10917
negative_passages.text: Give a combinatorial proof: $ n(n+1)2^{n-2} = \sum_{k=1}^{n}k^2\binom{n}{k} $
negative_passages.docid: 113321
negative_passages.text: Hint proving this $\sum_{k=0}^{n}\binom{2n}{k}k=n2^{2n-1}$
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: 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}$