query: Find, $\sum_{k=0}^{n}4^k \binom{n}{k}$
positive_passages.docid: 28027
positive_passages.text: Find $\sum_{k=0}^{n}4^k \binom{n}{k}$
negative_passages.docid: 125148
negative_passages.text: Summation of series $\sum_{k=0}^\infty 2^k/\binom{2k+1}{k}$
negative_passages.docid: 123955
negative_passages.text: How to compute $\sum\limits_{k=0}^n (-1)^k{2n-k\choose k}$?
negative_passages.docid: 14399
negative_passages.text: Calculate $\sum_{k=1}^n (-1)^{k+1} \binom{n}{k}\frac{1}{k}$
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: 116461
negative_passages.text: Prove the identity $\sum_{k=0}^{n}(-1)^{k}\binom{n}{k}=0$ using a combinatorial interpretation of the positive and negative terms
negative_passages.docid: 130223
negative_passages.text: Proving a special case of the binomial theorem: $\sum^{k}_{m=0}\binom{k}{m} = 2^k$
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: 116491
negative_passages.text: Closed form for $\sum_{k=0}^{m} {\binom {m}{k}} a^{k} (b+ck)^N$
negative_passages.docid: 146200
negative_passages.text: proof by induction: sum of binomial coefficients $\sum_{k=0}^n (^n_k) = 2^n$
negative_passages.docid: 48200
negative_passages.text: Simplify $\sum_{i=0}^n (i+1)\binom ni$
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: 119107
negative_passages.text: Is it true that $\sum_{k=3}^{n}\binom{n}{k}\binom{k}{3} = \binom{n}{3}\binom{n-3}{k-3}$?
negative_passages.docid: 70248
negative_passages.text: Closed-form expression for $\sum_{k=0}^n\binom{n}kk^p$ for integers $n,\,p$
negative_passages.docid: 1258
negative_passages.text: Prove $3^n = \sum_{k=0}^n \binom {n} {k} 2^k$
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: 72026
negative_passages.text: Induction proof of $\sum_{k=1}^{n} \binom n k = 2^n -1 $