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
Systematic listing and the product rule for counting worksheet — GCSE Higher
MathsUKwww.geekhero.co.uk
- 1.A three-digit code is made using the digits 1, 2 and 3, and each digit may be used more than once. Work out how many different three-digit codes can be made.
- 2.Ten athletes run in a final. Gold, silver and bronze medals are awarded to the first three athletes to finish, and there are no ties. Work out how many different ways the three medals can be awarded.
- 3.Two-digit numbers are formed using the digits 2, 5, 7 and 8, and each digit may be used only once in a number. Work out how many of these two-digit numbers are even.
- 4.Ten players enter a chess tournament. Every player plays every other player exactly once. Work out how many games are played in the tournament.
- 5.A board game has 5 different character pieces and 4 different colour tokens. The dragon piece can only be used with the gold token. Work out how many different combinations of one character piece and one colour token are possible.
- 6.A netball team has 8 players. Two of them are chosen to be captains, and the two captains have equal standing. Work out how many different pairs of captains could be chosen.
- 7.Two fair six-sided dice are rolled together. One die is red and the other is blue. Work out how many different outcomes are possible.
- 8.A car manufacturer offers a car in 6 colours and 4 trim levels. Two colour-and-trim combinations are not available: red with sport trim, and white with sport trim. Work out how many different colour-and-trim combinations are available.
- 9.A florist has 5 different flowers. Freya picks 3 of them to make a small bunch, and the order in which she picks them does not matter. Work out how many different bunches she could make.
- 10.A padlock code is formed from 3 different digits chosen from 1, 2, 3, 4, 5 and 6 (no digit may be used twice in the same code). Work out how many different codes can be made.
- 11.A café offers sandwiches with one filling from 5 choices and one type of bread from 4 choices. Cheese and mustard, which is one of the 5 fillings, is not available on gluten-free bread, which is one of the 4 breads. Work out how many different sandwiches are possible.
- 12.A café meal deal is one sandwich, one snack and one drink. There are 4 different sandwiches, 3 different snacks and 2 different drinks to choose from. Work out how many different meal deals are possible.
- 13.Five different books are placed in a row on a shelf. Work out how many different orders the five books can be placed in.
- 14.A bag holds 5 different sweets. Noah takes 2 of the sweets out of the bag together, so the order in which he takes them does not matter. Work out how many different pairs of sweets he could take.
- 15.A café sells ice cream in three flavours: vanilla, mango and pistachio. Isla buys a cone with two scoops, using two different flavours, one for the bottom scoop and one for the top scoop. Work out how many different cones she could buy.
Answer key
- (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) 720 — Method: the three medals are awarded one after the other, and each award removes one athlete from the pool available for the next, so the product rule multiplies the number of choices at each stage. Working: 10 athletes could take gold; once gold is settled 9 could take silver; once silver is settled 8 could take bronze; so the number of ways is 10 × 9 × 8 = 720. Answer: 720. The distractors: 1000 comes from working out 10 × 10 × 10, which allows the same athlete to take more than one medal; 120 comes from dividing the product by 6, which would be right only if the three medals were identical, whereas gold, silver and bronze are different; 30 comes from multiplying the 10 athletes by the 3 medals instead of multiplying the choices at each stage.
- (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.
- (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.
- (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.
- (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.
- (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.
- (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) 10 — Method: picking 3 flowers from 5 leaves 2 flowers behind, so counting the different pairs that could be left out counts the bunches, and those pairs can be listed systematically. Working: number the flowers 1 to 5; the first flower can be left out alongside any of the 4 flowers after it, the second alongside any of the 3 after it, the third alongside any of the 2 after it and the fourth alongside the last one, so the number of pairs left out is 4 + 3 + 2 + 1 = 10. Answer: 10. The distractors: 60 comes from working out 5 × 4 × 3 and treating the three picks as an ordered selection when the order does not matter; 30 comes from dividing that product by 2 instead of by the 6 orders in which three chosen flowers could have been picked; 15 comes from multiplying the 5 flowers by the 3 flowers picked instead of counting the selections.
- (a) 120 — There are 6 choices for the first digit. The second digit must be different from the first, leaving 5 choices, and the third digit must differ from both of the first two, leaving 4 choices. By the product rule, the number of codes is 6 × 5 × 4 = 120. Allowing every digit to repeat, ignoring the 'no digit twice' rule entirely, gives 6 × 6 × 6 = 216. Adding the number of choices at each position instead of multiplying them, 6 + 5 + 4, gives 15. Treating the three chosen digits as one unordered set, rather than as digits in a fixed order on the padlock, divides by the 3! = 6 ways of arranging them: 120 ÷ 6 = 20.
- (c) 19 — Without any restriction there would be 5 × 4 = 20 different sandwiches. The restriction removes exactly one combination, cheese and mustard on gluten-free bread, so subtract 1: 20 − 1 = 19. 20 comes from ignoring the restriction completely. 15 comes from removing the gluten-free bread altogether, as if none of the fillings were available on it, 5 × 3 = 15. 16 comes from removing the cheese and mustard filling completely, as if it were not available on any bread, 4 × 4 = 16.
- (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.
- (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) 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.
- (a) 6 — Method: the two scoops sit in different places on the cone, so a cone is an ordered choice; the possibilities can be listed systematically or counted by multiplying the choices available at each stage. Working: there are 3 flavours for the bottom scoop, and once that flavour is used only 2 flavours remain for the top scoop, so there are 3 × 2 = 6 cones; listing them confirms this, since vanilla on the bottom allows mango or pistachio on top, mango on the bottom allows vanilla or pistachio, and pistachio on the bottom allows vanilla or mango. Answer: 6. The distractors: 3 comes from treating the two scoops as interchangeable, so that vanilla under mango and mango under vanilla are counted as one cone; 9 comes from allowing the same flavour to be used for both scoops, giving 3 × 3; 5 comes from adding the 3 choices for the bottom scoop to the 2 choices left for the top scoop instead of multiplying them.
Build your own mix at the worksheet builder.