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

I have the expression (for some $k$ and $r$ natural numbers):

$\sum_{l=0}^r {l \choose k}$.

Is there a way to bound this expression using a polynomial of degree which is linear in $k$ (or polynomial in $k$)?

I am pretty sure that each $l \choose k$ is a polynomial of the form $O(l^k)$.

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

You sum is same as

$$ \sum_{l = k}^{r} \binom{l}{k}$$

(Note, from $k$ to $r$, assuming $\binom{a}{b} = 0$ if $a \lt b$).

This is actually equal to

$$\binom{r+1}{k+1}$$ by using

$$\binom{l+1}{k+1} - \binom{l}{k+1} = \binom{l}{k}$$

share|cite|improve this answer

According to Wolfram Alpha, this is equivalent to $$ \frac{(-k+r+1) \binom{r+1}{k}+k \binom{0}{k}}{k+1}$$

So perhaps it will be easier to bound that with a polynomial of degree $k$.

share|cite|improve this answer
Mathematica needs to work on its binomial simplification method. Is that $k(0 \choose k)$ for non-integer $k$? – Mitch Feb 4 '11 at 2:16

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.