sum(C(n,k), k=0 to n) = 2^n. sum(kC(n,k), k=0 to n) = n2^(n-1). sum(*C(n,k), k=0 to n) = n(n+1)2^(n-2). Alternating: sum((-1)^kC(n,k)) = 0. These are derived by differentiating or applying operators to (1+x)^n. Appear in probability and combinatorics JEE problems.
Part of ALG-10 — Mathematical Induction & Summation
Sum Involving Binomial Coefficients
Like these notes? Save your own copy and start studying with NoteTube's AI tools.
Sign up free to clone these notes