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 nn different objects in a row

n!=n(n−1)(n−2)⋯2×1n!=n(n-1)(n-2)\cdots2\times1

Not in the booklet

Permutations: ordered selections of rr from nn

nPr=n!(n−r)!{}^nP_r=\dfrac{n!}{(n-r)!}

In the booklet

Combinations: unordered selections of rr from nn

(nr)=nCr=n!r!(n−r)!\dbinom{n}{r}={}^nC_r=\dfrac{n!}{r!(n-r)!}

In the booklet

Choosing rr to include is choosing n−rn-r to leave out

(nr)=(nn−r)\dbinom{n}{r}=\dbinom{n}{n-r}

Not in the booklet

Multiplication principle: independent stages

m×nm\times n ways for a stage with mm ways followed by a stage with nn ways

Not in the booklet

Which 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 hasUseNotes
All nn different objects arranged in a rown!n!Every object is used, so there is no choosing, only ordering
Some objects chosen and placed in order, such as officers, rankings or codesnPr=n!(n−r)!{}^nP_r=\dfrac{n!}{(n-r)!}Swapping two chosen objects gives a different outcome
A group or a hand chosen, with no order(nr)\dbinom{n}{r}Swapping two chosen objects gives the same outcome
A job done in independent stagesMultiply the number of ways for each stageSeveral separate groups usually give a product of combinations
Two objects that must stay next to each otherTreat them as one block, arrange the units, then multiply by the arrangements inside the blockForgetting the arrangements inside the block is the usual lost mark
Objects that must occupy fixed places, such as the two endsFill the restricted places first, then arrange the restCount the restricted places and the remaining places separately
"At least one" or "not together"Total number of outcomes minus the unwanted outcomesCount the unwanted outcomes, which is usually the simpler case

AHL1.10

Permutations and combinations

Counting principles find the number of ways to arrange or select objects. If order matters, count permutations, such as 5!5! ways to arrange five distinct objects in a row. If order does not matter, count combinations, (nr)=n!r!(n−r)!\binom{n}{r}=\dfrac{n!}{r!\,(n-r)!}. 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 rr objects chosen from nn different objects: queues, rankings, codes, or officers with different roles.

Order does not matter: combinations

Use when you are selecting a group of rr objects from nn with no regard to order: committees, teams, hands of cards.

Key terms

What does n!n! mean?

The factorial n!n! is the product of all positive integers from 11 up to nn, and it counts the arrangements of nn distinct objects in a row. By definition 0!=10!=1.

e.g. 5!=5×4×3×2×1=1205!=5\times4\times3\times2\times1=120.

What is a permutation?

A permutation is an ordered arrangement of rr objects chosen from nn distinct objects. Their number is n!(n−r)!\dfrac{n!}{(n-r)!}.

e.g. Choosing and arranging 33 people from 55 can be done in 5!2!=60\dfrac{5!}{2!}=60 ways.

What is a combination?

A combination is a selection of rr objects from nn distinct objects when the order does not matter. Their number is (nr)\binom{n}{r}.

e.g. Choosing a group of 33 from 55 people gives (53)=5!3!2!=10\binom{5}{3}=\dfrac{5!}{3!\,2!}=10.

What is the multiplication principle?

If one task can be done in mm ways and a second independent task in nn ways, the two together can be done in m×nm\times n ways. It extends to any number of independent tasks.

e.g. With 33 starters and 44 main courses, there are 3×4=123\times4=12 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) 120120 (b) 100100 (c) 720720

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: (103)=10!3!7!=10×9×83×2×1=120.\dbinom{10}{3}=\dfrac{10!}{3!\,7!}=\dfrac{10\times9\times8}{3\times2\times1}=120. M1 - Use (103)\dbinom{10}{3} with the formula or the products 10×9×83×2×1\dfrac{10\times9\times8}{3\times2\times1} A1 - 120120

Why? Cancel 7!7! 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 (63)=6×5×43×2×1=20\dbinom{6}{3}=\dfrac{6\times5\times4}{3\times2\times1}=20, so at least one alto=120−20=100.\text{at least one alto}=120-20=100. M1 - Subtract the all-soprano trios, (63)\dbinom{6}{3}, from the total of trios A1 - 100100

Why? The total of 120120 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: 10P3=10!7!=10×9×8=720.{}^{10}P_3=\dfrac{10!}{7!}=10\times9\times8=720. M1 - Use 10P3{}^{10}P_3 or the product 10×9×810\times9\times8 A1 - 720720

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 3!=63!=6 ways, so the answer to (c) should be 66 times the answer to (a): 6×120=7206\times120=720. It is.

Why? The number of permutations of rr objects is always r!r! times the number of combinations, which gives a quick check that the two methods agree.

Marks (6):
M1 Use (103)\dbinom{10}{3} with the formula or the products 10×9×83×2×1\dfrac{10\times9\times8}{3\times2\times1}
A1 120120
M1 Subtract the all-soprano trios, (63)\dbinom{6}{3}, from the total of trios
A1 100100
M1 Use 10P3{}^{10}P_3 or the product 10×9×810\times9\times8
A1 720720

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.

1
Easy
No calc
[3 marks]
A team of 4 is chosen from 9 volunteers.
(a)  Find the number of possible teams.
[2]
(b)  Find the number of possible teams if one particular volunteer must be included.
[1]
Fractions & powers
Other

Worked solution: practice question 1

2
Medium
No calc
[3 marks]
A panel of 5 is chosen from 6 men and 4 women.

Find the number of ways of choosing the panel if it must contain at least 2 women.
[3]
Fractions & powers
Other

Worked solution: practice question 2

3
Hard
No calc
[6 marks]
A password is formed by choosing 3 letters from {A, B, C, D, E, F} without repetition and 2 digits from {1, 2, 3, 4} without repetition, then arranging all 5 characters in a row.
(a)  Find the total number of passwords.
[3]
(b)  Find the number of passwords that begin with a letter.
[3]
Fractions & powers
Other

Worked solution: practice question 3

Your score so far: 0 out of 12 marks

Common mistakes

  • Using nCr{}^nC_r 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.

Try some questions on permutations and combinations

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.

12C3=220{}^{12}C_{3} = 220

12 nCr 3
220

For a permutation (order matters) choose 2:nPr in the same menu: 1 2 math ▶ 2:nPr 3 enter.

12P3=1320{}^{12}P_{3} = 1320

12 nPr 3
1320

For a factorial, type the number first, then choose 4:! from the PRB menu: 6 math ▶ 4:! enter.

6!=7206! = 720

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

CodeSyllabus content
AHL1.10Counting 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 nPr{}^nP_r counts arrangements where order matters, while a combination nCr{}^nC_r 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 (2!2! 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 55 people gives 5×4=205\times4=20 outcomes, but choosing a committee of 22 gives (52)=10\binom{5}{2}=10.

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 44 people in a row with A and B not adjacent, 4!−3!×2!=24−12=124!-3!\times2!=24-12=12.

Why is (nr)\binom{n}{r} equal to (nn−r)\binom{n}{n-r}?

Choosing rr objects to include is the same as choosing n−rn-r objects to leave out. For example, (72)=(75)=21\binom{7}{2}=\binom{7}{5}=21.

Ready to practise properly?

Practice questions on every section, marked instantly like the real exam.