Level:
Correct: 0
Incorrect: 0
Marks: 0/0
Exam Practice
Course:
Topics:
AQA Level 2 Further Maths (Non-calculator) Smart practice A mixed round aimed at your weak spots
Unit 1
Number
Unit 2
Algebra
Unit 3
Coordinate Geometry (2 dimensions only)
Unit 4
Calculus
Unit 5
Matrix Transformations
Unit 6
Geometry
Avg
score:
–
Topics
done:
0/43

The product rule for counting

Practise 17 exam-style questions on The product rule for counting for AQA Level 2 Further Maths (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.

  • 17 questions
  • 1–5 marks each
  • Instant marking
  • No sign-up needed
17 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

Nine runners take part in a race.
There are prizes for first, second and third place.
No two runners finish in the same place.

Work out the number of different ways the three prizes can be won.

Model answer

First place: 9 choices
Second place: 8 choices (any runner except the winner)
Third place: 7 choices
\(9 \times 8 \times 7 = 504\)

Explanation

The prizes are different, so the order matters, and a runner who has won one prize cannot win another: there are 9, then 8, then 7 choices, multiplied by the product rule. Using \(9 \times 9 \times 9\) wrongly lets the same runner take two places.

Mark scheme
  1. 2 marks

    B2 for 504

    B1 for \(9 \times 8 \times 7\) seen. 729 (\(9 \times 9 \times 9\), letting one runner win two prizes) and 24 (\(9 + 8 + 7\)) are B0. A fully correct answer with no working scores full marks.

Question 2

3 marks

Seven friends sit in a row of seven seats.
Ben and Cara must sit in the two end seats.
Dev must sit in the middle seat.

Work out the number of different ways the seven friends can sit.

Model answer

End seats: Ben and Cara can sit either way round, so 2 ways.
Middle seat: Dev, so 1 way.
The other four friends fill the four remaining seats: \(4 \times 3 \times 2 \times 1 = 24\) ways.
Total \(= 2 \times 1 \times 24 = 48\)

Explanation

Fill the restricted seats first, then multiply by the number of ways of arranging everyone else in the seats that are left. Ben and Cara can swap ends, which doubles the count; forgetting this gives 24, and forgetting that Dev's seat is fixed gives 240.

Mark scheme
  1. 1 mark

    M1 for 2 ways for Ben and Cara in the end seats

    eg \(2 \times 1\) seen, or Ben left and Cara right, or Cara left and Ben right, listed

  2. 1 mark

    M1 for \(4 \times 3 \times 2 \times 1\) or 24 for the other four friends

    the four friends who are not Ben, Cara or Dev in the four remaining seats

  3. 1 mark

    A1 for 48

    \(2 \times 5 \times 4 \times 3 \times 2 \times 1 = 240\) (Dev's seat not fixed) scores M1M0A0. 24 (Ben and Cara only one way round) scores M0M1A0. A fully correct answer with no working scores full marks.

Question 3

3 marks

The six letters of the word SQUARE are arranged in a row.
Each letter is used exactly once in each arrangement.
The first letter and the last letter must both be vowels.
(The vowels in SQUARE are U, A and E.)

Work out the number of possible arrangements.

Model answer

First letter: a vowel, 3 choices
Last letter: one of the other two vowels, 2 choices
Middle four letters: the remaining 4 letters in any order, \(4 \times 3 \times 2 \times 1 = 24\)
Total \(= 3 \times 2 \times 24 = 144\)

Explanation

Fill the restricted positions first: 3 vowels for the first letter leaves 2 vowels for the last letter. The remaining 4 letters can then go in the middle in \(4 \times 3 \times 2 \times 1\) ways. A common error is to give the last letter 3 choices as well, using the same vowel twice.

Mark scheme
  1. 3 marks

    B3 for 144

    B2 for \(3 \times 2 \times 4 \times 3 \times 2 \times 1\) oe, eg \(6 \times 24\). B1 for \(3 \times 2\) or 6 for the first and last letters, or \(4 \times 3 \times 2 \times 1\) or 24 for the middle four letters. \(3 \times 3 \times 24 = 216\) (the same vowel used twice) scores B1. A fully correct answer with no working scores full marks.

Question 4

4 marks

A lock has a code of three characters.
Each character is one of the letters A, B and C or one of the digits 1, 2, 3, 4 and 5.
Characters may be repeated.

Show that 360 of the possible codes contain at least one letter and at least one digit.

Model answer

Each character has \(3 + 5 = 8\) choices.
All codes: \(8 \times 8 \times 8 = 512\)
Letters only: \(3 \times 3 \times 3 = 27\)
Digits only: \(5 \times 5 \times 5 = 125\)
At least one letter and at least one digit: \(512 - 27 - 125 = 360\)

Explanation

A code fails the condition only if it is all letters or all digits, so subtract those two counts from the total number of codes. Each count uses the product rule with repetition allowed. A common error is to remove only one of the two cases; counting directly also works, but the place of the odd character out (3 ways) must not be forgotten.

Mark scheme
  1. 1 mark

    M1 for \(8^{3}\) or 512

    all codes: 8 characters for each place. Alternative method (direct count): M1 for \(3 \times 3 \times 5 \times 5\) or 225 (one letter and two digits, with 3 places for the letter)

  2. 1 mark

    M1 for \(3^{3}\) or 27, or \(5^{3}\) or 125

    codes with letters only or digits only. Alternative method: M1 for \(3 \times 3 \times 3 \times 5\) or 135 (two letters and one digit, with 3 places for the digit)

  3. 1 mark

    M1dep for \(512 - 27 - 125\) oe

    dep on both M1 marks. eg \(512 - 152\). Alternative method: M1dep for \(225 + 135\)

  4. 1 mark

    A1 for 360 from a fully correct, complete argument

    An answer that only restates the result scores 0; every step must be shown. \(512 - 27 = 485\) or \(512 - 125 = 387\) (only one case removed) is M1M1M0A0.

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.