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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2.4 MULTIPLE SUMS 35<br />

The middle term of this law is a sum over two indices. On the left, tj tk<br />

stands <strong>for</strong> summing first on k, then on j. On the right, tk xi stands <strong>for</strong><br />

summing first on j, then on k. In practice when we want to evaluate a double<br />

sum in closed <strong>for</strong>m, it’s usually easier to sum it first on one index rather than<br />

on the other; we get to choose whichever is more convenient.<br />

Who’s panicking? Sums of sums are no reason to panic, but they can appear confusing to<br />

I think this rule a beginner, so let’s do some more examples. The nine-term sum we began<br />

is fairly obvious<br />

compared to some<br />

with provides a good illustration of the manipulation of double sums, because<br />

of the stuff in that sum can actually be simplified, and the simplification process is typical<br />

Chapter 1. of what we can do with x x’s:<br />

x Cljbk = xCljbk[l

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

Saved successfully!

Ooh no, something went wrong!