Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How can i prove that $\displaystyle\sum_{k=0}^{n}{2n\choose 2k}=2^{2n-1}$

I tried using induction and pascal's identity but it didn't help me.

share|cite|improve this question
up vote 10 down vote accepted

We know:$\displaystyle (1+x)^{2n}=\sum_{j=0}^{2n}{2n \choose j}x^j$ .

Now put $x=1$ and and $x=-1$ in turn and add,

$\displaystyle 2^{2n}=(1+1)^{2n}+(1-1)^{2n}=\sum_{j=0}^{2n}{2n \choose j}+\sum_{j=0}^{2n}{2n \choose j}(-1)^j=\sum_{j=0}^{n}{2n \choose 2j}+\sum_{j=0}^{n-1}{2n \choose 2j+1}+\sum_{j=0}^{n}{2n \choose 2j}-\sum_{j=0}^{n-1}{2n \choose 2j+1}=2\sum_{j=0}^{n}{2n \choose 2j}$

$\displaystyle \Rightarrow 2^{2n-1}=\sum_{j=0}^{n}{2n \choose 2j}$

share|cite|improve this answer
Can you please explain this transition? $\sum_{j=0}^{2n}{2n \choose j}+\sum_{j=0}^{2n}{2n \choose j}(-1)^j=2\sum_{j=0}^{n}{2n \choose 2j}$ – Dan Barzilay Jul 9 '13 at 16:23
@DanBarzilay now I think it will be clear. – Abhra Abir Kundu Jul 9 '13 at 17:35

The number of ways to select an even subset out of a $2n$-set, is th enumber of ways to select an arbitrary subset among the first $2n-1$ elements and then either take the last element or not to ensure an even number.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.