2. Binomial estimates

Prerequisites:

Binomial coefficients are important for studying prime numbers, as we’ll see in the post The product of the first prime numbers. Let’s see in detail some of their properties, that will be useful for our purposes. In particular, these properties are estimates: two underestimations and one overestimation. The reason why we are looking for some estimates for binomials is that their definition reveals particularly hard to manipulate both in calculations and in analytical reasonings: therefore it’s often preferable to use an estimate, affected by error but easier to use, rather than the exact value.

The first two estimates are easily obtained recalling the link between binomial coefficients and the so called Pascal’s triangle:

1
1\; 1
1\; 2\; 1
1\; 3\; 3\; 1
1\; 4\; 6\; 4\; 1
1\; 5\; 10\; 10\; 5\; 1
1\; 6\; 15\; 20\; 15\; 6\; 1
\dots

This triangle has many interesting properties, well known in scholastic math. Those we are most interested in, are the following:

  • Numbering rows starting from 0, the sum of the numbers on row number n is 2^n
  • Every row is symmetric: it remains unchanged if read from right to left or from left to right
  • Every number different from 1 is the sum of the two numbers immediately above
  • Numbering also the numbers in each row starting from 0, from left to right, the number in position m on row number n, with n > 0, is the binomial \binom{n}{m}

The last property, in particular, indicates the connection between the Pascal’s Triangle and the binomial coefficients. In fact, by vitue of this property, the triangle can be rewritten as follows:

1
\binom{1}{0}\; \binom{1}{1}
\binom{2}{0}\; \binom{2}{1}\; \binom{2}{2}
\binom{3}{0}\; \binom{3}{1}\; \binom{3}{2}\; \binom{3}{3}
\binom{4}{0}\; \binom{4}{1}\; \binom{4}{2}\; \binom{4}{3}\; \binom{4}{4}
\binom{5}{0}\; \binom{5}{1}\; \binom{5}{2}\; \binom{5}{3}\; \binom{5}{4}\; \binom{5}{5}
\binom{6}{0}\; \binom{6}{1}\; \binom{6}{2}\; \binom{6}{3}\; \binom{6}{4}\; \binom{6}{5}\; \binom{6}{6}
\dots

Hence the properties of the triangle immediately reflect to just as many properties of binomial coefficients. For example, considering the sixth row, that is row number 5 starting from 0, the first property states that:

1 + 5 + 10 + 10 + 5 + 1 = 32 = 2^5 \tag{1}

that is the sum of the numbers of a row is 2 powered to the row number.
This property, “translated” into binomial coefficients, becomes

\binom{5}{0} + \binom{5}{1} + \binom{5}{2} + \binom{5}{3} + \binom{5}{4} + \binom{5}{5} = 2^5 \tag{2}

But what is not evident in this second formulation, but does in (1), is that binomial coefficients appearing in symmetrical places are equal (by the second property): in fact, comparing (1) with (2), we have that:

\binom{5}{0} = \binom{5}{5} = 1
\binom{5}{1} = \binom{5}{4} = 5
\binom{5}{2} = \binom{5}{3} = 10

This simple fact is the basis for the first estimate. In fact, if every binomial is repeated twice in a row, twice the amount (that is the sum of the two repetitions) certainly is less than or equal to the sum of the row itself, in this case 2^5. For example:

2 \cdot \binom{5}{1} = \binom{5}{1} + \binom{5}{1} = \binom{5}{1} + \binom{5}{4} \leq \binom{5}{0} + \mathbf{\binom{5}{1}} + \binom{5}{2} + \binom{5}{3} + \mathbf{\binom{5}{4}} + \binom{5}{5} = 2^5

So 2 \cdot \binom{5}{1} \leq 2^5, that is \binom{5}{1} \leq 2^4, which is exactly the first estimate (though the proof should be completed, because numbers are not always repeated in a row: in rows with an odd number of element there is a central element which is not repeated):

Overestimation of binomials

For all n > 0 and for all m:

\binom{n}{m} \leq 2^{n-1} \tag{3}

It’s not necessary to specify that 0 \leq m \leq n, as it could not be otherwise, because the binomial \binom{n}{m} is not defined for other values of m.

Let’s start from (1), where we have three distinct numbers, 1, 5 e 10, each repeated twice. Repetitions are due to the second property, the one about symmetry: the repeated numbers in fact are placed in opposite positions, with respect to an imaginary center of the row. Grouping these repeated numbers, from (1) we can obtain an unequality for each of them:

2 \cdot 1 = 1 + 1 \leq \mathbf{1} + 5 + 10 + 10 + 5 + \mathbf{1} = 2^5
2 \cdot 5 = 5 + 5 \leq 1 + \mathbf{5} + 10 + 10 + \mathbf{5} + 1 = 2^5
2 \cdot 10 = 10 + 10 \leq 1 + 5 + \mathbf{10} + \mathbf{10} + 5 + 1 = 2^5

At this point we would be tempted to say that the double of a number in row number n is less than or equal to the sum of the row, i.e. 2^n. However we cannot make this generalization right away. In fact in the above example every number of the row is repeated twice, but, observing the Pascal’s triangle, you can see that not all numbers are repeated, so we have to consider these cases too. In particular, the rows with an odd number of elements, that are rows number n for an even n, have a central element which is not repeated. An example is row number 4:

1\; 4\; 6\; 4\; 1

In this case we can repeat the above reasoning for the numbers 1 and 4:

2 \cdot 1 = 1 + 1 \leq \mathbf{1} + 4 + 6 + 4 + \mathbf{1} = 2^4 \tag{4}
2 \cdot 4 = 4 + 4 \leq 1 + \mathbf{4} + 6 + \mathbf{4} + 1 = 2^4 \tag{5}

However we have to understand how to prove that 2 \cdot 6 \leq 2^4, with an argument which can be generalized to all central numbers of rows with an odd number of elements. To do this, we have to get into the game the third propertu of Pascal’s triangle, one of the most known, stating that every number different from 1 is the sum of the two numbers immediately above it. In this case 6 is the sum of 3 + 3, that are the two numbers above:

1\; \mathbf{3}\; \mathbf{3}\; 1
1\; 4\; \mathbf{6}\; 4\; 1

But 3 + 3 is in turn less than or equal to the sum of the numbers of its row, so:

6 = 3 + 3 \leq 1 + \mathbf{3} + \mathbf{3} + 1 = 2^3

Multiplying by two, we have that

2 \cdot 6 \leq 2^4

which is exactly the kind of relation we wanted to obtain, equivalent to (4) and (5). In this case n = 4 but the argument can be extended to the central number of row n for any even n greater than 0. This argument does not apply to row number 0 because there is not a previous row which connect to, and indeed for this row the property is not true (the central number, 1, is also the unique number of its row and so it is equal to the row sum too; doubling it, a greater number is obtained). However we have not to care about this case, because row 0 is not important for our purposes, being binomials defined for n > 0.

Summarizing, we have proved, on the basis of the first three properties, that two times any number of a row n of the Pascal’s triangle, with n > 0, is less than or equal to 2^n, that is the sum of the row elements. But we know, from the last property of the Pascal’s triangle, that these elements are the binomials of the kind \binom{n}{m}, with m between 0 and n. So we proved that, for any n > 0 and any m,

2 \cdot \binom{n}{m} \leq 2^n

from which we obtain Property N.1.

We can note that, if n is fixed, the estimate (3) is the more accurate, the more \binom{n}{m} is big, compared to the other numbers of row n (in fact we should remember that the right side of (3) is half the sum of the numbers of row n). As you can see in the Pascal’s triangle, the numbers of a row become bigger towards the center, so the biggest binomials \binom{n}{m}, where n is fixed, are those where m is closer to \frac{n}{2}. In particulat, if n is even, the biggest binomial is \binom{n}{\frac{n}{2}}, like 6 = \binom{4}{2} in row 4; if n is odd, the biggest binomials, equal to each other, are \binom{n}{\left \lceil \frac{n}{2} \right \rceil} and \binom{n}{\left \lfloor \frac{n}{2} \right \rfloor}, like 10 = \binom{5}{2} = \binom{5}{3} in row 5. So the most accurate estimates are:

\binom{n}{\frac{n}{2}} \leq 2^{n-1} \tag{6}

for even n, and

\binom{n}{\left \lceil \frac{n}{2} \right \rceil} = \binom{n}{\left \lfloor \frac{n}{2} \right \rfloor} \leq 2^{n-1} \tag{7}

for odd n. We will need right these estimates for studying prime numbers, in the post The product of the first prime numbers.

Starting from the fact that the binomials of formulas (6) and (7) are the biggest of their rows, with similar techniques as before a second estimates can be obtained, this time an underestimation:

Underestimation of the central binomials of the Pascal’s triangle

For all n \geq 2:

\binom{n}{\frac{n}{2}} \geq \frac{2^n}{n} \tag{8}

if n is even, and

\binom{n}{\left \lceil \frac{n}{2} \right \rceil} = \binom{n}{\left \lfloor \frac{n}{2} \right \rfloor} \geq \frac{2^n}{n}

if n is odd.

Let’s start with a specific case. Considering that the binomial \binom{6}{3} is the biggest in the seventh row, we can use it for majorizing each row element, obtaining:

2^6 =
1 + 6 + 15 + 20 + 15 + 6 + 1 \leq
20 + 20 + 20 + 20 + 20 + 20 + 20 =
7 \cdot 20 \Rightarrow
20 \geq \frac{2^6}{7}

These passages can be easily generalized to a generic n, obtaining

\binom{n}{\frac{n}{2}} \geq \frac{2^n}{n + 1}

for even n, and

\binom{n}{\left \lceil \frac{n}{2} \right \rceil} = \binom{n}{\left \lfloor \frac{n}{2} \right \rfloor} \geq \frac{2^n}{n + 1}

for odd n.

We can slightly improve this estimate observing that, starting from row 2 of the Pascal’s triangle, the biggest binomial of its row is greater than or equal to 2, and this lets us to save a majorization by unifying the two 1s, for example:

2^6 =
1 + 6 + 15 + 20 + 15 + 6 + 1 =
\left(1 + 1\right) + 6 + 15 + 20 + 15 + 6 \leq
20 + 20 + 20 + 20 + 20 + 20 =
6 \cdot 20 \Rightarrow
20 \geq \frac{2^6}{6}

Generalizing for a generic n, we obtain Property N.2.

We can note that this estimate holds only for the central binomials of the rows of Pascal’s triangle, differently from the previous property, which holded for all binomials. Property N.2 is one of the elements which are necessary for the proof of the Bertrand’s postulate.

In the below picture you can see as the estimate gives by Property N.2 is rather good, at least for the first values of n: the binomials, compared with the expression \frac{2^n}{n} don’t have much greater values.

Underestimation of the central binomials of Pascal’s triangle by the expression 2n/n

Again with the aim of minorizing the binomials with functions as simple as possible, in the case of even n we can obtain an unequality similar to (8) but even simpler, starting from the definition of binomial instead of the Pascal’s triangle. Let’s take as an example the case of n = 10. By the definition of binomial we have that:

\binom{10}{5} = \frac{10!}{5! \cdot 5!} = \frac{1 \cdot 2 \cdot 3 \cdot 4 \cdot 5 \cdot 6 \cdot 7 \cdot 8 \cdot 9 \cdot 10}{(1 \cdot 2 \cdot 3 \cdot 4 \cdot 5) \cdot (1 \cdot 2 \cdot 3 \cdot 4 \cdot 5)} = \frac{6 \cdot 7 \cdot 8 \cdot 9 \cdot 10}{1 \cdot 2 \cdot 3 \cdot 4 \cdot 5}

We can rewrite the last fraction as

\frac{6 \cdot 7 \cdot 8 \cdot 9 \cdot 10}{1 \cdot 2 \cdot 3 \cdot 4 \cdot 5} = \frac{6}{1} \cdot \frac{7}{2} \cdot \frac{8}{3} \cdot \frac{9}{4} \cdot \frac{10}{5}

We can note that the last term is 2, while the others are all greater than 2 (in fact the sequence of the terms is strictly decreasing, because the numerators decrease and simultaneously the denominators increase), therefore

\frac{6}{1} \cdot \frac{7}{2} \cdot \frac{8}{3} \cdot \frac{9}{4} \cdot \frac{10}{5} \geq 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 = 2^5

Summarizing, we have that

\binom{10}{5} \geq 2^5

This relation can be easily generalized for any even n, obtaining that \binom{n}{\frac{n}{2}} \geq 2^{\frac{n}{2}} = \sqrt{2^{n}}:

Underestimation of the central binomial of Pascal’s triangle, even n

For all even n \geq 2:

\binom{n}{\frac{n}{2}} \geq \sqrt{2^{n}} \tag{9}
Comparing (9) with (8), we can note that in general \sqrt{2^{n}} \leq \frac{2^n}{n}, so the number \frac{2^n}{n} is closer to the binomial \binom{n}{\frac{n}{2}}, and the approximation (8) is more accurate. However (8) has the virtue of being simpler than (9), because n appears only one time: therefore we will use if in the future, and we will see that the low quality of the estimate will not prevent to obtain still exact asymptotic estimates.

Leave a Reply

Your email address will not be published.