asymptotics of central binomial coefficient
By making use of the expression
we may obtain estimates of the central binomialcoefficient for large values of .We begin by making some elementary algebraicmanipulations of this product:
Then we multiply this by our previous expression, factor-by-factor:
With a bit of rearrangement and manipulation, this givesus the following formula for the central binomial coefficient,
which we shall examine to obtain estimates of the centralbinomial coefficient for large .
To make use of this formula, we make two key observationsabout 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’ productfor , so we have
This limit may be reread as an approximate formula when is large:
As an example, let us consider the case . Theexact answer is . The approximateanswer is ,which agrees with the exact answer to a percent. Alsonote that the estimate is smaller than the exact answer —this is a general feature which is due to the observationmade above that the product is an decreasing function of .Moreover, this observation also implies that the percentageerror decreases as increases; in particular, the approximationis good within a percent when .
It is worth noting that same result can be obtained from Stirling’sformula. In fact, one can deduce Stirling’s formula by a similarline of reasoning.
With a little more work, wee can improve our approximation.We begin by considering the product
On the one hand, we can evaluate this product by factoringthe numerator and denominator and cancelling terms:
From this expression, it follows that the product convergesto as .On the other hand, we can multiply this product by the productwe obtained earlier termwise:
By taking limits on both sides, we conclude that
Embracing our earlier formula for the central binomialcoefficient with both hands, we obtain
Juggling terms from one hand to the other, we obtaina new formula for the central binomial coefficient:
Despite the increase in complexity, this formula isactually an improvement over the old formula. The reasonfor this is that the product converges more rapidlybecause the polynomial in the denominator is nowof 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 revisitthe case . Now, we get the approximation.Because the terms in the new product are greaterthan unity, the approximation is an overestimate,so we round it down to , which just sohappens to be the exact answer. The approximationis that good!