Take the 2-minute tour ×
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.

Question: $$\sum_{k=1}^{n}k\binom{2n}{n+k}=\frac n2\binom{2n}{n}$$ is true for every $n\in \mathbb N$? If this is true, then how can we prove this?

When I was with playing numbers, I conjectured this. Though I found that this holds for many $n$s, I haven't found any proof. Can anyone help?

share|improve this question
You are really good at playing with numbers –  Awesome May 12 at 16:38

2 Answers 2

up vote 7 down vote accepted

Let $S$ be the considered sum we have $$\eqalign{ S&=\sum_{k=1}^nk\binom{2n}{n+k}=\sum_{k=n+1}^{2n}(k-n)\binom{2n}{k}\cr &=\sum_{k=n+1}^{2n}k\binom{2n}{k}-n\sum_{k=n+1}^{2n} \binom{2n}{k}\cr &=2n\sum_{k=n+1}^{2n} \binom{2n-1}{k-1}-n\sum_{k=n+1}^{2n} \binom{2n}{k}\cr &=n\sum_{k=n+1}^{2n} \left(2\binom{2n-1}{k-1}- \binom{2n}{k}\right)\cr &=n\sum_{k=n+1}^{2n} \left(2\binom{2n-1}{k-1}- \binom{2n-1}{k}- \binom{2n-1}{k-1}\right)\cr &=n\sum_{k=n+1}^{2n} \left(\binom{2n-1}{k-1}- \binom{2n-1}{k}\right)\cr &=n\binom{2n-1}{n}=\frac{n}{2}\binom{2n}{n}. }$$ which the desired conclusion.$\qquad\square$

share|improve this answer
Thanks a lot! I like your answer. –  mathlove May 13 at 10:43

$$\eqalign{\sum_{k=1}^n k\binom{2n}{n+k}&=\sum_{k=1}^n (n+k)\binom{2n}{n+k}-n\sum_{k=1}^n\binom{2n}{n+k}\cr &=\sum_{k=n+1}^{2n} k\binom{2n}{k}-\frac{n}{2}(\sum_{k=0}^{2n}\binom{2n}{k}-\binom{2n}{n})\cr&=2n\sum_{k=n+1}^{2n}\binom{2n-1}{k-1}-\frac{n}{2}(2^{2n})+\frac{n}{2}\binom{2n}{n}\cr&=n\sum_{k=0}^{2n-1}\binom{2n-1}{k}-\frac{n}{2}(2^{2n})+\frac{n}{2}\binom{2n}{n}\cr&=\frac{n}{2}\binom{2n}{n} }$$

share|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.