QCAA Specialist Mathematics Alternative Sequence Combinatorics
6 sample questions with marking guides and sample answers
New Queensland vehicle numberplates have three digits followed by two letters and then another digit, e.g. 999 AZ9.
If digits and letters can be repeated, how many different numberplates are possible?
17 576 000
6 760 000
4 435 236
3 276 000
Reveal Answer
17 576 000
This incorrect option calculates the number of combinations for three letters and three digits (), rather than the required two letters and four digits.
6 760 000
There are 10 possible choices (0-9) for each of the four digits and 26 possible choices (A-Z) for each of the two letters. Since repetition is allowed, the total number of combinations is .
4 435 236
This incorrect option calculates the combinations assuming there are only 9 possible choices for the digits (e.g., excluding zero), which would result in .
3 276 000
This incorrect option calculates the number of combinations if digits and letters CANNOT be repeated ().
The value of is
6
9
12
15
Reveal Answer
6
This is incorrect because 6 is the value of alone, rather than the difference between the two terms.
9
This is correct. Using the formulas for combinations and permutations, and . Subtracting them gives .
12
This is incorrect and likely the result of an arithmetic error. The correct values are and , which subtract to 9.
15
This is incorrect because 15 is the value of alone, rather than the difference between the two terms.
Two hundred people were surveyed about whether they owned a cat or a dog. The table shows the results of the survey.
| Pet owned | Cat | Dog | Neither |
|---|---|---|---|
| Number of people | 105 | 108 | 7 |
The number of people who owned both a cat and a dog is
6
7
13
20
Reveal Answer
6
This value does not follow from the data provided. The correct approach requires using the Principle of Inclusion-Exclusion.
7
This is the number of people who own neither a cat nor a dog, not the number of people who own both.
13
This calculation () incorrectly assumes everyone owns at least one pet, forgetting to account for the 7 people who own neither.
20
Since 7 people own neither, people own at least one pet. Using the Principle of Inclusion-Exclusion, the number of people who own both is .
A game uses four dice with six faces numbered 0, 1, 2, 3, 4 and 5. Each number is equally likely to occur. Three dice are the same size, while the fourth is larger.
The game involves a player rolling the four dice simultaneously. A player wins the game if the sum of the numbers on the three smaller dice equals the number on the larger die. Determine the probability of a player winning at least twice in 10 games.
Reveal Answer
Winning results
| Large die value | Small dice values |
|---|---|
| 0 | 0, 0, 0 |
| 1 | 0, 0, 1 |
| 2 | 0, 0, 2 or 0, 1, 1 |
| 3 | 0, 0, 3 or 0, 1, 2 or 1, 1, 1 |
| 4 | 0, 0, 4 or 0, 1, 3 or 0, 2, 2 or 1, 1, 2 |
| 5 | 0, 0, 5 or 0, 1, 4 or 0, 2, 3 or 1, 1, 3 or 1, 2, 2 |
Number of ways each result can occur
| Large die value | Small dice values | Number of ways each result can occur |
|---|---|---|
| 0 | 0, 0, 0 | |
| 1 | 0, 0, 1 | |
| 2 | 0, 0, 2 0, 1, 1 | |
| 3 | 0, 0, 3 0, 1, 2 1, 1, 1 | |
| 4 | 0, 0, 4 0, 1, 3 0, 2, 2 1, 1, 2 | |
| 5 | 0, 0, 5 0, 1, 4 0, 2, 3 1, 1, 3 1, 2, 2 |
P(winning a game)
Using binomial distribution on GDC
P(winning at least twice in 10 games)
| Descriptor | Marks |
|---|---|
correctly identifies all possible smaller dice value combinations that produce the large die values of 0, 1 and 2 | 1 |
correctly identifies all possible smaller dice value combinations that produce the large die values of 3, 4 and 5 | 1 |
determines number of arrangements that produce the large die values of 0, 1 and 2 | 1 |
determines number of arrangements that produce the large die values of 3, 4 and 5 | 1 |
determines probability of winning a game | 1 |
determines required probability | 1 |
shows logical organisation, communicating key steps to at least where the number of arrangements that produce all possible large die values are determined | 1 |
A game is played on an square board. Each square on the board can be identified by a letter and a number. The square A1 is shaded.
A player starts at A1 and can move either one square up or one square right at a time.
The number of ways that each square on the board can be reached from A1 has been partially completed on the diagram.
| A | B | C | D | E | F | G | H | |
|---|---|---|---|---|---|---|---|---|
| 8 | 1 | |||||||
| 7 | 1 | |||||||
| 6 | 1 | |||||||
| 5 | 1 | 5 | ? | |||||
| 4 | 1 | 4 | 10 | |||||
| 3 | 1 | 3 | 6 | 10 | ||||
| 2 | 1 | 2 | 3 | 4 | 5 | |||
| 1 | ■ | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Determine the number of ways a player can reach E5.
Reveal Answer
This is incorrect. represents the number of paths requiring exactly 7 total moves, such as reaching D5 (3 right, 4 up) or E4 (4 right, 3 up).
This is incorrect. represents paths with 7 total moves where 5 are in one direction, which does not match the 8 total moves needed to reach E5.
This is correct. To reach E5 from A1, the player must move exactly 4 squares right (A to E) and 4 squares up (1 to 5). The number of unique paths is the number of ways to choose 4 right moves out of 8 total moves, which is .
This is incorrect. represents paths with 8 total moves where 5 are in one direction, such as reaching F4 (5 right, 3 up) or D6 (3 right, 5 up).
Determine the number of different ways all the letters of the word BEEKEEPER can be arranged if all the Es are together.
Reveal Answer
Number of ways
| Descriptor | Marks |
|---|---|
correctly determines the number of arrangements | 1 |
Determine the number of different ways all the letters of the word BEEKEEPER can be arranged if E is at one end and P is at the other end.
Reveal Answer
Number of ways with E first and P last
Total number of ways
| Descriptor | Marks |
|---|---|
correctly determines that there are ways the letters can be arranged with E first and P last (or vice versa) | 1 |
recognises that a factor of 2 is required to determine the total number of ways | 1 |
If four letters are randomly selected from the word BEEKEEPER, determine the number of selections that contain one or two Es.
Reveal Answer
Number of selections with 1 E
Number of selections with 2 Es
Total number of selections with either 1 or 2 Es
| Descriptor | Marks |
|---|---|
correctly uses the multiplication principle to determine the number of selections with 1 E | 1 |
correctly uses the multiplication principle to determine the number of selections with 2 Es | 1 |
uses addition principle to determine the total number of selections with 1 E or 2 Es | 1 |