query: Prove that $\sum^{n}_{i=0}\binom{n}{i}F_{i}=F_{2n}$
positive_passages.docid: 137215
positive_passages.text: Cesaro identity for Fibonacci numbers: $ F_{2n} = \sum_{k=1}^n \binom{n}{k} F_k$
negative_passages.docid: 60860
negative_passages.text: Combinatorial proof of $\sum_{i = 0}^{n} \binom{i}{r - 1} = \binom{n + 1}{r}$ and then use result to find a formula for $1^2 + 2^2 + \ldots + n^2$
negative_passages.docid: 136580
negative_passages.text: Proving $\sum_{k=0}^n\binom{2n}{2k} = 2^{2n-1}$
negative_passages.docid: 92440
negative_passages.text: Let $n \in \mathbb{Z}^+$, prove the identity $ \sum_{k=1}^{n-1} \binom {n} {k} \frac{kn^{n-k}}{k+1}=\frac{n(n^{n}-1)}{n+1}$
negative_passages.docid: 126312
negative_passages.text: How can you prove $\binom {2n}{2} = 2\binom{n}{2} + n^2$?
negative_passages.docid: 29828
negative_passages.text: Combinatorial proof of $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$.
negative_passages.docid: 65672
negative_passages.text: Proof of the summation $n!=\sum_{k=0}^n \binom{n}{k}(n-k+1)^n(-1)^k$?
negative_passages.docid: 59638
negative_passages.text: How to prove this result on binomial coefficients?
negative_passages.docid: 47827
negative_passages.text: Prove that $\sum^{n}_{r=0}(-1)^r\cdot \large\frac{\binom{n}{r}}{\binom{r+3}{r}} = \frac{3!}{2(n+3)}$
negative_passages.docid: 66568
negative_passages.text: Number Theory : Show that $\sum_{i=0}^\infty$ $ [\frac{n}{2^i}+\frac{1}{2}]$ $=$ $2n$
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: 40784
negative_passages.text: $\sum_{k=m}^{n}(-1)^k\binom{n}{k}\binom{k}{m}=0, n>m\geq 0$
negative_passages.docid: 1258
negative_passages.text: Prove $3^n = \sum_{k=0}^n \binom {n} {k} 2^k$
negative_passages.docid: 146533
negative_passages.text: Having problems proving $ \sum_{r=0}^{n}(r+1) \binom{n}{r} = (n+2)2^{n-1} $
negative_passages.docid: 15164
negative_passages.text: Proof of $\sum^{2N}_{n=1} \frac{(-1)^{n-1}}{n} = \sum^{N}_{n=1} \frac{1}{N+n}$
negative_passages.docid: 131692
negative_passages.text: How to show that $f_{0}f_{1}+f_{1}f_{2}+...+f_{2n-1}f_{2n} = f^{2}_{2n}$
negative_passages.docid: 128913
negative_passages.text: A proof of $\sum_{i=1}^{n}(-1)^{i-1}\binom{n}{i}\frac{1}{i}=\frac{1}{1}+\frac{1}{2}+....+\frac{1}{n}$