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.

8 EXERCISES 423<br />

C What is the average total number of tickets you buy, if you continue<br />

to play until going broke?<br />

d What is the average number of games until you lose everything if<br />

A doubledoubloon. you start with two doubloons instead of just one?<br />

Bonus problems<br />

52<br />

53<br />

54<br />

55<br />

56<br />

57<br />

Show that the text’s definitions of median and mode <strong>for</strong> random variables<br />

correspond in some meaningful sense to the definitions of median and<br />

mode <strong>for</strong> sequences, when the probability space is finite.<br />

Prove or disprove: If X, Y, and Z are random variables with the property<br />

that all three pairs (X, Y), (X, Z) and (Y, Z) are independent, then X + Y<br />

is independent of Z.<br />

Equation (8.20) proves that the average value of \iX is VX. What is the<br />

variance of VX?<br />

A normal deck of playing cards contains 52 cards, four each with face<br />

values in the set {A,2,3,4,5,6,7,8,9,1O,J,Q,K}. Let X and Y denote<br />

the respective face values of the top and bottom cards, and consider the<br />

following algorithm <strong>for</strong> shuffling:<br />

Sl Permute the deck randomly so that each arrangement occurs with<br />

probability l/52!.<br />

S2 If X # Y, flip a biased coin that comes up heads with probability p,<br />

and go back to step Sl if heads turns up. Otherwise stop.<br />

Each coin flip and each permutation is assumed to be independent of all<br />

the other randomizations. What value of p will make X and Y independent<br />

random variables after this procedure stops?<br />

Generalize the frisbee problem of exercise 48 from a pentagon to an<br />

n-gon. What are the mean and variance of the number of collision-free<br />

throws in general, when the frisbees are initially at adjacent vertices?<br />

Show that, if m is odd, the pgf <strong>for</strong> the number of throws can be written<br />

as a product of coin-flipping distributions:<br />

(m-1 l/2<br />

Pk=<br />

G,(z) = n ~<br />

k=, 1 -qkz’<br />

2 (2k- 1)~<br />

where pk = sin<br />

2m<br />

Hint: Try the substitution z = l/cos2 0.<br />

, qk = cos2 ‘2k2-; In.<br />

Prove that the Penney-ante pattern ‘~1~2 . . . ~~~1~1 is always inferior to<br />

the pattern jszrlr2 . . . ‘cl-1 when a fair coin is flipped, if 1 3 3.

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

Saved successfully!

Ooh no, something went wrong!