Compute ${11 \choose 1} + {11 \choose 3} + ... + {11 \choose 11}$? I did this with brute force, and got 1024.
What is the faster method of solving this?
 A: Since $\binom{11}{1}=\binom{11}{10},\binom{11}{3}=\binom{11}{8}$ and so on,
$$ \binom{11}{1}+\binom{11}{3}+\ldots+\binom{11}{11} = \binom{11}{10}+\binom{11}{8}+\ldots+\binom{11}{0} $$
so both the terms are half the sum $\binom{11}{0}+\binom{11}{1}+\binom{11}{2}+\ldots+\binom{11}{11}=2^{11}$, i.e. $2^{10}=\color{red}{1024}$.
A: Usually you break up ${n+1\choose k}, k\le n$ into ${n\choose k-1}+{n\choose k}$. This is one of the first tricks you learn from probably every baby probability textbook. For your problem:
$${11\choose 1}+{11\choose 3}+...+{11\choose 9}+{11\choose 11}=\left({10\choose 0}+{10\choose 1}\right)+\left({10\choose 2}+{10\choose 3}\right)+...+\left({10\choose 8}+{10\choose 9}\right)+{10\choose 10}=(1+1)^{10}$$
by recognizing ${11\choose 11}={10\choose 10}$.
A: Since any time you choose an odd number of elements out of a set of eleven, you leave behind an even number of elements, 
$$
\sum_{k\text{ odd}} \binom{11}{k} = \sum_{k\text{ even}} \binom{11}{k} 
$$
So the number of ways of choosing any subset of eleven elements is twice the number of ways of choosing an odd number of elements.
But to choose any subset, each element is either in our out of the chosen subset:  Than gives $2^{11}$.
So the number of ways to choose an odd number of elements is 
$$\frac12\cdot 2^{11} = 2^{10} = 1024$$
P.S. This reasoning does not work when the main set has an even number of elements.  But the property of the number of ways to choose an odd number of elements being half the total number of subsets still holds.  Can you see why?
A: I don't know if this is the fastest method, but you can use the binomial theorem twice: $$2^{11}=(1+1)^{11}=\sum_{i=0}^{11}\binom{11}{i}$$ and $$0=(1-1)^{11}=\sum_{i=0}^{11}\binom{11}{i}(-1)^i.$$ Upon subtracting these two results and dividing by two, we obtain the result.
A: You might recoginize ${m \choose  n}$ as the co-efficient of the $x^n$ term in the binomial expansion of $(x+1)^m$
So the sum of all of the coefficients equals
$(1+1)^m$
In your example above only have the odd coefficients.
${11 \choose n} ={11 \choose 11-n}$
For every odd coefficient you have a symmetric even counterpart.
$\sum_\limits {i=0}^{5} {11\choose 2i+1} = \frac 12 \sum_\limits {i=0}^{11}  {11\choose i} = 2^{10}$
A: $\newcommand{\bbx}[1]{\,\bbox[15px,border:1px groove navy]{\displaystyle{#1}}\,}
 \newcommand{\braces}[1]{\left\lbrace\,{#1}\,\right\rbrace}
 \newcommand{\bracks}[1]{\left\lbrack\,{#1}\,\right\rbrack}
 \newcommand{\dd}{\mathrm{d}}
 \newcommand{\ds}[1]{\displaystyle{#1}}
 \newcommand{\expo}[1]{\,\mathrm{e}^{#1}\,}
 \newcommand{\ic}{\mathrm{i}}
 \newcommand{\mc}[1]{\mathcal{#1}}
 \newcommand{\mrm}[1]{\mathrm{#1}}
 \newcommand{\pars}[1]{\left(\,{#1}\,\right)}
 \newcommand{\partiald}[3][]{\frac{\partial^{#1} #2}{\partial #3^{#1}}}
 \newcommand{\root}[2][]{\,\sqrt[#1]{\,{#2}\,}\,}
 \newcommand{\totald}[3][]{\frac{\mathrm{d}^{#1} #2}{\mathrm{d} #3^{#1}}}
 \newcommand{\verts}[1]{\left\vert\,{#1}\,\right\vert}$
\begin{align}
\sum_{k = 0}^{5}{11 \choose 2k + 1} & =
\sum_{k = 0}^{10}{11 \choose k + 1}{1 + \pars{-1}^{k} \over 2} =
\sum_{k = 1}^{11}{11 \choose k}{1 - \pars{-1}^{k} \over 2}
\\[5mm] & =
{1 \over 2}\underbrace{\sum_{k = 0}^{11}{11 \choose k}}_{\ds{2^{11} = 2048}}\ -\ {1 \over 2}\underbrace{\sum_{k = 0}^{11}{11 \choose k}\pars{-1}^{k}}_{\ds{=\ 0}}\ = \bbx{\ds{1024}} 
\end{align}
