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 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.
- 2.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.
- 3.Five different books are placed in a row on a shelf. Work out how many different orders the five books can be placed in.
- 4.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.
- 5.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.
- 6.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.
- 7.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.
- 8.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.
- 9.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.
- 10.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.
- 11.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.
- 12.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.
- 13.A café is planning its lunch menu. It will offer one soup from 3 choices and one sandwich from 4 choices, but the mushroom soup, one of the 3 soups, will only be served with the cheese sandwich, one of the 4 sandwiches, on a normal day. Work out how many different soup-and-sandwich combinations are available on a normal day.
- 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 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.
Answer key
- (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.
- (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.
- (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.
- (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.
- (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.
- (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.
- (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) 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.
- (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) 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) 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.
- (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.
- (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) 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.
Build your own mix at the worksheet builder.