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 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.
- 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.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.
- 4.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.
- 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.Two-digit numbers are made using the digits 1, 2, 3 and 4, and no digit may be used twice in the same number. Work out how many different two-digit numbers can be made.
- 7.Ten players enter a chess tournament. Every player plays every other player exactly once. Work out how many games are played in the tournament.
- 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 vending machine sells 4 types of crisps, 5 types of chocolate bar and 2 types of drink. Work out how many different combinations of one crisp packet, one chocolate bar and one drink can be bought.
- 10.By listing systematically, work out how many two-digit multiples of 5 can be made using the digits 0, 3 and 5, if each digit can be used at most once and the number cannot start with 0.
- 11.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.
- 12.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.
- 13.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.
- 14.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.
- 15.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.
Answer key
- (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.
- (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) 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.
- (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.
- (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) 12 — Method: build the number one place at a time, listing systematically: fix the tens digit, then run through every units digit that is still available. Working: any of the 4 digits can go in the tens place, and once it has been used only 3 digits are left for the units place, so there are 4 × 3 = 12 numbers; listing the numbers that begin with 1 gives 12, 13 and 14, and each of the other three starting digits gives 3 numbers in the same way. Answer: 12. The distractors: 16 comes from working out 4 × 4, which allows a digit to be used twice; 8 comes from multiplying the 4 digits by the 2 places in the number instead of multiplying the choices available at each place; 6 comes from treating a number and its reverse as the same, counting only the unordered pairs of digits.
- (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) 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) 40 — Multiply the number of choices for each item: 4 × 5 × 2 = 40. 11 comes from adding the three numbers instead of multiplying them. 20 comes from multiplying only the crisps and chocolate bars, 4 × 5, and forgetting the drink. 10 comes from multiplying only the chocolate bars and drinks, 5 × 2, and forgetting the crisps.
- (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.
- (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) 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.
- (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.
- (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) 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.
Build your own mix at the worksheet builder.