GCSE Maths: Listing Combinations and Permutations in Tournament Problems

When you encounter questions about tournaments or competitions in your GCSE maths exam, you're being tested on your ability to list outcomes systematically. These questions often appear on both Foundation and Higher tier papers, testing fundamental skills in combinatorics and logical thinking.

Let's work through a typical example step by step.

Understanding the Problem

We have four football teams: Ajax (A), Barcelona (B), Chelsea (C), and Dortmund (D).

Part (a) asks us to list all matches that will take place if each team plays every other team once.

Part (b) asks us to list all possible final rankings (first, second, third, fourth place).

Part (a): Listing All Matches

This is a classic combinations problem. With 4 teams where each plays every other once, we need to find all possible pairings.

Method 1: Systematic Listing

The key to success in GCSE maths is being systematic. Let's list matches involving each team in turn:

Start with Ajax: Ajax must play Barcelona, Chelsea, and Dortmund

Ajax vs Barcelona (A vs B)

Ajax vs Chelsea (A vs C)

• Ajax vs Dortmund (A vs D)

Move to Barcelona: Barcelona has already played Ajax, so we list remaining matches:

Barcelona vs Chelsea (B vs C)

• Barcelona vs Dortmund (B vs D)

Move to Chelsea: Chelsea has played Ajax and Barcelona, so:

• Chelsea vs Dortmund (C vs D)

1. Dortmund has now played everyone.

Complete List of Matches:

Visualising the Matches

flowchart TD
    A["Ajax"] --> B["Barcelona"]
    A --> C["Chelsea"]
    A --> D["Dortmund"]
    B --> C
    B --> D
    C --> D

This diagram shows each team connected to every other team, representing the 6 matches.

Formula Check

For those interested, there's a formula for this: with `n` teams, the number of matches is `<sup>n(n-1)</sup>⁄<sub>2</sub>`. Here, 4 × 3 ÷ 2 = 6 matches, which matches our count.

Part (b): Listing All Possible Tournament Rankings

Now we need all possible ways the teams could finish (first, second, third, fourth). This is a permutations problem because the order matters.

Setting Up Our Approach

We need to list all possible arrangements of the 4 teams in order. There are 4 choices for first place, then 3 remaining for second, then 2 for third, and finally 1 for fourth.

Total possibilities: 4 × 3 × 2 × 1 = 24 different rankings.

Systematic Listing Method

Let's use a tree diagram approach in our thinking:

Start with Ajax first:

If Ajax is first, then for second place we have B, C, or D

• For each second place choice, we list the remaining possibilities

flowchart TD
    A["A First"] --> B1["B Second"]
    A --> C1["C Second"]
    A --> D1["D Second"]
    
    B1 --> B1C["C Third, D Fourth"]
    B1 --> B1D["D Third, C Fourth"]
    
    C1 --> C1B["B Third, D Fourth"]
    C1 --> C1D["D Third, B Fourth"]
    
    D1 --> D1B["B Third, C Fourth"]
    D1 --> D1C["C Third, B Fourth"]

This shows just the possibilities when Ajax comes first. We would need to repeat this for Barcelona first, Chelsea first, and Dortmund first.

Complete Listing in a Table

For your exam answer, you should present this clearly in a table format. Below is a table listing all 24 possible outcomes (A = Ajax, B = Barcelona, C = Chelsea, D = Dortmund):

Important Exam Tips

1. Show your system - Examiners want to see your method. Write a brief explanation like "Starting with Ajax first, then listing all possibilities..."
2. Use abbreviations - In the exam, you can use A, B, C, D to save time, but make sure you define them first: "Let A = Ajax, B = Barcelona, C = Chelsea, D = Dortmund"
3. Check for duplicates - A common error is listing the same match twice (like A vs B and B vs A). Remember each match appears only once.
4. Count your answers - For part (a), you should have 6 matches. For part (b), you should have 24 rankings. Counting helps you spot if you've missed any.

Common Mistakes to Avoid

Part (a): Listing A vs B AND B vs A (they're the same match!)

Part (b): Missing some permutations or listing the same ranking twice

• Not being systematic: Jumping around randomly will almost certainly lead to missed outcomes

Why This Matters for Your GCSE

Questions like this test several important mathematical skills:

Systematic working - Essential for probability, statistics, and problem-solving

Logical thinking - Breaking down complex problems into manageable parts

1. Organisation - Presenting answers clearly so they can be followed

These skills are assessed by all UK exam boards (AQA, Edexcel, OCR) and appear in both Foundation and Higher tier papers.

Practice Question

Try this similar problem: "Five friends are taking a photo together. In how many different orders can they stand in a line? List all possible arrangements if the friends are Anna, Ben, Chloe, David, and Emma (but you only need to calculate how many, not list them all!)."

(Answer: 5 × 4 × 3 × 2 × 1 = 120 different arrangements)

Final Exam Advice

When you see "list all possible..." in an exam question:

Read carefully - are you finding combinations (order doesn't matter, like matches) or permutations (order matters, like rankings)?

Choose a systematic method and stick to it

Present your answer clearly, using tables or lists

1. Double-check by counting your outcomes
2. Good luck with your GCSE maths preparation! Remember that practice with these systematic listing questions will make you much more confident in the exam.