Date | November 2017 | Marks available | 2 | Reference code | 17N.1.AHL.TZ0.H_10 |
Level | Additional Higher Level | Paper | Paper 1 | Time zone | Time zone 0 |
Command term | Determine | Question number | H_10 | Adapted from | N/A |
Question
Chloe and Selena play a game where each have four cards showing capital letters A, B, C and D.
Chloe lays her cards face up on the table in order A, B, C, D as shown in the following diagram.
Selena shuffles her cards and lays them face down on the table. She then turns them over one by one to see if her card matches with Chloe’s card directly above.
Chloe wins if no matches occur; otherwise Selena wins.
Chloe and Selena repeat their game so that they play a total of 50 times.
Suppose the discrete random variable X represents the number of times Chloe wins.
Show that the probability that Chloe wins the game is .
Determine the mean of X.
Determine the variance of X.
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
METHOD 1
number of possible “deals” A1
consider ways of achieving “no matches” (Chloe winning):
Selena could deal B, C, D (ie, 3 possibilities)
as her first card R1
for each of these matches, there are only 3 possible combinations for the remaining 3 cards R1
so no. ways achieving no matches M1A1
so probability Chloe wins A1AG
METHOD 2
number of possible “deals” A1
consider ways of achieving a match (Selena winning)
Selena card A can match with Chloe card A, giving 6 possibilities for this happening R1
if Selena deals B as her first card, there are only 3 possible combinations for the remaining 3 cards. Similarly for dealing C and dealing D R1
so no. ways achieving one match is M1A1
so probability Chloe wins A1AG
METHOD 3
systematic attempt to find number of outcomes where Chloe wins (no matches)
(using tree diag. or otherwise) M1
9 found A1
each has probability M1
A1
their 9 multiplied by their M1A1
AG
[6 marks]
(M1)
(M1)A1
[3 marks]
(M1)A1
[2 marks]