Date | May 2009 | Marks available | 14 | Reference code | 09M.3sp.hl.TZ0.4 |
Level | HL only | Paper | Paper 3 Statistics and probability | Time zone | TZ0 |
Command term | Find and State | Question number | 4 | Adapted from | N/A |
Question
In a game there are n players, where n>2 . Each player has a disc, one side of which is red and one side blue. When thrown, the disc is equally likely to show red or blue. All players throw their discs simultaneously. A player wins if his disc shows a different colour from all the other discs. Players throw repeatedly until one player wins.
Let X be the number of throws each player makes, up to and including the one on which the game is won.
(a) State the distribution of X .
(b) Find P(X=x) in terms of n and x .
(c) Find E(X) in terms of n .
(d) Given that n = 7 , find the least number, k , such that P(X⩽k)>0.5 .
Markscheme
(a) geometric distribution A1
[1 mark]
(b) let R be the event throwing the disc and it landing on red and
let B be the event throwing the disc and it landing on blue
P(X=1)=p=P(1B and (n−1)R or 1R and (n−1)B) (M1)
=n×12×(12)n−1+n×12×(12)n−1 (A1)
=n2n−1 A1
hence P(X=x)=n2n−1(1−n2n−1)x−1, (x⩾1) A1
Notes: x⩾1 not required for final A1.
Allow FT for final A1.
[4 marks]
(c) E(X)=1p
=2n−1n A1
[1 mark]
(d) when n=7 , P(X=x)=(1−764)x−1×764 (M1)
=764×(5764)x−1
P(X⩽k)=k∑x=1764×(5764)x−1 (M1)(A1)
⇒764×1−(5764)k1−5764>0.5 (M1)(A1)
⇒1−(5764)k>0.5
⇒(5764)k<0.5
⇒k>log0.5log5764 (M1)
⇒k>5.98 (A1)
⇒k=6 A1
Note: Tabular and other GDC methods are acceptable.
[8 marks]
Total [14 marks]
Examiners report
This question was found difficult by the majority of candidates and few fully correct answers were seen. Few candidates were able to find P(X=x) in terms of n and x and many did not realise that the last part of the question required them to find the sum of a series. However, better candidates received over 75% of the marks because the answers could be followed through.