Permutations and combinations AA HL
Every counting question starts with one decision: does the order of the chosen objects matter? If it does, count permutations; if it does not, count combinations; and when a job is done in stages, multiply the number of choices at each stage. This page shows how to make that decision, how to handle objects that must stay together or must be kept apart, and how to set out the working so that each mark is earned. Permutations where some objects are identical, and circular arrangements, are not required in AA HL.
Formulas at a glance
The formulas for permutations and combinations are in the formula booklet. The multiplication principle, the factorial and the symmetry of the binomial coefficient are not listed there, so learn them: they are used in almost every counting question.
Arrangements of different objects in a row
Not in the bookletPermutations: ordered selections of from
In the bookletCombinations: unordered selections of from
In the bookletChoosing to include is choosing to leave out
Not in the bookletMultiplication principle: independent stages
ways for a stage with ways followed by a stage with ways
Not in the bookletWhich method to use
Read the question for the word that tells you whether order matters, then look at how the job splits into stages. Most harder questions are a short combination of the rows below.
| The question has | Use | Notes |
|---|---|---|
| All different objects arranged in a row | Every object is used, so there is no choosing, only ordering | |
| Some objects chosen and placed in order, such as officers, rankings or codes | Swapping two chosen objects gives a different outcome | |
| A group or a hand chosen, with no order | Swapping two chosen objects gives the same outcome | |
| A job done in independent stages | Multiply the number of ways for each stage | Several separate groups usually give a product of combinations |
| Two objects that must stay next to each other | Treat them as one block, arrange the units, then multiply by the arrangements inside the block | Forgetting the arrangements inside the block is the usual lost mark |
| Objects that must occupy fixed places, such as the two ends | Fill the restricted places first, then arrange the rest | Count the restricted places and the remaining places separately |
| "At least one" or "not together" | Total number of outcomes minus the unwanted outcomes | Count the unwanted outcomes, which is usually the simpler case |
Permutations and combinations
Counting principles find the number of ways to arrange or select objects. If order matters, count permutations, such as ways to arrange five distinct objects in a row. If order does not matter, count combinations, . The key step is deciding which case the question describes.
Does order matter?
Both formulas are in the formulas at the top of the page and in the formula booklet. Permutations where some objects are identical, and circular arrangements, are not required.
Order matters: permutations
Use when you are arranging or ordering objects chosen from different objects: queues, rankings, codes, or officers with different roles.
Order does not matter: combinations
Use when you are selecting a group of objects from with no regard to order: committees, teams, hands of cards.
Key terms
What does mean?
The factorial is the product of all positive integers from up to , and it counts the arrangements of distinct objects in a row. By definition .
e.g. .
What is a permutation?
A permutation is an ordered arrangement of objects chosen from distinct objects. Their number is .
e.g. Choosing and arranging people from can be done in ways.
What is a combination?
A combination is a selection of objects from distinct objects when the order does not matter. Their number is .
e.g. Choosing a group of from people gives .
What is the multiplication principle?
If one task can be done in ways and a second independent task in ways, the two together can be done in ways. It extends to any number of independent tasks.
e.g. With starters and main courses, there are possible meals.
Worked example, step by step
The question No calculator needed [6 marks]
A choir has 10 members: 6 sopranos and 4 altos.
(a) Three members are chosen to sing a trio. Find the number of different trios.
(b) Find the number of trios that contain at least one alto.
(c) Three different members are chosen to be the leader, the treasurer and the secretary of the choir. Find the number of ways of making these choices.
Worked solution: worked example
Answer: (a) (b) (c)
Step 1 - Decide whether order matters.
In (a) and (b) a trio is a group, and swapping two of its members gives the same trio, so order does not matter: use combinations. In (c) the three roles are different, so swapping two members gives a different outcome: use permutations.
Why? This decision comes before any formula. Ask whether swapping two chosen objects changes the outcome.
Step 2 - Count the trios.
Choose 3 from 10: M1 - Use with the formula or the products A1 -
Why? Cancel from the top and bottom before multiplying, so the numbers stay small enough to work without a calculator.
Step 3 - Choose the complement for "at least one".
A trio with no altos is a trio made only of sopranos. Counting the trios with at least one alto directly means adding the cases of 1, 2 and 3 altos, which is longer. It is quicker to take all the trios and remove the unwanted ones.
Why? "At least one" is the opposite of "none". When the opposite case is a single case, subtract it from the total.
Step 4 - Subtract the all-soprano trios.
The trios with only sopranos number , so M1 - Subtract the all-soprano trios, , from the total of trios A1 -
Why? The total of is the answer to (a), so no further counting of the whole choir is needed.
Step 5 - Count the officers.
The leader can be any of the 10 members, the treasurer any of the other 9 and the secretary any of the other 8: M1 - Use or the product A1 -
Why? Each role is filled in turn by someone not yet chosen, so the number of choices drops by one each time. This is the multiplication principle and it agrees with the permutation formula.
Step 6 - Check the relationship between the answers.
Each group of 3 members can fill the 3 roles in ways, so the answer to (c) should be times the answer to (a): . It is.
Why? The number of permutations of objects is always times the number of combinations, which gives a quick check that the two methods agree.
M1 Use with the formula or the products
A1
M1 Subtract the all-soprano trios, , from the total of trios
A1
M1 Use or the product
A1
Now you try: enter your answers to be marked
These are real practice questions. Type your answer in each box and press Mark it. The worked solution and mark scheme appear straight away, and your first attempt is the one that counts. Use the keyboard for powers, roots and trig, and the working box for your notes.
Worked solution: practice question 1
Find the number of ways of choosing the panel if it must contain at least 2 women.
Worked solution: practice question 2
Worked solution: practice question 3
Your score so far: 0 out of 12 marks
Calculator steps: Permutations and combinations (nPr, nCr)
Common mistakes
- Using when order actually matters. If the question is about arranging, ranking, or seating - where swapping two chosen items gives a genuinely different outcome - it's a permutation, not a combination. Read for the word "arrange" or "order" before picking a formula.
- Forgetting to arrange within a "glued" block. When two items must stay adjacent, gluing them together and counting the block as one object is only half the job - you still need to multiply by the number of ways to arrange the glued items inside the block.
- Double counting when items are fixed in place first. If some items are already fixed (e.g. two specific beads pinned to the two ends), count only the arrangements of the remaining items and multiply by the arrangements of the fixed items separately - don't include the fixed items again in a factorial that assumes they're still free to move.
Using your GDC
The exact key presses for the TI-84 Plus CE, Casio fx-CG50, Casio fx-CG100 and TI-Nspire CX, with what the screen shows. Pick your calculator.
Permutations and combinations (nPr, nCr)
Used in: Permutations and combinations
How to find nPr, nCr and a factorial on a TI-84 Plus CE
MATH, PRB menu | |
On the home screen type the first number, for example 1 2. Press math, then ▶ across to the PRB tab. |
|
For a combination (order does not matter) choose 3:nCr. It is pasted after the 12. Type the second number 3 and press enter. |
12 nCr 3 220 |
For a permutation (order matters) choose 2:nPr in the same menu: 1 2 math ▶ 2:nPr 3 enter. |
12 nPr 3 1320 |
For a factorial, type the number first, then choose 4:! from the PRB menu: 6 math ▶ 4:! enter. |
6! 720 |
The number comes first and the command after it: 12 nCr 3, not nCr(12,3). If you want brackets on the left of the command, put them round the whole first number.
The full guide: Permutations and combinations (nPr, nCr)
See the full list of GDC guides for every calculator task.
Syllabus content covered
| Code | Syllabus content |
|---|---|
| AHL1.10 | Counting principles, including permutations and combinations. Not required: Permutations where some objects are identical. Circular arrangements. |
Official IB source: Mathematics: analysis and approaches subject brief (PDF, ibo.org).
Quick questions
What is the difference between a permutation and a combination?
A permutation counts arrangements where order matters, while a combination counts selections where order doesn't matter - the same items chosen in a different order count as one combination but as several permutations.
How do I count arrangements where two items must stay together?
Glue the two items into a single block, arrange that block together with the remaining items as usual, then multiply by the number of ways to arrange the two items inside the block ( if it's just two of them).
How do I decide whether order matters?
Ask whether swapping two chosen items gives a different outcome. Choosing a president and a secretary from people gives outcomes, but choosing a committee of gives .
How do I count arrangements in which two items must not be together?
Take the total number of arrangements and subtract those in which the two items are together. For people in a row with A and B not adjacent, .
Why is equal to ?
Choosing objects to include is the same as choosing objects to leave out. For example, .
Ready to practise properly?
Practice questions on every section, marked instantly like the real exam.