PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] 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)

View style:


This object's parent.

Attachments:
proof of upper and lower bounds to binomial coefficient (Proof) by rspuzio
Log in to rate this entry.
(view current ratings)

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 MSC05A10 (Combinatorics :: Enumerative combinatorics :: Factorials, binomial coefficients, combinatorial functions)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)