Mathematics 9709/62 — October/November 2018
Cambridge A-Level · Probability & Statistics 1 · worked solutions for every part, with the mark scheme
Topics Probability · Permutations and Combinations · Representation of Data · Discrete Random Variables · The Normal Distribution
How many different arrangements are there of the 11 letters in the word MISSISSIPPI?
Approach
Count the letters in MISSISSIPPI and divide the total number of arrangements of 11 distinct letters by the factorials of the repeated letters, because swapping identical letters does not create a new arrangement.
Working
MISSISSIPPI has:
- 1 M
- 4 I
- 4 S
- 2 P
Total letters = 11.
Number of distinct arrangements:
Answer
34650
34650
Walkthrough
The word MISSISSIPPI has 11 letters, but many of them are repeated. If all 11 letters were different, there would be arrangements. However, the four I's are identical, the four S's are identical, and the two P's are identical. Swapping identical letters does not produce a different arrangement, so we divide by for the I's, for the S's, and for the P's.
This gives the number of distinct arrangements as:
Key Takeaways
When arranging objects where some are identical, use the multinomial coefficient , where are the frequencies of the repeated items. This removes the overcounting caused by identical letters.
Common Mistakes
- Using without dividing by the factorials of repeated letters.
- Miscounting the letters: M appears once, I appears four times, S appears four times, P appears twice.
- Dividing by the wrong factorials.
- Not simplifying the final answer.
Things to Be Careful About
The mark scheme awards the method mark for the correct factorial division and the accuracy mark for the final answer 34650. Always show the formula to make the method clear.
Two letters are chosen at random from the 11 letters in the word MISSISSIPPI. Find the probability that these two letters are the same.
Approach
Count the number of unordered pairs of letters that are the same, then divide by the total number of unordered pairs chosen from the 11 letters.
Working
Total number of unordered pairs from 11 letters:
Favourable pairs:
- Two S's:
- Two I's:
- Two P's:
- Two M's: impossible, since there is only one M.
Total favourable pairs:
Probability that the two letters are the same:
Answer
13/55
Walkthrough
Choosing two letters at random from 11 means choosing an unordered pair. The total number of possible pairs is .
For the two letters to be the same, both letters must come from the same repeated-letter group:
- There are 4 S's, so the number of ways to choose two S's is .
- There are 4 I's, so the number of ways to choose two I's is .
- There are 2 P's, so the number of ways to choose two P's is .
- There is only 1 M, so it is impossible to choose two M's.
These cases are mutually exclusive, so add them:
Therefore the probability is:
An equivalent sequential method is:
Key Takeaways
When selecting unordered pairs from groups with identical items, use combinations to count favourable outcomes. Probability is the number of favourable outcomes divided by the total number of outcomes. When several disjoint cases give the required outcome, add their probabilities or counts.
Common Mistakes
- Forgetting that P appears twice, so a pair of P's is possible.
- Including M as a possible same-letter pair, since there is only one M.
- Counting ordered pairs in the numerator while using an unordered denominator, or vice versa.
- Not simplifying to .
- Using permutations instead of combinations when the order of choosing the two letters does not matter.
Things to Be Careful About
The mark scheme allows either a counting method or a sequential probability method. For the counting method, use as the denominator and as the numerator. For the sequential method, multiply probabilities for each pair and add the three mutually exclusive cases. Avoid mixing ordered and unordered counts.
The rest of this paper
6 more questions- Q2Representation of Data6M
- Q3Discrete Random Variables · Probability6M
- Q4Permutations and Combinations6M
- Q5Representation of Data6M
- Q6Probability · Discrete Random Variables9M
- Q7The Normal Distribution12M