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.

5.1 BASIC IDENTITIES 161<br />

Let’s look at this derivation blow by blow. The key step is in the second line,<br />

where we apply the symmetry law (5.4) to replace (“,‘“) by (“‘,‘“). We’re<br />

allowed to do this only when m + k 3 0, so our first step restricts the range<br />

of k by discarding the terms with k < -m. (This is legal because those terms<br />

are zero.) Now we’re almost ready to apply (5.10); the third line sets this up,<br />

replacing k by k - m and tidying up the range of summation. This step, like<br />

the first, merely plays around with t-notation. Now k appears by itself in<br />

the upper index and the limits of summation are in the proper <strong>for</strong>m, so the<br />

fourth line applies (5.10). One more use of symmetry finishes the job.<br />

Certain sums that we did in Chapters 1 and 2 were actually special cases<br />

of (5.10), or disguised versions of this identity. For example, the case m = 1<br />

gives the sum of the nonnegative integers up through n:<br />

(3 + (;) +...f (y) = O+l +...+n = (n:l)n = (“:‘).<br />

And the general case is equivalent to Chapter 2’s rule<br />

Obk

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

Saved successfully!

Ooh no, something went wrong!