Lesson 6: Combinations: choosing without order

Working backwards from the number of handshakes

SkillsCombinationsFactorial notation

Worked example

  • Complex familiar
  • Technology free

At a meeting, every person shakes hands with every other person exactly once. There are 66 handshakes. How many people are at the meeting?

1 of 4 steps
  1. Step 1: Model a handshake as a selection

    A handshake is a pair of people, and the pair Ali and Bo is the same handshake as Bo and Ali. With nn people there are (n2)\binom{n}{2} handshakes.

Try a similar one

A fresh question of the same kind, checked as you answer, with hints and a full solution.

Method

  1. Decide whether the count is a permutation or a combination, and write it in terms of nn.

  2. Simplify the factorials to a polynomial.

  3. Solve, and keep only positive integer solutions.

Watch out for

  • Writing (n2)=n(n−1)\binom{n}{2} = n(n-1), which forgets to divide by 2 and counts ordered pairs.

  • Leaving n=−11n = -11 in the answer.

Save your progress with a free account