For convenience, lets replace , so that it is equivalent to show . We need a good bound for the partial sum in LHS, so consider
As , we get the bound for the partial sum. Now, using an easily found and rather well known upper bound for binomial coefficients, viz. , it is enough to show
which is straightforward by induction.
Did you like this example?