Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Santos - Jiunior Problem Seminar - 2008 - 99-99

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

The Binomial Theorem 91

Using Pascal’s Identity we obtain Pascal’s Triangle.


 
0
  0  
1 1
  0   1  
2 2 2
  0   1   2  
3 3 3 3
  0   1   2   3  
4 4 4 4 4
  0   1   2   3   4  
5 5 5 5 5 5
0 1 2 3 4 5

When the numerical values are substituted, the triangle then looks like this.

1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1

We
 see from
 Pascal’s
 Triangle that binomial coefficients are symmetric. This symmetry is easily justified by the identity
n n
= . We also notice that the binomial coefficients tend to increase until they reach the middle, and that they
k n−k  
n
decrease symmetrically. That is, the satisfy
k
               
n n n n n n n n
< < ··· < < > > > ··· > >
0 1 [n/2] − 1 [n/2] [n/2] + 1 [n/2] + 2 n−1 n

if n is even, and that


                 
n n n n n n n n n
< < ··· < < = > > > ··· > >
0 1 [n/2] − 1 [n/2] [n/2] + 1 [n/2] + 2 [n/2] + 3 n−1 n

for odd n. We call this 


property
 the
 unimodality
 ofthe binomial
  coefficients.
  For example, without finding the exact numerical

200 200 200 200 200
values we can see that < and that = < .
17 69 131 69 99
We now present some examples on the use of binomial coefficients.

615 Example The Catalan number of order n is defined as


 
1 2n
Cn = .
n+1 n

Prove that Cn is an integer for all natural numbers n.

Solution: Observe that      


1 2n 2n 2n
= − ,
n+1 n n n−1
the difference of two integers.

You might also like