asymptotics of central binomial coefficient
By making use of the expression
Then we multiply this by our previous expression, factor-by-factor:
With a bit of rearrangement and manipulation, this gives us the following formula for the central binomial coefficient,
which we shall examine to obtain estimates of the central binomial coefficient for large .
To make use of this formula, we make two key observations about the product which appears on the right-hand side. First, since each of the terms in the product lies between and , the product is an decreasing function of , Thus, we have
when . Secondly, the product converges in the limit . In fact, it turns out to be Wallis’ product for , so we have
This limit may be reread as an approximate formula when is large:
As an example, let us consider the case . The exact answer is . The approximate answer is , which agrees with the exact answer to a percent. Also note that the estimate is smaller than the exact answer — this is a general feature which is due to the observation made above that the product is an decreasing function of . Moreover, this observation also implies that the percentage error decreases as increases; in particular, the approximation is good within a percent when .
It is worth noting that same result can be obtained from Stirling’s formula. In fact, one can deduce Stirling’s formula by a similar line of reasoning.
With a little more work, wee can improve our approximation. We begin by considering the product
From this expression, it follows that the product converges to as . On the other hand, we can multiply this product by the product we obtained earlier termwise:
By taking limits on both sides, we conclude that
Embracing our earlier formula for the central binomial coefficient with both hands, we obtain
Juggling terms from one hand to the other, we obtain a new formula for the central binomial coefficient:
Despite the increase in complexity, this formula is actually an improvement over the old formula. The reason for this is that the product converges more rapidly because the polynomial in the denominator is now of the fourth order.
As before, we may take the limit :
This gives us a new, improved asymptotic formula:
To see just how good this formula is, let us revisit the case . Now, we get the approximation . Because the terms in the new product are greater than unity, the approximation is an overestimate, so we round it down to , which just so happens to be the exact answer. The approximation is that good!
|Title||asymptotics of central binomial coefficient|
|Date of creation||2013-03-22 17:40:50|
|Last modified on||2013-03-22 17:40:50|
|Last modified by||rspuzio (6075)|