When the order matters, the number of ways to fill places in a row is a product that shrinks by one each time. You use the multiplication rule and factorials, count arrangements of all the objects, count arrangements of some of them with the permutation formula, and use the rule on codes, numbers and queues.
about 25 min1 simulation1 practice question
Lesson 1 of 3Show all lessonsHide
Try the code and the simulations beside the lesson.
This lesson is Additional Mathematics, unit 11 of Cambridge IGCSE Additional Mathematics 0606, outcomes 11.1 and 11.2. That course has one level, so there is no Core and Extended split here. The unit works with objects that are all different and are used once, so we never repeat an object. The Class 11 and 12 chapter on Permutations and Combinations goes further, with repeated objects and circles.
How many outfits?
A student has 3 shirts and 4 pairs of trousers. Each shirt can go with any trousers, so there are 3×4=12 outfits. Add a choice of 2 pairs of shoes and there are 12×2=24.
The multiplication rule. If one choice can be made in a ways, and then another in b ways whatever the first was, there are a×b ways to make both. We use this for any number of choices made one after another.
Factorials
Five different books go on a shelf. The first place has 5 choices. The next place has 4 choices left, then 3, then 2, then 1. So there are 5×4×3×2×1=120 arrangements.
We write that product as 5!, said "five factorial". In general
n!=n×(n−1)×(n−2)×⋯×2×1.
1!=1 and 2!=2 and 3!=6.
4!=24 and 5!=120.
6!=720 and 7!=5040.
Factorials grow very fast. Notice that n!=n×(n−1)!. For example 6!=6×5!. Put n=1 in this rule: 1!=1×0!, so 0!=1. This is the value the syllabus asks you to use. It also makes sense: there is exactly one way to arrange nothing.
Simplifying. Cancel the common part of a fraction of factorials. 6!8!=8×7=56. And (n−1)!(n+1)!=(n+1)×n.
Permutations
Five runners race for gold, silver and bronze. The gold medal has 5 choices, the silver has 4 choices left and the bronze has 3. So there are 5×4×3=60 ways.
An ordered choice of r objects from n different objects is a permutation. We write the number of them as nPr:
nPr=n(n−1)(n−2)⋯(n−r+1)=(n−r)!n!.
There are r factors, starting at n and going down by 1. The fraction form comes from multiplying and dividing by (n−r)!. For the runners, 5P3=2!5!=60.
Special cases: nP1=n. And nPn=n!, because all the objects are arranged. And nP0=1.
A grid of four rows and four columns labelled A, B, C and D. The cells are the ordered pairs of two different letters: the first letter is the row and the second letter is the column. The cells above the diagonal, AB, AC, AD, BC, BD and CD, are blue. The six cells below the diagonal, BA, CA, CB, DA, DB and DC, are orange. The cells on the diagonal are empty.
The picture lists the arrangements of 2 letters taken from A,B,C,D. There are 4P2=12 cells, because AB and BA are different. You will see in the next lesson what happens when the order does not matter.
Codes and numbers
A PIN with different digits. Four digits from 0 to 9, with no digit used twice: 10P4=10×9×8×7=5040.
Numbers from given digits. How many 3-digit numbers can be made from 1,2,3,4,5 with no digit repeated? Each number is an ordered choice of 3 of the 5 digits: 5P3=60.
A condition on the last digit. How many of those are even? The last digit is 2 or 4, so it has 2 choices. The first two places are then an ordered choice of 2 from the 4 digits left: 4P2=12. The total is 2×12=24.
When a place has a condition, fill that place first. This is the most useful habit in the unit. A number cannot start with 0, so with the digits 0 to 5 you fill the first place first, using only 1 to 5.
Practise with new numbers
Try it in Python
The program prints the factorials, then counts the arrangements of 3 runners out of 5 by the formula and by listing them all.
Common mistakes
Forgetting that the choices shrink. The second place has n−1 choices, not n.
Starting a number with 0. Fill the first place first, with the digit 0 excluded.
Mixing up n! and nPr. The first uses all n objects. The second uses only r of them.
Writing 0!=0. The value is 1.
Remember these
The multiplication rule: choices made one after another multiply.
n!=n(n−1)⋯1, and 0!=1.
nPr=(n−r)!n! counts ordered choices of r objects from n.
Fill the places with a condition first.
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Work out 7!9!.
In how many ways can 6 different books be arranged on a shelf?
Four of 7 runners will get a first, second, third and fourth place. How many results are possible?
How many 3-digit numbers can be made from 1,2,3,4,5,6 with no digit repeated, if the number must be odd?
Show that nP2=n2−n.
References
Cambridge International, IGCSE Additional Mathematics 0606 syllabus (2025, 2026 and 2027), unit 11, outcomes 11.1 and 11.2.
Enroll free in Counting Arrangements and Selections
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.