← AS & A Level Mathematics

AS & A Level Mathematics · Probability & Statistics 1 · Chapter 5

Permutations and combinations

🎯 Learning objectives

  • Understand and apply the fundamental counting principle (product rule of counting) across independent stages.
  • Define, evaluate, and simplify factorial expressions n! for positive integers and understand why 0! = 1.
  • Manipulate algebraic expressions involving factorials such as and solve factorial equations.

Book exercises: Exercise 5A, End-of-chapter review exercise 5, and Cross-topic review exercise 2.

1. The fundamental counting principle (multiplication rule)

  • Multiplication rule: If a first task can be performed in p ways, and for each of these a second task can be performed in q ways, the combined task can be done in p × q ways.
  • Generalization to k stages: If successive stages offer n₁, n₂, …, nₖ choices, the total number of distinct outcomes is:

    Total outcomes = n₁ × n₂ × n₃ × … × nₖ

  • With vs without repetition: If choices are reused (e.g. repeated digits), the number of choices stays constant; if choices cannot be reused, each step decreases by 1.
1. Stage 1 Choicesn₁ possible options2. Stage 2 Choicesn₂ options per 1st3. Stage 3 Choicesn₃ options per 2nd4. Total OutcomesProduct: n₁ × n₂ × n₃
The fundamental principle of counting: each subsequent decision multiplies the number of branches.

2. The factorial function n!

  • Definition: For any positive integer n, "n factorial" (written n!) is the product of all positive integers from n down to 1:

    n! = n × (n − 1) × (n − 2) × … × 3 × 2 × 1

  • Recursive relationship: Every factorial contains the factorial of the predecessor:

    n! = n × (n − 1)!

  • Why 0! = 1: Dividing successive factorials shows why 0! must equal 1:

    (n − 1)! =  ⇒  0! = = 1

5! = 120 start ÷5 4! = 24 120 ÷ 5 ÷4 3! = 6 24 ÷ 4 ÷3 2! = 2 6 ÷ 3 ÷2 1! = 1 2 ÷ 2 ÷1 0! = 1 1 ÷ 1 Continuous pattern of dividing by n proves that 0! must equal 1.
The division cascade: moving right divides by the index, establishing 0! = 1 without contradiction.

3. Algebraic simplification of factorials

  • Factorial cancellations: Expand the larger factorial down to the smaller factorial and cancel common factors:

    = n  and  = n(n − 1) = n² − n

  • Fraction reduction: Never expand huge factorials completely; factor out common terms:

    = 10 × 9 = 90  and  − = (20 × 19) − (13 × 12) = 380 − 156 = 224

💡 Worked Example 5.1: Non-calculator factorial arithmetic

Evaluate the exact value of + without using a calculator.

  1. Expand 10! down to 8!: 10! = 10 × 9 × 8!. Therefore = 10 × 9 = 90.
  2. Expand 9! down to 7!: 9! = 9 × 8 × 7!. Therefore = 9 × 8 = 72.
  3. Add the two evaluated products: 90 + 72 = 162.

💡 Worked Example 5.2: Solving an algebraic factorial equation

Find the integer value of n such that = 420.

  1. Rewrite the numerator in terms of n!: (n + 2)! = (n + 2)(n + 1)n!.
  2. Cancel the common n! term from numerator and denominator: (n + 2)(n + 1) = 420.
  3. Recognize 420 as the product of two consecutive positive integers: √420 ≈ 20.49 ⇒ 21 × 20 = 420.
  4. Equate the larger factor: n + 2 = 21 ⇒ n = 21 − 2 = 19.
  5. Check: = 21 × 20 = 420. The solution is confirmed.

✏️ Try it: Factorial fundamentals

  1. Find the exact value of − (3! × 4!).
    View answer

    Step 1: = 7 × 6 × 5 = 210.

    Step 2: 3! × 4! = 6 × 24 = 144.

    Step 3: 210 − 144 = 66.

  2. Find the smallest integer n such that n! > 5000.
    View answer

    Step 1: Evaluate small factorials: 6! = 720.

    Step 2: 7! = 7 × 720 = 5040.

    Step 3: Since 5040 > 5000 and 720 ≤ 5000, n = 7.

  3. Express the quotient in expanded polynomial form.
    View answer

    Step 1: Expand n! down to (n − 3)!: n(n − 1)(n − 2)(n − 3)!.

    Step 2: Cancel (n − 3)! to get n(n − 1)(n − 2).

    Step 3: Expand: n(n² − 3n + 2) = n³ − 3n² + 2n.

Continue to Tab 2: Permutations & Repetitions →

🎯 Learning objectives

  • Calculate the number of permutations of n distinct objects in a line: n! arrangements.
  • Calculate the number of arrangements of r objects taken from n distinct objects: ⁿPᵣ = .
  • Calculate permutations of n objects containing repeated identical elements: .

Book exercises: Exercise 5B, Exercise 5C, and Exercise 5E.

1. Permutations of n distinct objects

  • Permutation definition: An arrangement of objects where the order of arrangement matters.
  • Arranging all n distinct objects: The 1st position has n choices, 2nd has (n − 1) choices, continuing down to 1:

    Total arrangements = n × (n − 1) × … × 1 = n!

  • Selecting and arranging r objects from n distinct objects (ⁿPᵣ):

    ⁿPᵣ = n × (n − 1) × … × (n − r + 1) =

  • Special values: ⁿPₙ = n! and ⁿP₁ = n and ⁿP₀ = 1.
Slot 1 n choices Slot 2 (n − 1) choices Slot 3 (n − 2) choices Slot r (n − r + 1) choices × × × Product of r successive decreasing factors = n! / (n − r)!
Slot-filling model for ⁿPᵣ: each chosen item cannot be picked again for the next slot.

2. Permutations with repetitions (identical objects)

  • The overcounting problem: When some objects are indistinguishable, swapping identical items among themselves creates identical arrangements.
  • Adjustment by division: If there are p identical items of one type, they can be permuted in p! ways without changing the visible arrangement. We divide the unconstrained n! by p!.
  • General repetition formula: For n objects where p are of type 1, q are of type 2, r are of type 3, … where p + q + r + … = n:

    Number of distinct arrangements =

Word: MISSISSIPPI (11 letters) • 1 × M • 4 × I   (4! redundant swaps) • 4 × S   (4! redundant swaps) • 2 × P   (2! redundant swaps) Quotient Formula 11! / (4! × 4! × 2!) = 39 916 800 / 1152 = 34 650 ways
Partitioning repeated letters: divide by the product of factorials for each repeated set.

💡 Worked Example 5.3: Arrangements of OUAGADOUGOU

Find the number of distinct arrangements of all 11 letters in the word OUAGADOUGOU.

  1. Count the total number of letters: n = 11 letters.
  2. Tally each letter's frequency:
    • O: 3 occurrences ⇒ 3!
    • U: 3 occurrences ⇒ 3!
    • A: 2 occurrences ⇒ 2!
    • G: 2 occurrences ⇒ 2!
    • D: 1 occurrence ⇒ 1!
  3. Apply the repetition formula: Total = .
  4. Calculate numerator and denominator: 11! = 39 916 800; denominator = 6 × 6 × 2 × 2 × 1 = 144.
  5. Divide: = 277 200 distinct arrangements.

✏️ Try it: Permutations and repetitions

  1. In how many ways can 5 runners in an 8-runner race finish in positions 1 to 5?
    View answer

    Step 1: Identify as a permutation of 5 from 8: ⁸P₅.

    Step 2: Calculate: 8 × 7 × 6 × 5 × 4 = 6720 ways.

  2. Find the number of distinct arrangements of all the letters in the word COMMITTEE.
    View answer

    Step 1: Total letters n = 9. Frequencies: C:1, O:1, M:2, I:1, T:2, E:2.

    Step 2: Formula = = .

    Step 3: Answer = 45 360 arrangements.

  3. How many 6-digit numbers can be formed using the digits 2, 2, 2, 7, 7, 7?
    View answer

    Step 1: Total digits = 6 (three 2s and three 7s).

    Step 2: Formula = = .

    Step 3: Answer = 20 six-digit numbers.

Continue to Tab 3: Blocks & Slotting Methods →

🎯 Learning objectives

  • Solve linear arrangement problems subject to specific position restrictions (e.g. fixed endpoints, odd/even digits).
  • Master the Block Method (Tie-together) for items that must stand together.
  • Master the Slotting Method (Gap Method) for items that must be separated (no two adjacent).
  • Distinguish between "not all together" (complementary rule) and "completely separated" (slotting rule).

Book exercises: Exercise 5D and Exercise 5E.

1. Strategy decision guide for restrictions

Step 1: Identify all restrictionsCheck fixed endpoints, items required together, or items that must be separatedStep 2: Restricted items TOGETHER? Use Block MethodTie the k items into 1 single unit; total units = (n − k + 1)!; multiply by k! internal ordersStep 3: Restricted items SEPARATED? Use Slotting MethodArrange (n − k) unrestricted items first in (n − k)! ways; insert k items into available gapsStep 4: Endpoint / Fixed digits constraints?Fill restricted slots first, then arrange remaining unconstrained positions in remaining spacesStep 5: Multiply independent stages for final countVerify no overlap between mutually exclusive cases; add disjoint case totals
Decision roadmap: matching the mathematical method to the wording of the arrangement restriction.

2. The Block Method (items must be together)

  • Concept: If k particular items must stand together, tie them into a single "super-item" (block).
  • Step 1: Count total arranging units: The block counts as 1 unit. If there are (n − k) other items, there are (n − k + 1) units to arrange in (n − k + 1)! ways.
  • Step 2: Internal block permutations: The k items inside the block can be arranged among themselves in k! ways.
  • Total formula:

    Total arrangements = (n − k + 1)! × k!

W₁ W₂ W₃ Super-Item Block (2! ways) M₁ M₂ ⇒ 4 units: 4! Total = 4! × 2! = 48
The Block Method: 2 mangoes bundled into 1 unit with 3 watermelons → 4 units in 4! ways × 2! inside.

3. The Slotting Method (items must be separated)

  • Concept: If k particular items must be separated (no two adjacent), arrange the unrestricted items first to act as barriers.
  • Step 1: Arrange unrestricted items: Arrange the m = (n − k) unrestricted items in m! ways.
  • Step 2: Count available slots (gaps): Placing m items in a row creates (m + 1) spaces (one at each end and one between each adjacent pair).
  • Step 3: Place separated items into slots: Choose and arrange k slots from the (m + 1) available spaces in ᵐ⁺¹Pₖ ways.
  • Total formula:

    Total arrangements = m! × ᵐ⁺¹Pₖ  (where m = n − k)

  • Feasibility test: It is impossible to separate the k items if k > m + 1.
B₁ B₂ B₃ B₄ Slot 1 Slot 2 Slot 3 Slot 4 Slot 5 4 boys in 4! = 24 ways • 3 girls placed into 3 of 5 slots in ⁵P₃ = 60 ways • Total = 1440
The Slotting Method: 4 boys create 5 gap slots; placing girls into distinct slots guarantees separation.

🧪 Interactive Simulation: Permutations & Restriction Workbench

Explore how arrangement restrictions change total outcomes dynamically. Select items and observe the block and slotting models live with step-by-step mathematical working.

Live Calculation Working

    💡 Worked Example 5.4: Digits with multiple restrictions

    How many odd four-digit numbers greater than 3000 can be made from the digits 1, 2, 3, 4, used at most once?

    1. Identify the restriction positions: thousands column (must be ≥ 3, so 3 or 4) and units column (must be odd, so 1 or 3).
    2. Note that the digit 3 appears in both restriction sets. Partition into two mutually exclusive cases:
      • Case 1: Thousands digit is 3.
        • Thousands digit: 1 choice (must be 3).
        • Units digit: 1 choice (must be 1, since 3 is used).
        • Middle two digits: ²P₂ = 2 choices for tens and units.
        • Arrangements = 1 × 2 × 1 = 2 numbers (3241, 3421).
      • Case 2: Thousands digit is 4.
        • Thousands digit: 1 choice (must be 4).
        • Units digit: 2 choices (1 or 3).
        • Middle two digits: ²P₂ = 2 choices.
        • Arrangements = 1 × 2 × 2 = 4 numbers (4123, 4213, 4231, 4321).
    3. Sum the disjoint cases: 2 + 4 = 6 numbers.

    ✏️ Try it: Restrictions in permutations

    1. In how many ways can 4 boys and 3 girls sit on a bench if the 3 girls must sit together?
      View answer

      Step 1: Treat 3 girls as 1 block: total units = 4 boys + 1 block = 5 units.

      Step 2: Arrange 5 units in 5! = 120 ways.

      Step 3: Arrange 3 girls internally in 3! = 6 ways.

      Step 4: Total = 120 × 6 = 720 ways.

    2. In how many ways can 5 men and 2 women stand in a line if the 2 women must be separated?
      View answer

      Step 1: Arrange 5 men first in 5! = 120 ways, creating 6 slots.

      Step 2: Place 2 women into 2 of 6 slots in ⁶P₂ = 6 × 5 = 30 ways.

      Step 3: Total = 120 × 30 = 3600 ways.

    3. In how many ways can 6 books be placed on a shelf if 2 specific books must NOT both be at the ends?
      View answer

      Step 1: Total unconstrained arrangements = 6! = 720.

      Step 2: Arrangements where both specific books are at the ends = 2! (for the ends) × 4! (middle 4) = 2 × 24 = 48.

      Step 3: Complement = 720 − 48 = 672 ways.

    Continue to Tab 4: Combinations & Selections →

    🎯 Learning objectives

    • Define a combination as an unordered selection: order does not matter.
    • Evaluate ⁿCᵣ = and apply the symmetry property ⁿCᵣ = ⁿCₙ₋ᵣ.
    • Solve multi-category selection problems (committees, teams, card hands) involving "at least" and "at most" conditions.

    Book exercises: Exercise 5F and End-of-chapter review exercise 5.

    1. Combinations vs Permutations

    • Combinations: Selections where the order of choosing does not matter (e.g. selecting strawberries and cream is the same combination as selecting cream and strawberries).
    • Link to permutations: Each combination of r items can be arranged in r! different ways. Thus:

      Number of permutations = (Number of combinations) × r!  ⇒  ⁿPᵣ = ⁿCᵣ × r!

    • Combinations formula:

      ⁿCᵣ = =

    • The symmetry property: Choosing r objects from n to include is identical to choosing (n − r) objects to exclude:

      ⁿCᵣ = ⁿCₙ₋ᵣ  (for example, ⁵C₃ = ⁵C₂ = 10)

    Permutations: Order Matters • AB ≠ BA (different orders) • AC ≠ CA, BC ≠ CB ⇒ 6 permutations of 2 from {A, B, C} ÷2! Combinations: Order Ignored • {A, B} is 1 selection • {A, C} and {B, C} ⇒ 3 combinations of 2 from {A, B, C}
    Permutation vs Combination: each combination corresponds to r! distinct permutations.

    2. Committee selections and case tables

    • Independent multi-category selections: When choosing from separate distinct groups (e.g. men and women, books and magazines), multiply the independent combinations:

      Total ways = ⁿᴬCᵣᴬ × ⁿᴮCᵣᴮ

    • "At least" / "More than" conditions: Set up a structured case table for all mutually exclusive scenarios, calculate each case by multiplying category combinations, and add the case totals.
    Case 1: 3 Women, 2 Men ⁶C₃ × ⁵C₂ = 20 × 10 = 200 ways + Case 2: 4 Women, 1 Man ⁶C₄ × ⁵C₁ = 15 × 5 = 75 ways + Case 3: 5 Women, 0 Men ⁶C₅ × ⁵C₀ = 6 × 1 = 6 ways Total teams with more women than men: 200 + 75 + 6 = 281 ways
    Partitioning into mutually exclusive cases: evaluate each branch and sum the disjoint totals.

    ⚙️ Interactive Tool: Permutations & Combinations Solver

    Compute permutations (ⁿPᵣ), combinations (ⁿCᵣ), or multi-group selections with complete step-by-step numbered working.

    Numbered Working & Solution

    1. Step 1: Formula definition: ⁿCᵣ = n! / [r!(n − r)!].
    2. Step 2: Substitute values: ⁷C₃ = 7! / [3!(7 − 3)!] = 7! / (3! × 4!).
    3. Step 3: Expand numerator down to 4!: (7 × 6 × 5 × 4!) / [(3 × 2 × 1) × 4!].
    4. Step 4: Cancel 4! and divide by 6: (7 × 6 × 5) / 6 = 210 / 6 = 35.
    5. Step 5: Symmetry check: ⁷C₄ = ⁷C₃ = 35.

    💡 Worked Example 5.5: Team selection with majority rule

    A team of 5 is to be chosen from 6 women and 5 men. Find the number of possible teams in which there will be more women than men.

    1. Identify the possible team compositions that satisfy "more women than men" (total = 5):
      • 3 women and 2 men
      • 4 women and 1 man
      • 5 women and 0 men
    2. Calculate combinations for each mutually exclusive case:
      • Case 1: ⁶C₃ × ⁵C₂ = 20 × 10 = 200 ways.
      • Case 2: ⁶C₄ × ⁵C₁ = 15 × 5 = 75 ways.
      • Case 3: ⁶C₅ × ⁵C₀ = 6 × 1 = 6 ways.
    3. Sum the disjoint case counts: 200 + 75 + 6 = 281 teams.

    ✏️ Try it: Combinations

    1. In how many ways can a committee of 4 be chosen from 9 people?
      View answer

      Step 1: Formula: ⁹C₄ = .

      Step 2: Calculate: = .

      Step 3: Answer = 126 ways.

    2. From 7 men and 8 women, in how many ways can 3 men and 4 women be selected?
      View answer

      Step 1: ⁷C₃ = 35 ways to select men.

      Step 2: ⁸C₄ = 70 ways to select women.

      Step 3: Multiply independent choices: 35 × 70 = 2450 ways.

    3. If ⁿC₃ = ⁿC₅, find the value of n and the value of ⁿC₂.
      View answer

      Step 1: By symmetry, n = 3 + 5 = 8.

      Step 2: ⁸C₂ = = 28.

    Continue to Tab 5: Combinatorial Probability →

    🎯 Learning objectives

    • Evaluate classical probabilities using permutations and combinations.
    • Solve sampling problems without replacement by treating outcomes as equally likely unordered combinations: P(A) = .
    • Solve arrangement probabilities where linear order conditions dictate favourable versus total permutations.

    Book exercises: Exercise 5G and Cross-topic review exercise 2.

    1. The combinatorial probability principle

    • Equally likely selections: When sampling items simultaneously without replacement, every possible combination of size r from n is equally likely.
    • The counting probability formula:

      P(Event E) = =

    • Golden consistency rule: If the denominator counts unordered combinations (ⁿCᵣ), the numerator MUST count unordered combinations. If the denominator counts ordered permutations (ⁿPᵣ or n!), the numerator MUST count ordered permutations. Never mix ordered and unordered in the same probability fraction!
    Numerator: Favourable Cases Selections with desired structure e.g. ⁶C₂ × ⁴C₁ = 15 × 4 = 60 / Denominator: Total Sample Space All possible unconstrained choices e.g. ¹⁰C₃ = 120
    Classical probability with combinations: P(E) = favourable choices / total choices = 60 / 120 = ½.

    💡 Worked Example 5.6: Probability of fruit selection without replacement

    A crate contains 17 yellow bananas and 23 green bananas (total 40). Four bananas are randomly selected. Find the probability that:

    1. No green bananas are selected.
    2. Less than half of those selected are green.
    1. Find the total number of unconstrained selections: ⁴⁰C₄ = 91 390.
    2. Part a: "No green bananas" means all 4 must be chosen from the 17 yellow bananas:

      Favourable selections = ¹⁷C₄ × ²³C₀ = 2380 × 1 = 2380.

    3. Compute P(no green) = = ≈ 0.0260 (3 s.f.).
    4. Part b: "Less than half are green" out of 4 selected means 0 green or 1 green (mutually exclusive):
      • 0 green (4 yellow): ¹⁷C₄ = 2380.
      • 1 green (3 yellow): ¹⁷C₃ × ²³C₁ = 680 × 23 = 15 640.
    5. Sum favourable outcomes: 2380 + 15 640 = 18 020.
    6. Compute probability: P(< half green) = = ≈ 0.197 (3 s.f.).

    💡 Worked Example 5.7: Probability of separated items in linear arrangement

    All 6 letters of the word VECTOR are arranged at random in a row. Find the probability that the two vowels (E, O) are separated.

    1. Total number of unconstrained permutations of 6 distinct letters: 6! = 720.
    2. Use the complementary method: count arrangements where vowels are together.
    3. Treat {E, O} as 1 block: 4 consonants + 1 block = 5 units arranged in 5! = 120 ways.
    4. Vowels inside the block can be ordered in 2! = 2 ways. Favourable (together) = 120 × 2 = 240.
    5. P(vowels together) = = .
    6. P(vowels separated) = 1 − P(vowels together) = 1 − = = ⅔ (or 0.667).

    ✏️ Try it: Combinatorial probability

    1. Two children are selected at random from 6 boys and 4 girls. Find the probability of choosing one boy and one girl.
      View answer

      Step 1: Total selections: ¹⁰C₂ = 45.

      Step 2: Favourable selections: ⁶C₁ × ⁴C₁ = 6 × 4 = 24.

      Step 3: Probability = 24 / 45 = 8/15 ≈ 0.533.

    2. Three letters are chosen at random from the 7 distinct letters of CHAPTER. Find the probability that all 3 are consonants.
      View answer

      Step 1: Total letters = 7 (5 consonants: C, H, P, T, R; 2 vowels: A, E).

      Step 2: Total selections = ⁷C₃ = 35.

      Step 3: Favourable selections = ⁵C₃ = 10.

      Step 4: Probability = 10 / 35 = 2/7 ≈ 0.286.

    3. Four cards are dealt from a standard 52-card pack. What is the probability that all 4 are Aces?
      View answer

      Step 1: Total selections = ⁵²C₄ = 270 725.

      Step 2: Favourable selections = ⁴C₄ = 1.

      Step 3: Probability = 1 / 270 725 ≈ 3.69 × 10⁻⁶.

    Continue to Tab 6: Summary & Chapter Quiz →

    📌 Key Chapter Formulas & Summary

    • Multiplication Principle: Total outcomes across independent stages = n₁ × n₂ × … × nₖ.
    • Factorial: n! = n(n − 1)…(2)(1), with 0! = 1.
    • Permutations of distinct objects (Order Matters):
      • Arranging all n items: n!
      • Arranging r items from n: ⁿPᵣ =
    • Permutations with repeated objects:
    • Block Method (items together): Group k items as 1 block ⇒ (n − k + 1)! × k!.
    • Slotting Method (items separated): Arrange m unrestricted items in m! ways; place k separated items into (m + 1) slots in ᵐ⁺¹Pₖ ways.
    • Combinations (Order Does NOT Matter): ⁿCᵣ = with ⁿCᵣ = ⁿCₙ₋ᵣ.
    • Combinatorial Probability: P(E) = (ensure both numerator and denominator use the same counting basis!).

    ⚠️ Cambridge 9709 Exam Pitfall Checklist

    • Permutation vs Combination: Ask yourself first: "Does swapping two chosen members create a genuinely different outcome?" If yes → Permutations (ⁿPᵣ); if no → Combinations (ⁿCᵣ).
    • Internal block order: When using the Block Method, students often forget to multiply by k! (the internal permutations of the bundled items).
    • "Not all together" ≠ "Completely separated":
      • "Not all together" = Total arrangements − (All items together in one block).
      • "No two together" / "Separated" = Must use the Slotting Method (gap method).
    • Shared restriction digits: If a digit or object belongs to both restricted positions (e.g. 3 is odd AND ≥ 3), you must split into separate mutually exclusive cases.
    • Identical objects in selection: When selecting letters or items from a word with repeats, you cannot use simple ⁿCᵣ. You must break into cases based on the number of identical items chosen.

    📄 Printable Chapter Assignment

    Download the complete chapter assignment worksheet with all book exercises (5A through 5G), End-of-chapter review exercise 5, and Cross-topic review exercise 2 word-for-word, complete with answer lines and marking schemes.

    📥 Download Assignment PDF (45 Pages • 129 Questions)

    Interactive Chapter Quiz

    1. What is the exact value of 8! / (5! × 3!)?
    2. In how many ways can 7 runners finish in 1st, 2nd, and 3rd place?
    3. How many distinct arrangements can be made using all the letters in PARALLEL?
    4. Five boys and 2 girls stand in a line. How many arrangements have the 2 girls standing together?
    5. Five novels and 3 plays are on a shelf. How many arrangements have no two plays adjacent?
    6. A committee of 3 men and 2 women is chosen from 6 men and 5 women. How many committees are possible?
    7. A team of 4 is chosen from 5 adults and 4 children. How many teams contain at least one child?
    8. If ⁿC₄ = ⁿC₇ for a positive integer n, what is the value of n?
    9. Four counters are chosen at random from 6 red and 4 blue. What is the probability that all 4 are red?
    10. All 6 letters of VECTOR are arranged at random in a row. What is the probability the vowels are separated?
    11. Four different digits from {2, 3, 5, 7, 8} form a number > 5000 that is even. How many numbers can be made?
    12. In how many ways can 8 people be split into two groups of 4 to play a doubles tennis match without set courts?

    Questions adapted from Cambridge International AS & A Level Mathematics: Probability & Statistics 1 Coursebook by Dean Chalmers, Cambridge University Press. Additional worked solutions, interactive simulations, and assessment items are original content for gurujazzy.com.