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 Higher
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.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.
- 3.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.
- 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 school council must choose a committee of 3 pupils from 8 volunteers. The three places on the committee are all the same, so only which pupils are chosen matters. Work out how many different committees could be formed.
- 6.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.
- 7.Three-digit numbers are made using the digits 2, 3, 4, 6, 8 and 9. No digit may be used twice in the same number. Work out how many of these three-digit numbers are odd.
- 8.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.
- 9.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.
- 10.A 3-character PIN starts with one letter chosen from A, B, C, D and E, followed by two different digits chosen from 1 to 9 (no digit may be used twice in the same PIN). Work out how many different PINs are possible.
- 11.A restaurant offers a lunch deal of one starter from 5 options, one main from 6 options and one dessert from 3 options. Work out how many different lunch deals are possible.
- 12.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.
- 13.A driving instructor is working out how many current-style UK number plates are possible. The format is 2 letters, then 2 digits, then a space, then 3 letters (for example AB12 CDE). The letters I, O and Q are never used in any letter position, leaving 23 allowed letters, but every letter and every digit may repeat anywhere on the plate. Work out how many different number plates are possible, giving your answer in standard form to 2 significant figures.
- 14.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.
- 15.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.
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.
- (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.
- (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.
- (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.
- (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.
- (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.
- (a) 40 — Method: a number is odd exactly when its units digit is odd, so the restricted position is filled first and the two free positions are then filled from the digits that are left, multiplying the number of choices at each stage. Working: of the six digits only 3 and 9 are odd, so there are 2 choices for the units digit; once that digit has been used, 5 digits remain for the hundreds position and then 4 remain for the tens position, so the count is 2 × 5 × 4 = 40. Answer: 40. The distractors: 120 comes from ignoring the word odd altogether and counting every three-digit number that can be made from the six digits, 6 × 5 × 4; 60 comes from filling the hundreds and tens positions first, 6 then 5, and only then allowing 2 odd digits for the units position, which overcounts because one of 3 and 9 may already have been used, giving 6 × 5 × 2; 72 comes from restricting the units digit to 3 or 9 correctly but overlooking the condition that no digit may be used twice, so all six digits are still counted as available for each of the other two positions, giving 2 × 6 × 6.
- (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.
- (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) 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.
- (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) 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.
- (b) 6.4 × 10⁸ — There are 5 letter positions, each with 23 choices, and 2 digit positions, each with 10 choices, and every position is independent because repeats are allowed. By the product rule, the total is 23⁵ × 10² = 6,436,343 × 100 = 643,634,300, which is 6.4 × 10⁸ to 2 significant figures. Using all 26 letters instead of the 23 that are actually allowed, ignoring the excluded letters entirely, gives 26⁵ × 10² = 1,188,137,600, which is 1.2 × 10⁹ to 2 significant figures. Adding the seven counts of choices instead of multiplying them, 23 + 23 + 10 + 10 + 23 + 23 + 23, gives 135, which is 1.4 × 10² to 2 significant figures — a total far too small for seven independent positions. Swapping which count of choices belongs to letters and which belongs to digits, working out 23² × 10⁵ instead of 23⁵ × 10², gives 52,900,000, which is 5.3 × 10⁷ to 2 significant figures.
- (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.
- (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.
Build your own mix at the worksheet builder.