• Practice
  • About 20 min
  • 5 practice questions

Combinations: selections and their properties

Tell selections from arrangements, use ⁿCᵣ = n!/(r!(n − r)!) and its properties, and solve committee, at-least and geometry problems.

If something looks wrong, please tell us.

By the end of this lesson you can

  • Decide whether a problem asks for an arrangement (order matters) or a selection (order does not).
  • Use ⁿPᵣ = ⁿCᵣ × r! and ⁿCᵣ = n!/(r!(n − r)!).
  • Use the properties ⁿCᵣ = ⁿCₙ₋ᵣ, ⁿCᵣ + ⁿCᵣ₋₁ = ⁽ⁿ⁺¹⁾Cᵣ and ⁿCᵣ = (n/r) × ⁽ⁿ⁻¹⁾Cᵣ₋₁.
  • Solve committee problems with exactly, at least and at most conditions.
  • Count lines, diagonals, triangles and parallelograms formed by points and lines.

Choosing a team of 3 from 5 players is different from arranging 3 of them in a row: in a team, the order of choosing does not matter. Such a selection is a combination. This lesson finds a formula for combinations from the one for permutations.

From permutations to combinations

Take four people P, Q, R, S and choose 3 for a committee. The possible committees are PQR, PQS, PRS and QRS: 4 combinations. Each committee of 3 can be arranged in a row in 3! = 6 ways, and that gives every arrangement of 3 from 4 exactly once: 4 × 6 = 24 = ⁴P₃. In general ⁿPᵣ = ⁿCᵣ × r!, where ⁿCᵣ is the number of combinations of n distinct objects taken r at a time. Therefore

ⁿCᵣ = ⁿPᵣ / r! = n!/(r!(n − r)!) = n(n − 1)...(n − r + 1)/r!, for 0 ≤ r ≤ n.

— Number of combinations
Arrangement or selection?
SituationOrder matters: ⁿPᵣOrder does not matter: ⁿCᵣ
CricketBatting order of 11 from 15Team of 11 from 15
Prizes3 different prizes to 3 of 10 students3 identical prizes to 3 of 10 students
CommitteePresident and Secretary from 12 members2 members from 12
Choosing3 objects one after another, in order3 objects together, at once

Properties of ⁿCᵣ

  1. ⁿC₀ = 1 and ⁿCₙ = 1 (choose nothing, or everything).
  2. ⁿCᵣ = ⁿCₙ₋ᵣ: choosing r objects to take is the same as choosing n − r objects to leave. So ²⁰C₁₈ = ²⁰C₂ = 190.
  3. If ⁿCₓ = ⁿCᵧ, then x = y or x + y = n.
  4. Pascal's rule: ⁿCᵣ + ⁿCᵣ₋₁ = ⁽ⁿ⁺¹⁾Cᵣ.
  5. ⁿCᵣ = (n/r) × ⁽ⁿ⁻¹⁾Cᵣ₋₁, which lets you work a combination down step by step.

Why Pascal's rule holds (a counting proof). Pick one particular object X from n + 1 objects. A selection of r objects either leaves X out, and then all r come from the other n (ⁿCᵣ ways), or includes X, and then the other r − 1 come from the n (ⁿCᵣ₋₁ ways). Adding gives ⁽ⁿ⁺¹⁾Cᵣ. Check: ⁹C₃ + ⁹C₄ = 84 + 126 = 210 = ¹⁰C₄.

Worked example 1: evaluating and solving

(i) ¹²C₃ = (12 × 11 × 10)/(3 × 2 × 1) = 1320/6 = 220. (ii) If ⁿC₂ = 45, then n(n − 1)/2 = 45, so n(n − 1) = 90 = 10 × 9 and n = 10. (iii) If ⁿC₈ = ⁿC₆, then 8 ≠ 6 so 8 + 6 = n, n = 14, and ¹⁴C₂ = (14 × 13)/2 = 91. (iv) If ⁿPᵣ = 336 and ⁿCᵣ = 56, then r! = 336/56 = 6 = 3!, so r = 3; and n(n − 1)(n − 2) = 336 = 8 × 7 × 6, so n = 8, r = 3.

Committees: exactly, at least, at most

Selections from two groups are made group by group and multiplied. At least and at most conditions are split into the cases allowed and added, or found as total minus the cases not allowed.

Worked example 2: a committee of 5 from 6 men and 4 women

(i) Exactly 2 women: choose 2 of 4 women and 3 of 6 men: ⁴C₂ × ⁶C₃ = 6 × 20 = 120. (ii) At least 2 women: 2 women: 120; 3 women: ⁴C₃ × ⁶C₂ = 4 × 15 = 60; 4 women: ⁴C₄ × ⁶C₁ = 1 × 6 = 6. Total 120 + 60 + 6 = 186. Check by the complement: all committees ¹⁰C₅ = 252; with no woman ⁶C₅ = 6; with one woman ⁴C₁ × ⁶C₄ = 4 × 15 = 60; and 252 − 6 − 60 = 186.

Worked example 3: particular objects in or out

From 10 different books, 4 are chosen. (i) If one particular book must be included, choose the other 3 from the remaining 9: ⁹C₃ = 84. (ii) If it must be excluded, choose all 4 from the other 9: ⁹C₄ = 126. Check: 84 + 126 = 210 = ¹⁰C₄, as Pascal's rule says.

Solving a selection problem

  1. Does order matter? Yes: permutation. No: combination.
  2. Split into groups Men and women, Part A and Part B, vowels and consonants.
  3. List the allowed cases For at least / at most, write each case or use total minus excluded cases.
  4. Multiply within a case, add across cases Product rule inside, sum rule between.
  5. Arrange if asked Multiply by r! (or the right arrangement count) only when the selection is then put in order.

Combinations in geometry

Two points fix a line and three non-collinear points fix a triangle, so geometric counts are combinations. (i) Diagonals. Joining any two of the n vertices of a polygon gives ⁿC₂ segments; n of them are sides, so there are n(n − 1)/2 − n = n(n − 3)/2 diagonals. An octagon has 8 × 5/2 = 20. (ii) Points with some collinear. 12 points, of which exactly 5 lie on one line and no other three are collinear: lines = ¹²C₂ − ⁵C₂ + 1 = 66 − 10 + 1 = 57 (the 5 collinear points give one line, not 10); triangles = ¹²C₃ − ⁵C₃ = 220 − 10 = 210 (three collinear points make no triangle). (iii) Parallelograms. A set of 5 parallel lines crossing a set of 4 parallel lines: any 2 from each set enclose a parallelogram, so there are ⁵C₂ × ⁴C₂ = 10 × 6 = 60.

Select, then arrange

Worked example 4. From 5 vowels and 6 consonants, how many 5-letter strings with 2 different vowels and 3 different consonants can be made? Select: ⁵C₂ × ⁶C₃ = 10 × 20 = 200 sets of letters. Arrange each set of 5 letters: 5! = 120. Answer: 200 × 120 = 24000.

Worked example 5: selections from a word with repeated letters. How many 3-letter strings can be made from the letters of BANANA (B once, A three times, N twice)? Split by the pattern of letters. All different (B, A, N): 1 selection, 3! = 6 strings. Two alike and one different: the pair is AA or NN (2 ways) and the other letter is one of the 2 remaining letters, giving 4 selections, each arranged in 3!/2! = 3 ways: 12 strings. All alike: only AAA, 1 string. Total 6 + 12 + 1 = 19.

Finally, a set with n elements has ⁿC₀ + ⁿC₁ + ... + ⁿCₙ = 2ⁿ subsets, because each element is either in or out of a subset: 2 choices for each of n elements.

Key takeaways: a combination is a selection, ⁿCᵣ = n!/(r!(n − r)!), and ⁿPᵣ = ⁿCᵣ × r!. Use ⁿCᵣ = ⁿCₙ₋ᵣ to shorten work and Pascal's rule to combine terms. For at least or at most, list the cases or subtract the forbidden ones. In geometry, collinear points reduce both the line count and the triangle count.

Check your understanding

  1. 1. What is the value of ¹⁵C₁₃?

    1. 210
    2. 105
    3. 15
    4. 2730
    Show answer

    Answer: B. ¹⁵C₁₃ = ¹⁵C₂ = (15 × 14)/2 = 105. 210 is ¹⁵P₂, which counts order.

  2. 2. If ⁿC₇ = ⁿC₅, what is n?

    1. 2
    2. 35
    3. 12
    4. 7
    Show answer

    Answer: C. Since 7 ≠ 5, the property ⁿCₓ = ⁿCᵧ ⇒ x = y or x + y = n gives n = 7 + 5 = 12.

  3. 3. How many diagonals does a decagon (10 sides) have?

    1. 45
    2. 10
    3. 90
    4. 35
    Show answer

    Answer: D. Diagonals = n(n − 3)/2 = 10 × 7/2 = 35. 45 = ¹⁰C₂ counts the sides too; subtracting the 10 sides gives 35.

  4. 4. A group of 3 is chosen from 5 boys and 4 girls. In how many ways can it include at least one girl?

    1. 74
    2. 84
    3. 40
    4. 64
    Show answer

    Answer: A. All groups: ⁹C₃ = 84. Groups with no girl: ⁵C₃ = 10. At least one girl: 84 − 10 = 74.

  5. 5. Which of these equals ⁸C₃ + ⁸C₄?

    1. ¹⁶C₇
    2. ⁹C₄ = 126
    3. ⁸C₇ = 8
    4. ⁹C₃ = 84
    Show answer

    Answer: B. By Pascal's rule ⁿCᵣ + ⁿCᵣ₋₁ = ⁽ⁿ⁺¹⁾Cᵣ with n = 8, r = 4: ⁸C₄ + ⁸C₃ = ⁹C₄ = 126. Check: 70 + 56 = 126.

Privacy · Terms · Refunds · Delivery