09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Binomial coefficients<br />

were well known<br />

in Asia, many centuries<br />

be<strong>for</strong>e Pascal<br />

was born 1741, but<br />

he bad no way to<br />

know that.<br />

In Italy it’s called<br />

Tartaglia’s triangle.<br />

5.1 BASIC IDENTITIES 155<br />

Be<strong>for</strong>e getting to the identities that we will use to tame binomial coefficients,<br />

let’s take a peek at some small values. The numbers in Table 155 <strong>for</strong>m<br />

the beginning of Pascal’s triangle, named after Blaise Pascal (1623-1662)<br />

Table 155 Pascal’s triangle.<br />

n<br />

0<br />

1<br />

2<br />

3I4<br />

5<br />

6<br />

7<br />

8<br />

9<br />

10<br />

1<br />

1 1<br />

12 1<br />

13 3 1<br />

14 6 4 1<br />

1 5 10 10 5 1<br />

1 6 15 20 15 6 1<br />

1 7 21 35 35 21 7 1<br />

1 8 28 56 70 56 28 8 1<br />

1 9 36 84 126 126 84 36 9 1<br />

1 10 45 120 210 252 210 120 45 10 1<br />

because he wrote an influential treatise about them [227]. The empty entries<br />

in this table are actually O’s, because of a zero in the numerator of (5.1); <strong>for</strong><br />

example, (l) = ( 1.0)/(2.1) = 0. These entries have been left blank simply to<br />

help emphasize the rest of the table.<br />

It’s worthwhile to memorize <strong>for</strong>mulas <strong>for</strong> the first three columns,<br />

r<br />

0<br />

=I, (;)=?., (;)2g;<br />

these hold <strong>for</strong> arbitrary reals. (Recall that (“T’) = in(n + 1) is the <strong>for</strong>mula<br />

we derived <strong>for</strong> triangular numbers in Chapter 1; triangular numbers are conspicuously<br />

present in the (;) column of Table 155.) It’s also a good idea to<br />

memorize the first five rows or so of Pascal’s triangle, so that when the pattern<br />

1, 4, 6, 4, 1 appears in some problem we will have a clue that binomial<br />

coefficients probably lurk nearby.<br />

The numbers in Pascal’s triangle satisfy, practically speaking, infinitely<br />

many identities, so it’s not too surprising that we can find some surprising<br />

relationships by looking closely. For example, there’s a curious “hexagon<br />

property,” illustrated by the six numbers 56, 28, 36, 120, 210, 126 that surround<br />

84 in the lower right portion of Table 155. Both ways of multiplying<br />

alternate numbers from this hexagon give the same product: 56.36.210 =<br />

28.120.126 = 423360. The same thing holds if we extract such a hexagon<br />

from any other part of Pascal’s triangle.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!