proof of upper and lower bounds to binomial coefficient
Let be natural numbers![]()
. We’ll first prove the
inequality
![]()
We rewrite as
Since each of the parenthesized factors lies between and , we have
Since all the terms of the series are positive when is a positive real number, each term must be smaller than the whole sum; in particular, this implies that, for any non-negative integer , we have . Rearranging this slightly,
Multiplying this inequality by the previous inequality for the binomial coefficient![]()
yields
To conclude the proof we show that
| (1) |
Since each left-hand factor in (1) is , we have . Since , we immediately get
And from
we obtain
| Title | proof of upper and lower bounds to binomial coefficient |
|---|---|
| Canonical name | ProofOfUpperAndLowerBoundsToBinomialCoefficient |
| Date of creation | 2013-03-22 13:49:06 |
| Last modified on | 2013-03-22 13:49:06 |
| Owner | rspuzio (6075) |
| Last modified by | rspuzio (6075) |
| Numerical id | 12 |
| Author | rspuzio (6075) |
| Entry type | Proof |
| Classification | msc 05A10 |