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 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.
- 2.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.
- 3.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.
- 4.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.
- 5.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.
- 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 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.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.
- 9.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.
- 10.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.
- 11.Ten players enter a chess tournament. Every player plays every other player exactly once. Work out how many games are played in the tournament.
- 12.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.
- 13.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.
- 14.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.
- 15.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.
Answer key
- (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.
- (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.
- (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.
- (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) 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.
- (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) 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.
- (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) 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) 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) 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.
- (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) 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) 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.
- (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.
Build your own mix at the worksheet builder.