The Product Rule for Counting - Worksheets, Questions and Revision
56 original exam-style questions - 17 pages of questions with a full mark scheme - free printable PDF.
The Product Rule for Counting revision guideMore GCSE Maths practiceMock exams
This topic is chapter 5 of GCSE Maths Higher Topic Workbook 1 and chapter 2 of GCSE Maths Grade 7 Booster 3.

The product rule for counting is a rule stating that if one choice can be made in m ways and a second, independent choice can be made in n ways, the total number of ways to make both choices is m multiplied by n. It is used at GCSE to count outcomes such as passwords, menus, arrangements and number plates without listing every single possibility.
- Identify each separate choice or position involved in the situation, and work out how many options are available for each one.
- If an item can be repeated or reused, such as digits in a PIN, the number of options stays the same for every position.
- If an item cannot be repeated, such as letters in a password with no repeats, the number of options decreases by one for each position already used, since the previous choice is no longer available.
- Multiply the number of options for every choice or position together to find the total number of outcomes.
- If the situation has a restriction where some combinations are not allowed, first count the total with no restriction, then subtract the number of combinations that break the rule.
- For arrange all n different items in a row questions, the total number of arrangements is n x (n - 1) x (n - 2) x ... x 1, known as n factorial.
Worked example
An ice cream shop offers a choice of 4 flavours, 3 toppings and 2 cone types. Each customer chooses exactly one flavour, one topping and one cone type. Work out the number of different ice creams possible.
- There are 4 choices for the flavour, 3 choices for the topping, and 2 choices for the cone type.
- Since the three choices are independent, multiply the number of options together: 4 x 3 x 2.
- 4 x 3 x 2 = 24.
6.3 The Product Rule for Counting
Work out the number of different ways Tom can choose one starter and one dessert.
Work out the number of different outcomes possible.
Work out the total number of different sandwiches possible.
Work out the number of different access codes possible.
Work out the number of different ice creams that can be made by choosing one flavour, one cone and one topping.
Work out the number of different sequences of heads and tails possible.
Work out the number of different PE kits possible.
Work out the number of different codes possible.
Work out the number of different codes possible.
Work out the number of different gate codes possible.
Work out how many of these three-digit numbers are even.
Work out the total number of different number plates possible.
Work out the number of different ways the five novels can be arranged.
Work out the number of different orders the books can be placed in.
Work out the number of different ways the 4 subjects can be arranged across the 4 slots.
Work out the number of different combinations possible.
Work out the number of different ways the captain and vice-captain can be chosen.
Work out the number of different ways the three medals can be awarded.
Work out how many of these four-digit numbers are even.
Work out the value of n.
Work out the number of different codes possible.
A correct answer earns full marks unless the question asks for working, a method, proof or explanation.
Question 1
- 6 caoB1
- Answer: 6
Question 2
- 36 caoB1
- Answer: 36
Question 3
- 4 x 3 oe seenM1
- 12 caoA1
- Answer: 12
Question 4
- (a) 10 x 10 x 10 oe seenM1
- (a) 1000 caoA1
- (a) Answer: 1000
- (b) 10 x 9 x 8 oe seenM1
- (b) 720 caoA1
- (b) Answer: 720
Question 5
- 26 * 10 oe seenM1
- 260 caoA1
- Answer: 260
Question 6
- 5 * 3 * 2 oe seenM1
- 30 caoA1
- Answer: 30
Question 7
- 2 * 2 * 2 oe seenM1
- 8 caoA1
- Answer: 8
Question 8
- 4 * 3 * 2 oe seenM1
- 24 caoA1
- Answer: 24
Question 9
- 5 * 5 oe seenM1
- 25 caoA1
- Answer: 25
Question 10
- 5 * 4 oe seenM1
- 20 caoA1
- Answer: 20
Question 11
- 4 * 4 oe seenM1
- 16 caoA1
- Answer: 16
Question 12
- identifies 2 choices for the units digit (2 or 4)M1
- (dep) 4 x 3 for the remaining two digits, in either orderM1
- 24 caoA1
- Answer: 24
Question 13
- (a) 5 x 4 x 3 x 2 x 1 oe seenM1
- (a) 120 caoA1
- (a) Answer: 120
- (b) fixes A in the first position and arranges remaining 4 letters: 4 x 3 x 2 x 1 oeM1
- (b) 24 caoA1
- (b) Answer: 24
Question 14
- 8 x 8 x 8 x 8 x 8M1
- 32768 caoA1
- Answer: 32768
Question 15
- 5 x 3 x 3 oeM1
- 45 caoA1
- Answer: 45
Question 16
- 2 ways to place the two largest booksM1
- 5! ways for the restM1
- 240 caoA1
- Answer: 240
Question 17
- 5 x 5 x 4 = 100M1
- 3 x 4 outfits not allowedM1
- 88 caoA1
- Answer: 88
Question 18
- 5 x 7 x 3 oeM1
- 105 caoA1
- Answer: 105
Question 19
- number of letter combinations 729 foundM1
- 10 digit combinationsM1
- 7290 caoA1
- Answer: 7290
Question 20
- 6 x 6 x 6 x 6 x 6M1
- 7776 caoA1
- Answer: 7776
Question 21
- 4 x 3 x 6 oeM1
- 72 caoA1
- Answer: 72
Question 22
- 5 people to arrange in the remaining placesM1
- 5 x 4 x 3 x 2 x 1M1
- 120 caoA1
- Answer: 120
Question 23
- 4 x 3 x 3 = 36M1
- 1 x 3 outfits not allowedM1
- 33 caoA1
- Answer: 33
Question 24
- 6 x 7M1
- 42 caoA1
- Answer: 42
Question 25
- number of letter combinations 42 foundM1
- 10 digit combinationsM1
- 420 caoA1
- Answer: 420
Question 26
- considers the restricted digit first (or equivalent systematic method)M1
- product of the choices for each placeM1
- correct treatment of the restrictionM1
- 18 caoA1
- Answer: 18
Question 27
- 5 x 4 x 2 = 40M1
- 3 x 2 outfits not allowedM1
- 34 caoA1
- Answer: 34
Question 28
- 2 ways to place the two largest booksM1
- 4! ways for the restM1
- 48 caoA1
- Answer: 48
Question 29
- 6 x 6 x 6 x 6M1
- 1296 caoA1
- Answer: 1296
Question 30
- number of letter combinations 81 foundM1
- 100 digit combinationsM1
- 8100 caoA1
- Answer: 8100
Question 31
- 6 x 5 x 4M1
- 120 caoA1
- Answer: 120
Question 32
- treats the pair as one objectM1
- 2 x 4!M1
- 48 caoA1
- Answer: 48
Question 33
- considers the restricted digit first (or equivalent systematic method)M1
- product of the choices for each placeM1
- correct treatment of the restrictionM1
- 68 caoA1
- Answer: 68
Question 34
- number of letter combinations 343 foundM1
- 100 digit combinationsM1
- 34300 caoA1
- Answer: 34300
Question 35
- treats the pair as one objectM1
- 2 x 5!M1
- 240 caoA1
- Answer: 240
Question 36
- considers the restricted digit first (or equivalent systematic method)M1
- product of the choices for each placeM1
- correct treatment of the restrictionM1
- 12 caoA1
- Answer: 12
Question 37
- considers the restricted digit first (or equivalent systematic method)M1
- product of the choices for each placeM1
- 60 caoA1
- Answer: 60
Question 38
- considers the restricted digit first (or equivalent systematic method)M1
- product of the choices for each placeM1
- correct treatment of the restrictionM1
- 48 caoA1
- Answer: 48
Question 39
- 26 x 26 (= 676) oeM1
- 676 x 10 x 10 oe (dependent on first M1)M1
- 67600 caoA1
- Answer: 67600
Question 40
- 5 x 4 oe (choices for the first two positions)M1
- (dep) x 3 x 2 x 1 oe (remaining positions)M1
- 120 caoA1
- Answer: 120
Question 41
- (a) 26 x 25 oe seenM1
- (a) 650 caoA1
- (a) Answer: 650
- (b) 10 x 9 x 8 oe seenM1
- (b) 720 caoA1
- (b) Answer: 720
- (c) 468000 cao, ft from 650 x their (b)B1
- (c) Answer: 468000
Question 42
- 3 * 2 * 1 oe seenM1
- 6 caoA1
- Answer: 6
Question 43
- 4 choices identified for the first slotB1
- (dep) 4 * 3 * 2 * 1 oe for all four slotsM1
- 24 caoA1
- Answer: 24
Question 44
- 10 choices identified for each dialB1
- (dep) 10 * 10 * 10 oeM1
- 1000 caoA1
- Answer: 1000
Question 45
- 7 choices identified for captainB1
- (dep) 7 * 6 oe for vice-captainM1
- 42 caoA1
- Answer: 42
Question 46
- (a) 24 caoB1
- (a) Answer: 24
- (b) 24 (or their (a)) identified as the unrestricted total, ftM1
- (b) identifies that 2 combinations must be removed (style D with gold, style D with silver)M1
- (b) 22 caoA1
- (b) Answer: 22
Question 47
- (a) 3 x 4 oe seenM1
- (a) 12 caoA1
- (a) Answer: 12
- (b) 3 x 2 oe seen (3 remaining roads Corby to Barton, 2 remaining roads Barton to Ashby)M1
- (b) 6 caoA1
- (b) Answer: 6
Question 48
- 8 choices for goldM1
- (dep) x 7 for silverM1
- (dep) x 6 for bronzeM1
- 336 caoA1
- Answer: 336
Question 49
- (a) 20 caoB1
- (a) Answer: 20
- (b) 2 caoB1
- (b) Answer: 2
- (c) their (a) - their (b), ftM1
- (c) 18 caoA1
- (c) Answer: 18
Question 50
- identifies 3 choices for the units digit (2, 4 or 6)M1
- (dep) 6 x 5 x 4 for the remaining three digits, in some orderM1
- 360 caoA1
- Answer: 360
Question 51
- (a) 8 * 7 * 6 oe seenM1
- (a) 336 caoA1
- (a) Answer: 336
- (b) identifies 2 choices for treasurer (Kwame or Sophie)M1
- (b) (dep) 2 * 7 * 6 oe for the remaining two rolesM1
- (b) 84 caoA1
- (b) Answer: 84
Question 52
- sets up n(n - 1) = 132 oeM1
- forms n2 - n - 132 = 0 oeM1
- (dep) factorises to (n - 12)(n + 11) = 0, or uses the quadratic formula correctlyM1
- n = 12A1
- cso: rejects n = -11 since n must satisfy n ≥ 2, so n = 12A1
- Answer: n = 12
Question 53
- (a) 4 x 3 x 2 x 1 oe seenM1
- (a) 24 caoA1
- (a) Answer: 24
- (b) treats house key and car key as a single block, giving 3 items to arrange (3! = 6), then multiplies by 2 for the two internal orders of the blockM1
- (b) 12 caoA1
- (b) Answer: 12
- (c) their (b) / their (a), ftM1
- (c) 1/2 caoA1
- (c) Answer: 1/2
Question 54
- (a) 5 * 4 * 3 oe seenM1
- (a) 60 caoA1
- (a) Answer: 60
- (b) identifies that the last digit must be 2 or 8 (2 choices)M1
- (b) (dep) 2 * 4 * 3 oe for the remaining two digitsM1
- (b) 24 caoA1
- (b) Answer: 24
Question 55
- (a) 26 * 26 oe seenM1
- (a) 676 caoA1
- (a) Answer: 676
- (b) 25 * 25 (= 625) identified as the number of IDs with no letter ZM1
- (b) (dep) 676 - 625 oe (total minus none)M1
- (b) 51 caoA1
- (b) Answer: 51
Question 56
- identifies 9 choices for the first digit and 9 choices for the last digit (excluding 0 in each case)M1
- (dep) 9 * 10 * 9 oeM1
- 810 caoA1
- Answer: 810
Mark your answers
Check answers without an account. Some answers can be checked automatically; use the mark scheme to mark the rest.