query: $\sum_{k=0}^n \binom{n}{k}^2 = \binom{2n}{n}?$
positive_passages.docid: 6366
positive_passages.text: Combinatorial proof of summation of $\sum\limits_{k = 0}^n {n \choose k}^2= {2n \choose n}$
negative_passages.docid: 83400
negative_passages.text: Sum of products of binomial coefficients: $ \sum_{l=0}^{n-j} \binom{M-1+l}{l} \binom{n-M-l}{n-j-l} = \binom{n}{j} $
negative_passages.docid: 143047
negative_passages.text: find $\sum_{k=0}^{t}(-1)^k\binom{t}{k}^2$ for odd t then for even t
negative_passages.docid: 148949
negative_passages.text: Find the value of $\sum_{k=1}^{n} k \binom {n} {k}$
negative_passages.docid: 126888
negative_passages.text: How can you show that $\binom {n}{7}=\sum_{k=7}^n \binom {k-1} {6}$?
negative_passages.docid: 84010
negative_passages.text: Combinatorial proof that $\sum \limits_{k=0}^n \binom{2k}{k} \binom{2n-2k}{n-k} (-1)^k = 2^n \binom{n}{n/2}$ when $n$ is even
negative_passages.docid: 133905
negative_passages.text: Intuitive proof of $\sum_{k=1}^{n} \binom{n}{k} k^{k-1} (n-k)^{n-k} = n^n$
negative_passages.docid: 143113
negative_passages.text: Non-inductive, not combinatorial proof of $\sum_{i \mathop = 0}^n \binom n i^2 = \binom {2 n} n$
negative_passages.docid: 36361
negative_passages.text: How to calculate the summation $(\sum_{p = k}^{n} \binom{n}{p}) / 2^n$ quickly?
negative_passages.docid: 71797
negative_passages.text: Combinatorial argument for $\sum\limits_{k=i}^{n}\binom{n}{k}\binom{k}{i} = \binom{n}{i}2^{n-i}$
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: 14239
negative_passages.text: How to show $\sum_{k=0}^{n}\binom{n+k}{k}\frac{1}{2^k}=2^{n}$
negative_passages.docid: 139842
negative_passages.text: Seeking a combinatorial proof $\sum\limits _{k=0}^n (n-2k)^2\binom{n}{k}=n\times 2^n$
negative_passages.docid: 96945
negative_passages.text: General formula of $\sum_{n\ge1}{\binom{2n}{n}^{-k}}$.
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: 136580
negative_passages.text: Proving $\sum_{k=0}^n\binom{2n}{2k} = 2^{2n-1}$
negative_passages.docid: 103840
negative_passages.text: Calculate $\sum_{k=1}^n k2^{n-k}$