Printable · GCSE Higher · ages 14-16
Systematic listing and the product rule for counting worksheet — GCSE Higher
Fifteen questions on "systematic listing and the product rule for counting" — DfE statement N5. Print it, or print three versions so neighbours cannot copy by letter; the key gives the letter for each version.
part HigherNon-calculator
Answer key: Systematic listing and the product rule for counting worksheet — GCSE Higher
MathsUKwww.geekhero.co.uk
- (b) 3 — Method: list all valid two-digit numbers that can be made without starting with 0, then keep only the ones that are multiples of 5. Working: the two-digit numbers possible are 30, 35, 50 and 53. A number is a multiple of 5 only if it ends in 0 or 5: 30 ends in 0, 35 ends in 5, 50 ends in 0, but 53 ends in 3. So there are 3 multiples of 5. Answer: 3. 4 comes from including 53 as a multiple of 5 without checking that its last digit is not 0 or 5. 2 comes from leaving out 50, wrongly assuming 0 cannot be used as the second digit either. 6 comes from listing every two-digit arrangement of the three digits, including ones that start with 0, without applying either restriction.
- (c) 6 — The units digit must be even, so it can be 2 or 8, giving 2 choices. The tens digit can then be any of the remaining 3 digits, since one digit has been used for the units. Multiply: 2 × 3 = 6. 12 comes from working out how many two-digit numbers can be made in total, 4 × 3 = 12, ignoring the requirement that the number is even. 8 comes from choosing the units digit from 2 options and then wrongly allowing any of the 4 digits again for the tens digit, 2 × 4 = 8, which lets a digit repeat. 2 comes from counting only the choices for the units digit and forgetting the tens digit.
- (b) 28 — Method: count the ordered choices with the product rule and then correct for the double counting, because the two captains have equal standing and so a pair is the same pair whichever captain is named first. Working: there are 8 players who could be named first and 7 who could be named second, giving 8 × 7 = 56 ordered choices; each pair has been counted twice, once in each order, so the number of pairs is 56 ÷ 2 = 28. Answer: 28. The distractors: 56 comes from stopping at 8 × 7 and never halving, which counts each pair of captains twice; 64 comes from working out 8 × 8, which allows the same player to be chosen as both captains; 16 comes from multiplying the 8 players by the 2 captaincies instead of pairing the players with one another.
- (a) 56 — Method: count the ordered selections with the product rule first, then divide by the number of different orders in which any one committee could have been picked. Working: there are 8 choices for a first pupil, 7 for a second and 6 for a third, giving 8 × 7 × 6 = 336 ordered selections; any particular three pupils could have been picked in 3 × 2 × 1 = 6 orders, so the number of different committees is 336 ÷ 6 = 56. Answer: 56. The distractors: 336 comes from stopping at 8 × 7 × 6 and treating the three places as distinct posts when they are identical; 168 comes from dividing that product by 2 rather than by the 6 orders in which three chosen pupils can be listed; 24 comes from multiplying the 8 volunteers by the 3 places instead of multiplying the choices at each stage.
- (c) 360 — There are 5 choices for the letter. The first digit can be any of the 9 digits from 1 to 9, giving 9 choices, and the second digit must differ from the first, leaving 8 choices. By the product rule, the number of PINs is 5 × 9 × 8 = 360. Allowing the second digit to repeat the first, ignoring the 'no digit twice' rule, gives 5 × 9 × 9 = 405. Adding the numbers of choices instead of multiplying them, 5 + 9 + 8, gives 22. Treating the pair of digits as an unordered choice, rather than as a first digit followed by a second digit in a fixed order, halves the digit count: 5 × (9 × 8 ÷ 2) = 180.
- (b) 120 — Method: fill the positions on the shelf one at a time; each book placed leaves one fewer book available for the next position, and the product rule multiplies the choices. Working: there are 5 books for the first position, 4 for the second, 3 for the third, 2 for the fourth and 1 for the last, so the number of orders is 5 × 4 × 3 × 2 × 1 = 120. Answer: 120. The distractors: 25 comes from multiplying the 5 books by the 5 positions rather than multiplying the shrinking number of choices at each position; 60 comes from halving the correct product, as though each order had been counted twice in the way that pairs are; 720 comes from carrying the product one factor too far and working out 6 × 5 × 4 × 3 × 2 × 1, as though there were six books.
- (d) 24 — Method: the three parts of the deal are chosen independently, so every sandwich can be taken with every snack and every one of those pairs with every drink; the product rule multiplies the number of choices in each part. Working: there are 4 choices of sandwich and each can be taken with any of the 3 snacks, giving 4 × 3 = 12 sandwich-and-snack pairs; each of those pairs can be completed with either of the 2 drinks, so the number of meal deals is 12 × 2 = 24. Answer: 24. The distractors: 9 comes from adding the choices, 4 + 3 + 2, instead of multiplying them, and a candidate who adds writes that total down as the count; 12 comes from multiplying the sandwiches by the snacks and never bringing the drink into the count at all; 27 comes from adding the items on the menu to get 9 and then multiplying that by the 3 parts of the deal, which counts the menu rather than the combinations.
- (c) 90 — Multiply the number of choices for each course: 5 × 6 × 3 = 90. 14 comes from adding the three numbers instead of multiplying them. 30 comes from multiplying only the starters and mains, 5 × 6, and forgetting the dessert. 18 comes from multiplying only the mains and desserts, 6 × 3, and forgetting the starter.
- (c) 27 — Each of the 3 digits can be chosen independently for each of the 3 positions, so multiply: 3 × 3 × 3 = 27. 9 comes from multiplying only two of the three positions, 3 × 3, and forgetting the third. 6 comes from working out 3 × 2 × 1 = 6, which counts codes where digits do not repeat, but the question allows repeated digits. 3 comes from considering only one digit position.
- (d) 17 — Without the restriction there would be 5 × 4 = 20 combinations. The dragon piece can only be paired with the gold token, so of the 4 tokens, 3 are not allowed with the dragon piece, giving 20 − 3 = 17 valid combinations. 20 comes from ignoring the restriction completely. 19 comes from subtracting only 1 of the 3 invalid dragon combinations instead of all 3, 20 − 1 = 19. 16 comes from multiplying only the 4 non-dragon pieces by the 4 tokens, 4 × 4 = 16, and forgetting to add back the one valid combination of the dragon piece with the gold token.
- (d) 10 — Method: list the pairs systematically, taking each sweet in turn and pairing it only with the sweets that come after it, so that no pair is written down twice. Working: numbering the sweets 1 to 5, the first sweet pairs with 4 others, the second pairs with 3 sweets that come after it, the third with 2 and the fourth with 1, so the total is 4 + 3 + 2 + 1 = 10. Answer: 10. The distractors: 20 comes from working out 5 × 4 and never halving, which counts each pair twice, once in each order; 25 comes from working out 5 × 5, which allows the same sweet to be chosen twice; 9 comes from adding the 5 choices and the 4 remaining choices instead of combining them as a selection of two.
- (c) 45 — Method: count the ordered pairings with the product rule and then correct for the fact that a game between two players is the same game whichever player it is counted from. Working: each of the 10 players meets 9 opponents, so 10 × 9 = 90 pairings are counted; every game has been counted twice, once from each player's side, so the number of games is 90 ÷ 2 = 45. Answer: 45. The distractors: 90 comes from stopping at 10 × 9 and never halving, so that each game is counted once for each of its two players; 55 comes from adding 10 + 9 + 8 + ... + 1 instead of 9 + 8 + ... + 1, which counts one extra round of games; 20 comes from multiplying the 10 players by the 2 players in each game rather than pairing the players with one another.
- (c) 22 — Without restriction there are 6 × 4 = 24 combinations. Two specific combinations are not available, so subtract 2: 24 − 2 = 22. 24 comes from ignoring the restriction completely. 23 comes from subtracting only 1 of the 2 excluded combinations. 18 comes from removing the whole sport trim level, 6 × 3 = 18, instead of removing just the two excluded combinations.
- (d) 9 — Method: split into two cases — the soups with no restriction, and the mushroom soup on its own — then add the totals. Working: the 2 soups other than mushroom can be paired with any of the 4 sandwiches: 2 × 4 = 8. The mushroom soup can only be paired with the cheese sandwich: 1 combination. Total = 8 + 1 = 9. Answer: 9. 12 comes from working out 3 × 4 = 12 without applying the restriction at all. 8 comes from correctly finding the 2 unrestricted soups' 8 combinations, but forgetting to add back the 1 allowed mushroom-and-cheese combination. 11 comes from taking the unrestricted total of 12 and removing only 1 mushroom combination instead of all 3 disallowed ones.
- (c) 36 — Method: set the outcomes out in a grid with one die along the top and the other down the side, so that every cell of the grid is one outcome, and count the cells. Working: the red die can land in 6 ways, so the grid has 6 columns, and the blue die can also land in 6 ways, so the grid has 6 rows; the number of cells is 6 × 6 = 36. Answer: 36. The distractors: 12 comes from adding 6 and 6 instead of multiplying them; 6 comes from counting the outcomes of a single die and forgetting that the second die also has to land; 21 comes from treating the two dice as indistinguishable, so that a red 2 with a blue 3 and a red 3 with a blue 2 are counted as one outcome.
Build your own mix at the worksheet builder.