Calculate combinations using , where is the total number of objects and is the number selected. Combinations apply when the order of selection does not matter.
How the formula works
The notation , also written as or (nCr), means “the number of ways to choose objects from objects.” The symbol (!) represents a , so , with .
The formula begins with all ordered arrangements of selected objects, then divides by (r!) because each chosen group can be ordered in (r!) equivalent ways. This explains why combinations ignore order rather than merely listing selections.
For example, to choose students from a group of :
Therefore, there are possible groups. Cancelling common factorials before multiplying makes the calculation faster and reduces arithmetic errors.
Before calculating, identify the decision being made and whether swapping two selected objects creates a new outcome. In choosing books from , swapping the order does not create a new set, so . If the same three books were awarded first, second and third prizes, the outcomes would be ordered and combinations alone would be incorrect.
The values must satisfy , with . A useful symmetry property is
For example, . On a GDC, enter , select the combinations or (nCr) command, and then enter .
In IB Mathematics: Analysis and Approaches SL 1.9, combinations appear as coefficients in the binomial theorem:
Exam technique
On Paper 1, show the factorial formula and simplification because calculators are not permitted. On Paper 2, a GDC may calculate (nCr), but show how the values of and arise.
For a Find question, include relevant stages of working; the command term requires an answer with the relevant method shown, not only a calculator result.
A common misconception is to use combinations when order matters. Choosing two committee members uses combinations, but assigning a president and vice-president does not, because the roles make the order significant.
