Task Answers2 English
Task Answers2 English
(Kitayeva A.V.)
The lottery: a tax on people who flunked math.
Monique Lloyd
Coincidences, in general, are great stumbling blocks in the way of that class of
thinkers who have been educated to know nothing of the theory of probabilities -
that theory to which the most glorious objects of human research are indebted for
the most glorious of illustrations.
Arsene Dupin, in The Murders in the Rue Morgue, Edgar Allen Poe
2. Suppose that k distinct letters (to different friends) have been written, each
with a corresponding (uniquely addressed) envelope. Then, for some strange
reason, the letters are placed in the envelopes purely randomly (after a thorough
shuffling).
(a) What is the probability of all letters being placed correctly?
(b) What is the probability that none of the k letters are placed
correctly?
(c) What is the probability of exactly one letter being placed correctly?
3. Four players are dealt 5 cards each. What is the probability that at least
one player gets exactly 2 aces (a task ago, we could not solve this problem).
4. There are 100,000 lottery tickets marked 00000 to 99999. One of these is
selected at random. What is the probability that the number on it contains
84 (consecutive, in that order) at least once.
5. Suppose the experiment consists of rolling two dice (red and green), the
event A is: «the total number of dots equals 6», B is: «the red die shows an even
number». Compute Pr(B/A).
6. Two players are dealt 5 cards each. What is the probability that they will
have the same number of aces?
7. Let Pr(A) = 0.1, Pr(B) = 0.2, Pr(C) = 0.3 and Pr(D) = 0.4; A,B,C,D –
independent events. Compute Pr[(A ∪ B) ∩ C ∪ D ].
9. The same question, but this time we want at least one 8 followed (sooner
or later) by a 4 (at least once). What makes this different from the original
question is that 8 and 4 now don’t have to be consecutive.
10. Out of 10 dice, 9 of which are regular but one is ’crooked’ (6 has a
probability of 0.5), a die is selected at random (we cannot tell which one, they all
look identical). Then, we roll it twice.
We will answer three question:
(a) Given that the first roll resulted in a six (Event S1), what is the
(conditional) probability of getting a six again in the second roll (Event S2)?
(b) Are S1 and S2 independent?
(c) Given that both rolls resulted in a six, what is the (conditional)
probability of having selected the crooked die?
11. Ten people have been arrested as suspects in a crime one of them must
have committed. A lie detector will (incorrectly) incriminate an innocent person
with a 5% probability, it can (correctly) detect a guilty person with a 90%
probability.
(a) One person has been tested so far and the lie detector has its red
light flashing (implying: ’that’s him’). What is the probability that he is the
criminal?
(b) All 10 people have been tested and exactly one incriminated. What
is the probability of having the criminal now?
12. Two men take one shot each at a target. Mr. A can hit it with the
probability of 1/4 , Mr. B’s chances are 2/5 (he is a better shot). What is the
probability that the target is hit (at least once)?
Here, we have to (on our own) assume independence of the two shots.
13. What is more likely, getting at least one 6 in four rolls of a die, or getting
at least one double 6 in twenty four rolls of a pair of dice?
14. Four people are dealt 13 cards each. You (one of the players) got one
ace. What is the probability that your partner has the other three aces? (Go back
three questions to get a hint).
16. Two coins are flipped, followed by rolling a die as many times as the
number of heads shown. What is the probability of getting fewer than 5 dots in
total?
17. Consider the previous example. Given that there were exactly 3 dots in
total, what is the conditional probability that the coins showed exactly one head?
18. Jim, Joe, Tom and six other boys are randomly seated in a row. What is
the probability that at least two of the three friends will sit next to each other?
19. Shuffle a deck of 52 cards. What is the probability that the four aces will
end up next to each other (as a group of four consecutive aces)?
20. Consider a 10 floor government building with all floors being equally
likely to be visited. If six people enter the elevator (individually, i.e.
independently) what is the probability that they are all going to (six) different
floors?
21. (Extension of the previous example). What if the floors are not equally
likely (they issue licenses on the 4th floor, which has therefore a higher probability
of 1/2 to be visited by a ’random’ arrival − the other floors remain equally
likely with the probability of 1/16 each).
22. Within the next hour 4 people in a certain town will call for a cab. They
will choose, randomly, out of 3 existing (equally popular) taxi companies. What
is the probability that no company is left out (each gets at least one job)?
23. There are 10 people at a party (no twins). Assuming that all 365 days of
a year are equally likely to be someone’s birth date [not quite, say the statistics,
but we will ignore that] and also ignoring leap years, what is the probability of:
(a) All these ten people having different birth dates?
(b) Exactly two people having the same birth date (and no other
duplication).
24. A simple padlock is made with only ten distinct keys (all equally likely).
A thief steals, independently, 5 of such keys, and tries these to open your lock.
What is the probability that he will succeed?
Answers 2
1. (a) This of course consists of the subset: {(2, 6), (3, 5), (4, 4), (5, 3), (6, 2)} (five simple
events).
(b) This correspond to the subset:
1,1 1,2 1,3 1,4 1,5
2,1 2,2 2,3 2,4 2,5
3,1 3,1 3,3 3,4 3,5
4,1 4,2 4,3 4,4 4,5
5,1 5,2 5,3 5,4 5,5.
(c) Subset:
1,2 1,3 1,4 1,5 1,6
2,3 2,4 2,5 2,6
3,4 3,5 3,6
4,5 4,6
5,6.
2. The sample space of this experiment is thus a list of all permutations of k objects
(123 132 213 231 312 321), when k = 3 (we will assume that 123 represents the correct
placement of all three letters). In general, there are k! of these, all of them equally likely (due to
symmetry, i.e. none of these arrangements should be more likely than any other).
(a) Solution (fairly trivial): Only one out of k! random arrangements meets the criterion,
thus the answer is 1/k! (astronomically small for k beyond 10).
(b) Solution is this time a lot more difficult. First we have to realize that it is relatively
easy to figure out the probability of any given letter being placed correctly, and also the
probability of any combination (intersection) of these, i.e. two specific letters correctly placed,
three letters correct..., etc. [this kind of approach often works in other problems as well;
intersections are usually easy to deal with, unions are hard but can be converted to intersections].
Let us verify this claim. We use the following notation: A1 means that the first letter is placed
correctly (regardless of what happens to the rest of them), A2 means the second letter is placed
correctly, etc. Pr( A1) is computed by counting the number of permutations which have 1 in the
correct first position, and dividing this by k!. The number of permutations which have 1 fixed is
obviously (k − 1)! [we are effectively permuting 2, 3, ... k, altogether k − 1 objects]. Pr(A1) is
thus equal to (k − 1)! / k! . The probability of A2, A3, etc. can be computed similarly, but it
should be clear from the symmetry of the experiment that all these probabilities must be the
same, and equal to Pr(A1) = 1/k (why should any letter have a better chance of being placed
correctly than any other?). Similarly, let us compute Pr(A1 ∩ A2), i.e. probability of the first and
second letter being placed correctly (regardless of the rest). By again counting the corresponding
number of permutations (with 1 and 2 fixed), we arrive at (k − 2)! / k!=1/k/(k−1) . This must be
the same for any other pair of letters, e.g. Pr(A3 ∩ A7) = 1/k/(k−1) , etc. In this manner we also
get
Pr(A1 ∩ A2 ∩ A3) =Pr(A3 ∩ A7 ∩ A11) = 1/k/(k−1)/(k−2), etc.
So now we know how to deal with any intersection. All we need to do is to express the event ’all
letters misplaced’ using intersections only, and evaluate the answer, thus:
Pr( A1 ∩ A2 ∩ ... ∩ Ak ) [all letters misplaced] = Pr( A1 ∪ A2 ∪ ... ∪ Ak ) =
= 1 − Pr(A1 ∪ A2 ∪ ... ∪ Ak) =
k k
= 1 −∑ Pr(Ai )+ ∑ Pr(Ai ∩ Aj) + ... +(−1)k Pr(A1 ∩ A2 ∩ ... ∩ Ak) =
i =1 i< j
⎛k ⎞ 1 ⎛k ⎞ 1 1 1 1 1
= 1 − k · 1/k + ⎜⎜ ⎟⎟ − ⎜⎜ ⎟⎟ + ... + (− 1)k = 1 − 1 + − + ... + (− 1)k .
⎝ 2 ⎠ k (k − 1) ⎝ 3 ⎠ k (k − 1)(k − 2) k! 2! 3! k!
For k = 3 this implies 1 − 1 + 1/2−1/6=1/3 (check, only 231 and 312 out of six permutations).
For k = 1, 2, 4, 5, 6, and 7 we get: 0 (check, one letter cannot be misplaced), 50% for two letters
(check), 37.5% (four letters), 36.67% (five), 36.81% (six), 36.79% (seven), after which the
probabilities do not change practically (i.e., surprisingly, we get the same answer for 100 letters,
a million letters, etc.).
Can we identify the limit of the 1 −1+ 1/2! − 1/3! +... sequence? Yes, of course, this is the
−1
expansion of e ≈ .36788.
c. Similarly, the probability of exactly one letter being placed correctly is
1 1 1 1 1 1 1
k − 2⎛⎜ k ⎞⎟ + 3⎛⎜ k ⎞⎟ + ... m k = 1 − 1 + − + ... m
k ⎝ 2 ⎠ k (k − 1) ⎝ 3 ⎠ k (k − 1)(k − 2) k! 2! 3! (k − 1)!
(the previous answer short of its last term!). This equals to 1, 0, 50%, 37.5%, ... for k = 1, 2, 3, 4,
... respectively, and has the same limit.
3. Solution: Let A1 be the event that the first player gets exactly 2 aces, A2 means that the
second player has exactly 2 aces, etc. The question amounts to finding Pr(A1 ∪ A2 ∪ A3 ∪
4 4
A4). By our formula, this equals ∑ Pr(Ai ) − ∑ Pr(Ai ∩ Aj) + 0 [the intersection of 3 or more
i =1 i< j
of these events is empty − there are only 4 aces]. For Pr(A1) we get ⎛⎜ ⎞⎟⎛⎜ ⎞⎟ / ⎛⎜ ⎞⎟ = 3.993%
4 48 52
⎝ 2 ⎠⎝ 3 ⎠ ⎝ 5 ⎠
(the denominator counts the total number of five-card hands, the numerator counts only those
with exactly two aces) with the same answer for Pr(A2), ... Pr(A4) (the four players must have
equal chances). Similarly Pr(A1 ∩ A2) = ⎛⎜
4 ⎞⎛ 48 ⎞ / ⎛ 52 ⎞ =0.037% (the denominator
⎟⎜ ⎟ ⎜ ⎟
⎝ 2,2,0 ⎠⎝ 3,3,42 ⎠ ⎝ 5,5,42 ⎠
represents the number of ways of dealing 5 cards each to two players, the numerator counts only
those with 2 aces each − recall the ’partitioning’ formula), and the same probability for any other
pair of players.
Final answer: 4Pr(A1) − 6Pr(A1 ∩ A2) = 15.75%.
4. Solution: Let’s introduce four events: A means that the first two digits of the ticket are
84 (regardless of what follows), B: 84 is found in the second and third position, C: 84 in position
three and four, and D: 84 in the last two positions. Obviously we need Pr(A ∪ B ∪ C ∪ D)
=Pr(A)+Pr(B)+Pr(C)+Pr(D)− Pr(A ∩ C) − Pr(A ∩ D) − Pr(B ∩ D) +0 [the remaining
possibilities are all null events − the corresponding conditions are incompatible, see the Venn
diagram].
The answer is 4 × 1000/100,000 − 3 × 10/100,000 = 0.04 − 0.0003 = 3.97% (the logic of each
fraction should be obvious − there are 1000 tickets which belong to A, 10 tickets which meet
conditions A and C, etc.).
5. Solution: Let us use the old sample space, indicating simple events of A by ○, of B by
×, and of the A ∩ B overlap by ⊗ :
○
× × × ⊗× ×
○
× ⊗× × × ×
○
××××××
Pr(B/A) is clearly the number of the overlap simple events ⊗ divided by the number of simple
events in A (either ○ or ⊗), as these are all equally likely.
Answer: Pr(B/A) = 2/5.
6. Solution: We partition the sample space according to how many aces the first player
gets, calling the events A0, A1, ..., A4. Let B be the event of our question (both players having the
same number of aces). Then, by the formula of total probability: Pr(B) =Pr(A0)Pr(B/A0)+
Pr(A1)Pr(B/A1)+ Pr(A2)Pr(B/A2)+
⎛ 4 ⎞⎛ 48 ⎞ / ⎛ 52 ⎞ × ⎛ 4 ⎞⎛ 43 ⎞ / ⎛ 47 ⎞ +
+ Pr(A3)Pr(B/A3)+ Pr(A4)Pr(B/A4)= ⎜ 2 ⎟⎜ 3 ⎟ ⎜ 5 ⎟ ⎜ 0 ⎟⎜ 5 ⎟ ⎜ 5 ⎟
⎝ ⎠⎝ ⎠ ⎝ ⎠ ⎝ ⎠⎝ ⎠ ⎝ ⎠
+ ⎛⎜ 4 ⎞⎟⎛⎜ 48 ⎞⎟ / ⎛⎜ 52 ⎞⎟ × ⎛⎜ 3 ⎞⎟⎛⎜ 44 ⎞⎟ / ⎛⎜ 47 ⎞⎟ + ⎛⎜ 4 ⎞⎟⎛⎜ 48 ⎞⎟ / ⎛⎜ 52 ⎞⎟ × ⎛⎜ 2 ⎞⎟⎛⎜ 45 ⎞⎟ / ⎛⎜ 47 ⎞⎟ +
⎝ 1 ⎠⎝ 4 ⎠ ⎝ 5 ⎠ ⎝ 1 ⎠⎝ 4 ⎠ ⎝ 5 ⎠ ⎝ 2 ⎠⎝ 3 ⎠ ⎝ 5 ⎠ ⎝ 2 ⎠⎝ 3 ⎠ ⎝ 5 ⎠
+ ⎛⎜ 4 ⎞⎟⎛⎜ 48 ⎞⎟ / ⎛⎜ 52 ⎞⎟ × 0 + ⎛⎜ 4 ⎞⎟⎛⎜ 48 ⎞⎟ / ⎛⎜ 52 ⎞⎟ × 0 = 49.33%.
⎝ 3 ⎠⎝ 2 ⎠ ⎝ 5 ⎠ ⎝ 4 ⎠⎝ 0 ⎠ ⎝ 5 ⎠
7. Solution: = Pr(A ∪ B) · [1 − Pr(C ∪ D)] =
= [0.1 + 0.2 − 0.02] · [1 − 0.3 − 0.4 + 0.12] = 11.76%.
9. Solution: We partition the sample space according to the position at which 8 appears
for the first time: B1, B2, ...,B5, plus B0 (which means there is no 8). Verify that this is a partition.
Now, if A is the event of our question (8 followed by a 4), we can apply the formula of total
probability thus:
Pr(A) =Pr(A/B1)·Pr(B1)+ Pr(A/B2)·Pr(B2)+ Pr(A/B3)·Pr(B3)+ Pr(A/B4)· Pr(B4)+
+ Pr(A/B5) · Pr(B5)+ Pr(A/B0) · Pr(B0). Individually, we deal with these in the following manner
(we use the third term as an example): Pr(B3) = (9/10)2 (1/10) (no 8 in the first slot, no 8 in the
second, 8 in third, and anything after that; then multiply due to independence), Pr(A/B3) =
1−(9/10)2 (given the first 8 is in the third slot, get at least one 4 after; easier through
complement: 1 − Pr(no 4 in the last two slots)).
Answer: Pr(A) =[1 −(9/10)4](1/10)+ [1 −(9/10)3](9/10)(1/10)+ [1 −(9/10)2](9/10)2 (1/10)+ [1
−(9/10)](9/10)3 (1/10)+0 ·(9/10)4(1/10) =8.146%.
11. (a) Solution: Using c for ’criminal’, i for ’innocent’ r for ’red light flashing’ and g
for ’green’, we have the following sample space:
cr (1/10)(9/10)=0.090 ■ ○
cg (1/10)(1/10)=0.010
ir (9/10)(1/20)=0.045 ■
ig (9/10)(19/20)=0.855
Answer: Pr(C/R) = 0.090/(0/090+0/045)=2/3 (far from certain!).
(b) A simple event consists now of a complete record of these tests (the sample
10
space has of 2 of these), e.g. rggrggrggg. Assuming that the first item represents the criminal
(the sample space must ’know’ who the criminal is), we can assign probabilities by simply
multiplying since the tests are done independently of each other. Thus, the simple event above
will have the probability of 0.9×0.952×0.05×0.952×0.05×0.953, etc. Since only one test resulted
in r, the only simple events of relevance (the idea of a ’reduced’ sample space) are:
rggggggggg 0.9·0.959
grgggggggg 0.9·0.958·0.05
…………
gggggggggr 0.9·0.958·0.05
Given that it was one of these outcomes, what is the probability it was actually the first one?
Answer: (0.9 × 0.959)/(0.9 × 0.959 + 9 × 0.1 × 0.958 × 0.05)= 95% (now we are a lot more
certain − still not 100% though!).
13. Solution: Let’s work it out. The first probability can be computed as 1−Pr(no sixes in
4 rolls) = 1 − (5/6)4 (due to independence of the individual rolls) = 51.77%. The second
probability, similarly, as 1 − Pr(no double six in 24 rolls of a pair) = 1− (35/36)24 = 49.14% (only
one outcome out of 36 results in a double six).
Answer: Getting at least one 6 in four rolls is more likely.
14. We can visualize the experiment done sequentially, with you being the first player
and your partner the second one (even if the cards were actually dealt in a different order, that
cannot change probabilities, right?). The answer is a natural conditional probability, i.e. the
actual condition (event) is decided in the first stage (consider it completed accordingly). The
second stage then consists of dealing 13 cards out of 39, with 3 aces remaining.
Answer: ⎛⎜ ⎞⎟⎛⎜ ⎞⎟ / ⎛⎜ ⎞⎟ = 3.129%.
3 36 39
⎝ 3 ⎠⎝ 10 ⎠ ⎝ 13 ⎠
The moral: conditional probability is, in some cases, the ’simple’ probability.
15. Solution: = Pr(A∩ B )+Pr(C) − Pr(A∩ B ∩C) =0.25×0.65+0.45 − 0.25× 0.65 × 0.45
=53.94%.
16. Solution: Introduce a partition A0, A1, A2 according to how many heads are
obtained. If B stands for ’getting fewer than 5 dots’, the total-probability formula gives: Pr(B)
=Pr(A0)Pr(B/A0)+Pr(A1)Pr(B/A1)+Pr(A2)Pr(B/A2) =(1/4)·1+(2/4) ·(4/6)+(1/4)·(6/36) = 62.5%.
The probabilities of A0, A1, and A2 followed from the sample space of two flips: {hh, ht, th, tt};
the conditional probabilities are clear for Pr(B|A0) and Pr(B|A1), Pr(B|A2) requires going back to
36 outcomes of two rolls of a die and counting those having a total less than 5: {11, 12, 13, 21,
22, 31}.
17. Solution: We are given the outcome of the second stage to guess at the outcome
of the first stage. We need the Bayes rule, and the following (simplified) sample space:
03 (1/4) ·0■
03 (1/4) ·1
13 (1/2) ·(1/6) ■ ○
13 (1/2) ·(5/6)
23 (1/4) ·(2/36) ■
23 (1/4) ·(34/36)
where the first entry is the number of heads, and the second one is the result of rolling the die,
simplified to tell us only whether the total dots equaled 3, or did not (3). Pr(1|3) =
(1/12)/(1/12+1/72) = 85.71%. Note that here, rather atypically, we used bold digits as names of
events.
18. Solution: Let’s introduce A: «Jim and Joe sit together», B: «Jim and Tom sit
together», C: «Joe and Tom sit together». We need Pr(A ∪ B ∪ C) =Pr(A)+ Pr(B)+Pr(C) −
Pr(A ∩B) −Pr(A ∩C) −Pr(B ∩C) + Pr(A ∩B ∩C). There is 9! random arrangements of the boys,
2 × 8! will meet condition A (same with B and C), 2×7! will meet both A and B (same with A
∩C and B ∩C), none will meet all three.
Answer: 3 × (2 × 8!)/9!-3 × (2 × 7!)/9! = 58.33%.
19. Answer: 4!49!/52! = 0.0181% (=1/5525) (for small probabilities, the last number
telling us that this will happen, on the average, only in 1 out of 5525 attempts — conveys more
information than the actual percentage).
20. Solution: The experiment is in principle identical to rolling a 9-sided die (there are
nine floors to be chosen from, exclude the main floor!) six times (once for each person − this
corresponds to selecting his/her floor). The sample space thus consists of 96 equally likely
outcomes (each looking like this: 248694 − ordered selection, repetition allowed). Out of these,
6
only 9 × 8 × 7 × 6 × 5 ×4 = P9 consist of all distinct floors.
6
Answer: P9 /96 = 11.38%.
21. Solution: The sample space will be the same, but the individual probabilities will no
longer be identical; they will now equal to (1/2)i( 1/16)6-i where i is how many times 4 appears in
the selection (248694 will have the probability of (1/2)2(1/16)4, etc.). We have to single out the
outcomes with all six floors different and add their probabilities. Luckily, there are only two
6
types of these outcomes: (i) those without any 4: we have P8 of these, each having the
8
probability of (1/16)6 , and (ii) those with a single 4: there are 6 × P5 of these, each having the
probability of (1/2)(1/16)5.
6 5 5
Answer: P8 (1/16)6 + 6 P8 (1 / 2)(1 / 16) = 2.04% (the probability is a lot smaller now).
22. Solution: This is again a roll-of-a-die type of experiment (this time we roll 4 times −
once for each customer − and the die is 3-sided − one side for each company). The sample space
will thus consist of 34 equally likely possibilities, each looking like this: 1321. How many of
these contain all three numbers? To achieve that, we obviously need one duplicate and two
singles. There are 3 ways to decide which company gets two customers. Once this decision has
been made (say 1223), we simply permute the symbols (getting ⎛⎜
4 ⎞ distinct ’words’).
2,1,1⎟
⎝ ⎠
Answer: 3 ⎛⎜
4 ⎞ /34 = 4/9 = 44.44%.
⎟
⎝ 1,1⎠
2,
23. (a) Solution: This, in principle, is the same as choosing 6 different floors in
an elevator (two examples ago).
10 10
Answer: P365 / 365 = 88.31%.
(b) Solution: This is similar to the previous example where we needed
exactly one duplicate. By a similar logic, there are 365 ways to choose the date of the
duplication, ⎛⎜ ⎞⎟ ways of placing these into 2 of the 10 empty slots, and P364 of filling out the
10 8
⎝2⎠
remaining 8 slot with distinct birth dates.
Answer: 365 ⎛⎜
10 ⎞ P 8 /36510 = 11.16% (seems reasonable).
⎟
⎝ 2 ⎠ 364
These two answers account for 99.47% of the total probability. Two or three duplicates, and
perhaps one triplicate would most likely take care of the rest; try it!
24. Solution: Again, a roll-of-a-die type of experiment (10 sides, 5 rolls). The question is
in principle identical to rolling a die to get at least one six. This, as we already know, is easier
through the corresponding complement.
Answer: 1 − (9/10)5 = 40.95%.