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 would like to prove by induction the following inequality:

$\frac{4^n}{n+1} < \binom{2n}{n}$, for all natural numbers n > 1.

Any hints?

share|cite|improve this question

You know that $$\binom{2(n+1)}{n+1} = \frac{2(n+1)(2n+1)}{(n+1)^2}\binom{2n}{n}.$$

The main step of the induction proof is therefore

$$\frac{4^n}{n+1} \frac{2(n+1)(2n+1)}{(n+1)^2} \ge \frac{4^{n+1}}{n+2}.$$

This inequality is easy to show after simplification.

share|cite|improve this answer
Is there any book reference for this result? Thank you. – Michael Dec 1 '12 at 14:12

One has (see this question and this one) the identity $$ 4^n=\sum_{i=0}^n\binom{2i}i\binom{2(n-i)}{n-i} $$ On the right we have $n+1$ terms, if we can show that each one of them is at most $\binom{2n}n$, and at least one is strictly less, then we will have shown $4^n<(n+1)\binom{2n}n$. Now $\binom{2n}n$ counts the lattice paths across a $n\times n$ square, while $\binom{2i}i\binom{2(n-i)}{n-i}$ counts such paths that pass through the point $(i,i)$, so the required inequalities are obvious. I'm sorry I didn't use induction.

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.