Level:
Correct: 0
Incorrect: 0
Marks: 0/0
Exam Practice
Course:
Topics:
AQA GCSE Maths (Higher non-calculator) Smart practice A mixed round aimed at your weak spots
Unit 1
Number
Unit 2
Algebra
Unit 3
Ratio, proportion and rates of change
Unit 4
Geometry and measures
Unit 5
Probability
Unit 6
Statistics
Avg
score:
–
Topics
done:
0/97

Systematic listing and the product rule

Practise 29 exam-style questions on Systematic listing and the product rule for AQA GCSE Maths (Higher non-calculator). Write your answer as you would in the exam and get it marked in seconds against the mark scheme, point by point, with the Study Helper on hand if you get stuck.

  • 29 questions
  • 1–5 marks each
  • Instant marking
  • No sign-up needed
20 questions, marked as you go

Sample questions with model answers

Here are 4 of the questions in this topic, each with a model answer, an explanation of why it earns the marks and the mark scheme an examiner would use.

Question 1

2 marks

A restaurant menu has 4 starters, 6 main courses and 3 desserts.
A meal is one starter, one main course and one dessert.

How many different meals are possible?

Model answer

4 × 6 × 3 = 72 different meals

Explanation

The product rule extends to more than two choices: multiply the number of options at each stage. Each of the 4 starters can go with each of the 6 mains (24 pairs), and each pair can go with each of the 3 desserts.

Mark scheme
  1. 1 mark

    M1 for 4 × 6 × 3

  2. 1 mark

    A1 for 72

    correct answer with no working scores full marks; 13 (adding) scores 0

Question 2

2 marks

There are 10 teams in a league.
Each team plays every other team twice, once at home and once away.

How many matches are played altogether?

Model answer

Each of the 10 teams plays 9 home matches (one against each other team).
Number of matches = 10 × 9 = 90

Explanation

Count the home matches: each team has one home match against each of the other 9 teams, and every match is the home match of exactly one team. So the total is 10 × 9. Doubling 10 × 9 would count every match twice.

Mark scheme
  1. 1 mark

    M1 for 10 × 9, or (9 + 8 + 7 + ... + 1) × 2

    oe, e.g. 45 × 2

  2. 1 mark

    A1 for 90

    correct answer with no working scores full marks; 45 or 180 scores 0 unless a correct method is seen

Question 3

3 marks

A pizza has one base and two different toppings.
There are 3 different bases and 7 different toppings to choose from.

How many different pizzas are possible?

Model answer

Pairs of different toppings (order does not matter):
Topping 1 with 6 others, topping 2 with 5 others, ...
6 + 5 + 4 + 3 + 2 + 1 = 21 pairs
Pizzas = 21 × 3 bases = 63

Explanation

Choosing two toppings is like choosing pairs: ham and cheese is the same as cheese and ham, so 7 × 6 = 42 counts every pair twice and must be halved. Then each pair can go on any of the 3 bases.

Mark scheme
  1. 1 mark

    M1 for a systematic method to count pairs of toppings, e.g. 6 + 5 + 4 + 3 + 2 + 1 or 7 × 6 ÷ 2

    or a systematic list of pairs

  2. 1 mark

    M1dep for their 21 × 3

  3. 1 mark

    A1 for 63

    correct answer with no working scores full marks; SC1 for 126 (from 7 × 6 × 3, counting each pair of toppings twice) only if no other marks are awarded

Question 4

4 marks

A lock has a code of three digits.
Each digit can be any digit from 0 to 9, and digits can be repeated.

Amy knows that
• the first digit is odd
• the three digits add up to 10

How many different codes are possible?

Model answer

First digit 1: the other two add to 9: 09, 18, 27, ..., 90 → 10 codes
First digit 3: the other two add to 7: 07, 16, ..., 70 → 8 codes
First digit 5: add to 5 → 6 codes
First digit 7: add to 3 → 4 codes
First digit 9: add to 1 → 2 codes
Total = 10 + 8 + 6 + 4 + 2 = 30

Explanation

Split the problem into cases by the first digit, then count the pairs of digits that make the remaining total. Two digits adding to n (with n at most 9) can be done in n + 1 ways, counting 0 and order: for example 0 + 9 and 9 + 0 are different codes.

Mark scheme
  1. 1 mark

    M1 for considering each odd first digit with the sum of the other two digits: 1 → 9, 3 → 7, 5 → 5, 7 → 3, 9 → 1

  2. 1 mark

    M1 for the correct number of pairs for at least two cases, e.g. 10 pairs adding to 9 (09, 18, ..., 90) or 8 pairs adding to 7

  3. 1 mark

    M1 for 10 + 8 + 6 + 4 + 2

    or a complete systematic list

  4. 1 mark

    A1 for 30

    correct answer with no working scores full marks

Ready to try the rest? Every answer you write is marked against the mark scheme, so you can see exactly where the marks are.

Study Helper Hints first, answers after you try

Stuck on this one? Ask for a hint and I’ll point you in the right direction, without giving the answer away. Once you’ve checked your answer, I’ll show you how the marks are awarded.