Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

$${n \choose n-1} + {n+1 \choose n-2} + {n+2 \choose n-3} + \cdots + {2n - 1 \choose 0}$$

For the above series, does a closed form exist?

share|cite|improve this question
I'd say $\frac{2^{-n}\left(-(3-\sqrt{5})^n+(3+\sqrt{5})^n\right)}{\sqrt{5}}$ is a closed form. – Julian Jul 1 '12 at 17:43
@Julian: That's more of an answer than a comment. – user26872 Jul 1 '12 at 17:56
up vote 5 down vote accepted

Your series is


which is the special case of the series

$$\sum_{k\ge 0}\binom{m-k}k$$

with $m=2n-1$. It’s well-known (and easy to prove by induction) that

$$\sum_{k\ge 0}\binom{m-k}k=f_{m+1}\;,$$

where $f_m$ is the $m$-th Fibonacci number: $f_0=0,f_1=1$, and $f_n=f_{n-1}+f_{n-2}$ for $n>1$. Thus, the sum of your series is $f_{2n}$.

The Binet formula gives a closed form for $f_{2n}$: $$f_{2n}=\frac{\varphi^{2n}-\hat\varphi^{2n}}{\sqrt5}\;,$$ where $\varphi=\frac12\left(1+\sqrt5\right)$ and $\hat\varphi=\frac12\left(1-\sqrt5\right)$. A computationally more convenient expression is $$f_{2n}=\left\lfloor\frac{\varphi^{2n}}{\sqrt5}+\frac12\right\rfloor\;.$$

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.