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.

A ANSWERS TO EXERCISES 551<br />

562 z 12.5. (This distribution has ~4 = 2974, which is rather large. Hence the<br />

45<br />

standard deviation of this variance estimate when n = 10 is also rather large,<br />

J2974/10 + 2(22)2/9 M 20.1 according to exercise 54. One cannot complain<br />

that the students cheated.)<br />

a.4 This follows from (8.38) and (88g), because F(z) = G(z)H(z). (A<br />

similar <strong>for</strong>mula holds <strong>for</strong> all the cumulants, even though F(z) and G(z) may<br />

have negative coefficients.)<br />

8.5 Replace H by p and T by q = 1 -p. If SA = Ss = i we have p2qN = i<br />

and pq2N = iq + i; the solution is p = l/~$~, q = l/G.<br />

8.6 In this case Xly has the same distribution as X, <strong>for</strong> all y, hence<br />

E(XIY) = EX is constant and V(E(XlY)) = 0. Also V(XlY) is constant and<br />

equal to its expected value.<br />

8.7 We have 1 = (PI +pz+.+.+ps)’ 6 6(p~+p~+.~.+p~) by Chebyshev’s<br />

summation inequality of Chapter 2.<br />

8.8 Let p = Pr(wEAflB), q = Pr(~ueA), and r = Pr(w$B). Then<br />

p+q+r=l,andtheidentitytobeprovedisp=(p+r)(p+q)-qr.<br />

8.9 This is true (subject to the obvious proviso that F and G are defined<br />

on the respective ranges of X and Y), because<br />

Pr(F(X)=f and G(Y)=g) = x Pr(X=xandY=y)<br />

Y&F-‘(~)<br />

YEG-‘(9)<br />

= x Pr(X=x) .Pr(Y=y)<br />

c&F-‘(f)<br />

YEG-‘(9)<br />

= Pr(F(X) =f) . Pr(G(y) = g) .<br />

8.10 Two. Let x1 < x2 be medians; then 1 < Pr(Xxz) <<br />

1, hence equality holds. (Some discrete distributions have no median elements.<br />

For example, let n be the set of all fractions of the <strong>for</strong>m &l/n, with<br />

Pr(+l/n) = Pr(-l/n) = $n2.)<br />

8.11 For example, let K = k with probability 4/( k + 1) (k + 2) (k + 3)) <strong>for</strong> all<br />

integers k 3 0. Then EK = 1, but E(K’) = 00. (Similarly we can construct<br />

random variables with finite cumulants through K, but with K,+I = co.)<br />

8.12 (a) Let pk = Pr(X = k). If 0 < x < 1, we have Pr(X 6 r) = tk

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

Saved successfully!

Ooh no, something went wrong!