|
|
|
|
upper and lower bounds to binomial coefficient
|
(Theorem)
|
|
|
Given two integers $n,k>0$ such that $k\le n$ , we have the following inequalities for the binomial coefficient ${n\choose k}$ : \begin{eqnarray*} {n \choose k} & \le & \frac{n^k}{k!} \\ {n \choose k} & \le & \left(\frac{n\cdot e}{k}\right)^k \\ {n \choose k} & \ge & \left(\frac{n}{k}\right)^k \\ \end{eqnarray*}Here $e$ is the base of natural
logarithms. Also, for large $n$ , ${n \choose k} \approx \frac{n^k}{k!}$ .
|
"upper and lower bounds to binomial coefficient" is owned by rspuzio. [ full author list (2) | owner history (1) ]
|
|
(view preamble | get metadata)
Cross-references: natural logarithms, base, binomial coefficient, inequalities, integers
This is version 3 of upper and lower bounds to binomial coefficient, born on 2003-03-04, modified 2004-11-20.
Object id is 4074, canonical name is UpperAndLowerBoundsToBinomialCoefficient.
Accessed 8400 times total.
Classification:
| AMS MSC: | 05A10 (Combinatorics :: Enumerative combinatorics :: Factorials, binomial coefficients, combinatorial functions) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|