Salam Academy
Papers 1, 2 · Module

Permutations and combinations

4037 past papers

3 subtopics≈ 100 min in total
  1. Arrangements and factorials

    How many ways can things be put in order? Multiply the number of choices for each place, which gives n!n! for nn different objects, then divide out the orderings you cannot tell apart.

    ≈ 30 min
  2. Arrangements with restrictions

    "Must be at the end", "must be together", "must not be next to each other": deal with the fussy conditions first, then arrange everything else freely. Glue objects together, or slot them into the gaps.

    ≈ 35 min
  3. Selections (combinations)

    When order does not matter, count with nCr^nC_r. Split selections into cases, use "at least one == total −- none", and turn counts into probabilities by dividing by the total number of selections.

    ≈ 35 min

What the Cambridge 4037 syllabus asks for in permutations and combinations

  • 11.1 Permutations or combinations
  • 11.2 Factorials and the formulae
  • 11.3 Arrangement and selection problems

Summarised in our own words from the official 2025–2027 syllabus; each point is taught in the lessons above.