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.

386 DISCRETE PROBABILITY<br />

where Ug is the pgf <strong>for</strong> the uni<strong>for</strong>m distribution of order 6. The factor ‘z’<br />

adds 1 to the mean, so the m’ean is 3.5 instead of y = 2.5 as given in (8.35);<br />

but an extra ‘z’ does not affect the variance (8.36), which equals g.<br />

The pgf <strong>for</strong> total spots on two independent dice is the square of the pgf<br />

<strong>for</strong> spots on one die,<br />

Gs(z) = z2+2z3+3z4+4z5+5z6+6z7+5z8+4~9+3~10+2~11+Z12<br />

36<br />

= 22u&)z.<br />

If we roll a pair of fair dice n times, the probability that we get a total of<br />

k spots overall is, similarly,<br />

[zk] Gs(z)” = [zk] zZnU~;(z) 2n<br />

= [zkp2y u(; (z)2n<br />

In the hats-off-to-football-victory problem considered earlier, otherwise Hat distribution is<br />

known as the problem of enumerating the fixed points of a random permutation,<br />

we know from (5.49) that the pgf is<br />

a different kind of<br />

uni<strong>for</strong>m distribution.<br />

There<strong>for</strong>e<br />

F,(z) = t (n?!<br />

O

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

Saved successfully!

Ooh no, something went wrong!