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.

554 ANSWERS TO EXERCISES<br />

8.24 (a) Any one of the dice ends up in J’s possession with probability<br />

p, hence p = A. Let q = A. Then the pgf <strong>for</strong> J’s total holdings<br />

; I,“+‘;$+;<br />

with mean (2n + l)p and variance (2n + l)pq, by (8.61).<br />

(b) (;)p3q2 + (;)p;'4 + (;)p' = w = .585.<br />

8.25 The pgf <strong>for</strong> the current stake after n rolls is G,(z), where<br />

Go(z) = z*;<br />

G,(z) = I;=, G, ,(~"~~')9/6, <strong>for</strong> n > 0.<br />

This problem can<br />

(The noninteger exponents cause no trouble.) It follows that Mean(G,,) =<br />

Mean(G, I ), and Var(G,) -t Mean( = f$(Var(G,, 1) + Mean(G, I 1’).<br />

perhaps be so’ved<br />

more easily without<br />

geprat;ngfunct;ons<br />

So the mean is always A, but the variance grows to ((g)” ~ l)A2.<br />

than with them.<br />

8.26 The pgf FL,,(Z) satisfies F,',,,(z) = FL,, L(z)/L; hence Mean(Ft,,) =<br />

FL,, (1) = [n 3 L]/l and F,lln (1) = [n 3 21]/L2; the variance is easily computed.<br />

(In fact, we have<br />

which approaches a Poisson distribution with mean l/1 as n + co.)<br />

8.27 (n2L3 - 3nZ21-1 + Zt:)/n(n - l)(n - 2) has the desired mean, where<br />

xk = XF + + Xk. This follows from the identities<br />

E(x211) = np3 +n(n- 1)p2p1 ;<br />

E(x:) = w3+3n(n-1)p2pl +n(n-l)(n-2)p:.<br />

Incidentally, the third cumulant is ~3 = E( (X-EX)3), but the fourth cumulant<br />

does not have such a simple expression; we have ~~ = E (( X - EX)4) - 3( VX)'.<br />

8.28 (The exercise implicitly calls <strong>for</strong> p = q =: i, but the general answer is<br />

given here <strong>for</strong> completeness.) Replace H by pz and T by qz, getting S*(z) =<br />

p2qz3/(1 -pz)(l - qz)(l -pqz’) and SB(Z) = pq2z3/(1 ~ qz)(l -pqz2). The<br />

pgf <strong>for</strong> the conditional probability that Alice wins at the nth flip, given that<br />

she wins the game, is<br />

S*(Z) _ 3 4 P 1-Pq<br />

SAtI)<br />

l-pz l-qz l-pqz2<br />

This is a product of pseudo-pgf’s, whose mean is 3+p/q+q/p+2pq/( 1 -pq).<br />

The <strong>for</strong>mulas <strong>for</strong> Bill are the same but without the factor q/( 1 -pz), so Bill’s<br />

mean is 3 + q/p + 2pq/(l -pq). When p = q = i, the answer in case (a) is

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

Saved successfully!

Ooh no, something went wrong!