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.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.
- 2.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.
- 3.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.
- 4.Five different books are placed in a row on a shelf. Work out how many different orders the five books can be placed in.
- 5.A photography studio offers 4 backdrops and 3 outfits for a portrait session. The plain grey backdrop, one of the 4 backdrops, cannot be used with the formal suit outfit, one of the 3 outfits. Work out how many different backdrop-and-outfit combinations are possible.
- 6.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.
- 7.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.
- 8.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.
- 9.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.
- 10.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.
- 11.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.
- 12.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.
- 13.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.
- 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.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.
Answer key
- (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.
- (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) 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.
- (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) 11 — Method: work out the total number of combinations as if there were no restriction, then subtract the one combination that is not allowed. Working: without any restriction there are 4 backdrops × 3 outfits = 12 combinations. The grey backdrop with the formal suit is not allowed, removing 1 combination: 12 − 1 = 11. Answer: 11. 12 comes from forgetting to remove the combination that is not allowed. 8 comes from removing the entire formal suit outfit from the count instead of just the one combination with the grey backdrop. 10 comes from removing two combinations instead of just the one that is not allowed.
- (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.
- (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) 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) 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.
- (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) 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.
- (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.
Build your own mix at the worksheet builder.