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.

368 DISCRETE PROBABILITY<br />

total of 6’ = 36 elements.<br />

We usually assume that dice are “fair,” namely that each of the six possibilities<br />

<strong>for</strong> a particular die has probability i, and that each of the 36 possible<br />

rolls in n has probability 8. But we can also consider “loaded” dice in which Careful: They<br />

there is a different distribution of probabilities. For example, let<br />

might go off.<br />

Prl(m) = Pr,(m) = +;<br />

Prl(a) = Prl(m) = Prj(m) = Prl(m) = f.<br />

Then LED Prl (d) = 1, so Prl is a probability distribution on the set D, and<br />

we can assign probabilities to the elements of f2 = D2 by the rule<br />

Pr,,(dd’) = Prl(d) Prl(d’). (8.2)<br />

For example, Prlj ( � m) = i. i = A. This is a valid distribution because<br />

x Prll(w) = t Prll(dd’) = t Prl(d) Prl(d’)<br />

wen dd’EDZ d,d’ED<br />

= x Prl(d) x Prr(d’) = 1 . 1 = 1 .<br />

dED<br />

d’ED<br />

We can also consider the case of one fair die and one loaded die,<br />

Prol(dd’) = Pro(d) Prl(d’), where Pro(d) = 5, (8.3)<br />

in which case ProI ( � m) = i . i = &. Dice in the “real world” can’t really<br />

be expected to turn up equally often on each side, because there is not perfect If all sides of a cube<br />

symmetry; but i is usually pretty close to the truth.<br />

were identical, how<br />

could we tell which<br />

An event is a subset of n. In dice games, <strong>for</strong> example, the set<br />

side is face up?<br />

is the event that “doubles are thrown!’ The individual elements w of 0 are<br />

called elementary events because they cannot be decomposed into smaller<br />

subsets; we can think of co as a one-element event {w}.<br />

The probability of an event A is defined by the <strong>for</strong>mula<br />

Pr(wE A) = x Pr(w);<br />

WEA<br />

(8.4)<br />

and in general if R(o) is any statement about w, we write ‘Pr(R(w))’ <strong>for</strong> the<br />

sum of all Pr(w) such that R(w) is true. Thus, <strong>for</strong> example, the probability of<br />

doubles with fair dice is $ + & + & + $ + $ + & = i; but when both dice are<br />

loaded with probability distribution Prl it is 1+~+~+~+~+~ = & > i.<br />

16 64 64 64 64 16<br />

Loading the dice makes the event “doubles are thrown” more probable.

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

Saved successfully!

Ooh no, something went wrong!