The product rule for counting Revision Notes for AQA GCSE Further Maths

The Product Rule for Counting

What is the product rule for counting?

The product rule for counting is a powerful method that helps us find the total number of ways to complete a task that involves making several choices in sequence. When you need to make multiple decisions one after another, you simply multiply the number of options available at each step.

Think of it this way: if you're getting dressed and have 3 shirts and 4 pairs of trousers, you can make $3 \times 4 = 12$ different outfit combinations. The product rule works the same way for more complex counting problems.

infoNote

The key insight is that each choice is independent - your choice for the first decision doesn't limit the available options for subsequent decisions (unless specifically stated otherwise).

Basic example - arranging cards

Let's start with a simple example to understand how this works. Consider four cards labelled A, B, C, and D.

When we want to arrange these four cards in a line, we need to think about how many choices we have for each position:

First position: We can choose any of the 4 cards (A, B, C, or D)
Second position: We have 3 cards left to choose from
Third position: We have 2 cards remaining
Fourth position: Only 1 card is left

lightbulbExample

Worked Example: Arranging Four Cards

Using the product rule: $4 \times 3 \times 2 \times 1 = 24$ different arrangements

The calculation works as follows:

Position 1: 4 choices
Position 2: 3 remaining choices
Position 3: 2 remaining choices
Position 4: 1 remaining choice
Total: $4 \times 3 \times 2 \times 1 = 24$ arrangements

The table shows all 24 possible arrangements systematically listed. While listing them all works for small numbers, imagine trying to do this with 10 or 20 items - the product rule gives us a much quicker calculation method!

The factorial function

When we arrange $n$ distinct objects in a line, we get the pattern $n \times (n-1) \times (n-2) \times ... \times 2 \times 1$ . This appears so frequently in mathematics that it has its own special notation called factorial.

chatImportant

Definition of Factorial

The factorial function is written as $n!$ and is defined as:

$n! = n \times (n-1) \times (n-2) \times ... \times 2 \times 1$ for any positive integer $n$
$0! = 1$ by special definition

This is one of the most important formulas in counting problems!

Worked example - seven-digit numbers

Let's look at a more complex example. We have seven cards numbered 2, 3, 4, 5, 6, 7, 8.

lightbulbExample

Worked Example: Seven-Digit Numbers

Question: Using all seven cards, how many different seven-digit numbers can we form?

Solution:

First digit: 7 choices
Second digit: 6 choices
Third digit: 5 choices
Fourth digit: 4 choices
Fifth digit: 3 choices
Sixth digit: 2 choices
Seventh digit: 1 choice

Total arrangements = $7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 7! = 5,040$

Real-world applications

The product rule isn't just an abstract mathematical concept - it has many practical applications in everyday situations.

Sports team arrangements

lightbulbExample

Worked Example: Volleyball Team Positions

Question: In a volleyball team, six players start in six different positions. How many different starting arrangements are possible?

Solution: Each position must be filled by a different player, so: $6 \times 5 \times 4 \times 3 \times 2 \times 1 = 6! = 720$ different arrangements

Vehicle registration plates

A practical application involves the UK vehicle registration system introduced in 2001. Each plate consists of:

Two letters (excluding I, Q, Z) identifying the registration area: 23 choices each
Two digits (except 01) indicating the vehicle's age: 99 choices
Three more letters (excluding I and Q): 24 choices each

Total possible plates = $23 \times 23 \times 99 \times 24 \times 24 \times 24 = 723,976,704$

infoNote

This enormous number shows why the DVLA chose this system - it provides enough unique combinations for many years of vehicle registrations!

Working with constraints

Many counting problems involve restrictions or constraints that we must consider carefully. The key is to handle these systematically.

Example - forming numbers with constraints

Given digits: 3, 1, 7, 9, 8, 5

lightbulbExample

Worked Example: Four-Digit Numbers

Question: How many four-digit numbers can be made using each digit no more than once?

Solution:

First digit: 6 choices
Second digit: 5 remaining choices
Third digit: 4 remaining choices
Fourth digit: 3 remaining choices

Total: $6 \times 5 \times 4 \times 3 = 360$

lightbulbExample

Worked Example: Even Three-Digit Numbers

Question: How many even three-digit numbers can be made?

Solution: For a number to be even, it must end in an even digit. From our set, only 8 is even.

Last digit: 1 choice (must be 8)
First digit: 5 remaining choices
Second digit: 4 remaining choices

Total = $1 \times 5 \times 4 = 20$ even three-digit numbers

Handling multiple constraints

When dealing with multiple restrictions, it's essential to work systematically through each constraint.

lightbulbExample

Worked Example: Complex Constraints

Question: How many odd numbers greater than 500,000 can be made using digits 3, 1, 7, 9, 8, 5?

Solution: The number must:

Be greater than 500,000 (so first digit must be 5, 7, 8, or 9)
Be odd (so last digit must be 1, 3, 7, or 9)

We need to consider different cases:

If first digit is 5, 7, or 9: last digit has 4 possible values
If first digit is 8: last digit has 5 possible values (1, 3, 5, 7, 9)

After working through all possibilities systematically:

17 ways to choose first and last digits
$4 \times 3 \times 2 \times 1 = 24$ ways to arrange the middle four digits

Total = $17 \times 24 = 408$ odd numbers greater than 500,000

chatImportant

Key Strategy for Constraints

Always handle the most restrictive conditions first. This prevents you from making invalid choices that would need to be corrected later in your calculation.

Key problem-solving strategies

Understanding the theory is important, but developing a systematic approach to problem-solving is equally crucial.

infoNote

Step-by-Step Approach

Identify the sequence: Determine what choices need to be made and in what order
Count options for each step: Consider any restrictions that apply
Apply the product rule: Multiply the number of choices at each step
Check for constraints: Make sure all conditions are satisfied

Common exam techniques

Start with restrictions: Handle the most restrictive conditions first
Use systematic counting: For complex problems, break them into cases
Double-check your logic: Ensure you haven't counted anything twice or missed any possibilities
Consider whether order matters: Arrangements (where order matters) use the product rule directly

infoNote

When facing a complex problem, don't try to solve everything at once. Break it down into smaller, manageable parts and tackle each constraint systematically.

bookmarkSummary

Key Points to Remember:

The product rule multiplies choices: When making sequential decisions, multiply the number of options at each step
Factorial notation is shorthand: $n! = n \times (n-1) \times (n-2) \times ... \times 2 \times 1$ , and remember that $0! = 1$
Handle constraints systematically: Work through restrictions step by step, often dealing with the most limiting conditions first
Order matters in arrangements: The product rule gives us the number of ways to arrange items where the sequence is important
Break complex problems into cases: When multiple constraints apply, consider different scenarios separately then combine the results

The product rule for counting (AQA GCSE Further Maths): Revision Notes