Permutations & combinations: notes and practice questions
- Product Principle: Use for sequential events (AND).
- Sum Principle: Use for mutually exclusive choices (OR).
- Factorial Notation: represents the product of integers from 1 to .
- Permutations: Order matters. for arrangements of from . For items with repetitions, use .
- Combinations: Order does not matter. for selections of from .
- Strategies: Grouping (items together), Gaps (items separated), Complement (at least one), and handling constraints first are key problem-solving techniques.
How it is examined
Two different things share one code, and they are examined differently. Counting is a short Paper 2 item. The extended binomial is a Paper 1 item where the validity condition is a marking point that students skip. The "not required" list is the useful part: a question about seating people around a round table, or about arranging the letters of a word with repeats, is out of syllabus for AA HL. 4 to 7 marks.
is in the notation list; the fractional and negative index expansion , , is given.
- Counting principles, including permutations and combinations.
- Extension of the binomial theorem to fractional and negative indices, ie , .
- Not required: permutations where some objects are identical; circular arrangements.
- Not required: proof of the binomial theorem.
Linking questions
- Other contexts: finding approximations to .
- Aim 8: how many different tickets are possible in a lottery, and what that says about the ethics of selling lottery tickets.
Practice questions
15 questions · 10 medium · 5 hardQuestion 1
MediumPaper 1 · no calculator8 marksA hotel has five vacant rooms in a row, labelled 1 to 5. Four new guests, Alice, Ben, Chloe, and David, are to be assigned to these rooms. Alice and Ben are a couple who have recently had an argument and wish to be in separate rooms.
(a) The rooms are large suites, and each suite can accommodate all four guests. Find the number of ways the guests can be assigned to the rooms if Alice and Ben must be in different rooms.
(b) Each room can only accommodate one guest. Find the number of ways the guests can be assigned to the rooms if Alice and Ben must not be in adjacent rooms.
Consider two approaches: either calculate the total number of ways to assign rooms without any restrictions and subtract the number of ways where Alice and Ben are in the same room, or consider placing Alice first, then Ben, and then the other two guests.
One way is to calculate the total number of permutations and subtract the cases where Alice and Ben are in adjacent rooms. Another way is to consider cases based on where Alice is placed (an end room versus a middle room) and then count the possibilities for Ben.
Question 2
HardPaper 1 · no calculator7 marksA project manager has employees available for a new project. The employees are to be divided into two teams, Team Alpha and Team Beta. For the project to be successful, Team Alpha must have exactly four members and Team Beta must have at least four members.
The manager will randomly assign four employees to Team Alpha, with the rest forming Team Beta.
Write down an expression for the number of ways that the teams could be formed.
Two of the employees, Chloe and David, have a history of conflict and cannot be in the same team. The manager agrees to this condition, and finds that this restriction reduces the number of possible team formations to two-fifths of the original number.
Determine the value of .
How many ways can you choose a group of a specific size from a larger group, where the order of selection does not matter?
First, find an expression for the number of ways to form the teams such that Chloe and David are in different teams. Then, set this expression equal to the new total number of formations and solve for n.
Question 3
MediumPaper 1 · no calculator8 marksA school is organizing a science fair. There are 6 display booths available, arranged in a single row. Five different projects are to be displayed: Biology, Chemistry, Physics, Earth Science, and Mathematics.
The booths are large and can hold multiple projects. The Physics and Chemistry projects use sensitive equipment and cannot be placed in the same booth.
(a) Find the number of ways of placing the five projects in the six booths.
(b) Each booth may only contain one project. The Physics and Chemistry projects cannot be placed in adjacent booths. Find the number of ways of placing the five projects in the six booths.
Consider the total number of arrangements without any restrictions first. Then, think about the arrangements where the two specific projects ARE together. How can you use this to find the number of arrangements where they are NOT together? This is often called the complementary counting principle.
Since each booth can only hold one project, this is a permutation problem. One booth will be empty. It might be easier to count the arrangements where the two projects ARE adjacent and subtract this from the total number of possible arrangements.
Question 4
HardPaper 2 · calculator19 marksA new automated manufacturing process produces components. The time, in minutes, taken for a critical assembly step is modelled by a continuous random variable , with a probability density function defined by
Find the exact value of .
Find .
The assembly step is considered "efficient" if it takes less than 1.5 minutes. Each assembly step is independent. Determine the least number of assembly steps required to be 99% sure of at least one efficient step.
Ten assembly steps were conducted.
Find the probability that exactly three steps were efficient.
Write down the number of ways these three efficient steps could have occurred consecutively in a batch of 10.
Now consider a batch of assembly steps where it is given that exactly three efficient steps have occurred.
Write down an expression for the number of ways these three efficient steps could have occurred consecutively.
Find the greatest value of such that the probability of three consecutive efficient steps is more than 0.05, given that exactly three efficient steps have occurred in the batch.
Recall that the expected value for a continuous random variable is given by the integral of over its domain. Consider using a substitution method for integration.
Integrate the probability density function from the lower limit to 1.5. Recall the integral of .
Let be the probability of an efficient step from part (b). The probability of at least one efficient step in trials is . Set up an inequality and solve for .
This is a binomial probability problem. Identify , , and , then use the binomial probability formula .
Consider placing a block of 3 consecutive successes within the 10 trials. If the block starts at position 1, 2, etc., how many starting positions are there?
Generalize your approach from part (e) for trials instead of 10.
This is a conditional probability problem. The probability is the ratio of (number of ways for 3 consecutive successes) to (total number of ways for exactly 3 successes in trials). Set up an inequality and solve for .
Question 5
MediumPaper 2 · calculator5 marksSeven students are lining up for a class photograph. Two specific students, Ben and Chloe, insist on standing next to each other, with Ben always to Chloe's immediate left.
Find the total number of possible ways the seven students can line up under this condition.
In a different arrangement of the same seven students, two other students, Daniel and Emily, have a preference. Daniel must stand somewhere to the left of Emily (not necessarily immediately to the left).
Find the total number of possible ways the seven students can line up under this condition.
Consider Ben and Chloe as a single unit. How many 'items' are you then arranging?
Consider the total number of arrangements without any restrictions. What can you say about the positions of Daniel and Emily in these arrangements?
Question 6
HardPaper 1 · no calculator7 marksA student is exploring some properties of combinations.
(a) Show that for integers .
(b) Show that for integers .
Start by writing out the expressions for the combinations in terms of factorials. For example, . Then, try to manipulate one side of the equation to match the other.
Similar to part (a), express all combination terms using the factorial formula. Work on one side of the identity (e.g., the left-hand side) and simplify it as much as possible. Then do the same for the other side and show that the simplified expressions are identical.
Question 7
MediumPaper 2 · calculator7 marksA museum curator is arranging 5 unique ancient scrolls in a row of 10 empty display cases. For a special exhibit, these 5 scrolls must be displayed next to each other in a continuous block.
Find the number of ways these 5 scrolls can be arranged in this row.
For a different display, the curator returns the scrolls to the same row of 10 empty display cases. One of the scrolls, "The Cursed Amulet", must not be displayed next to any of the other four scrolls. The other four scrolls do not have to be displayed next to each other.
Find the number of ways these 5 scrolls can now be arranged in this row.
Consider the group of 5 scrolls as a single unit first, then consider the arrangements within that unit.
Consider using the complementary method: calculate the total number of arrangements without restrictions, then subtract the arrangements where 'The Cursed Amulet' IS next to at least one of the other scrolls.
Question 8
HardPaper 1 · no calculator13 marksA group of 8 students are participating in a science fair. They are to be arranged in a single row for a photograph. Find the number of different arrangements possible.
A company is creating a new system for employee access codes. Each code must be between 4 and 6 characters long, inclusive. The characters are chosen from the set {A, B, C, 1, 2, 3, 4}, without repetition. Each code must start with a letter and end with an even number. Determine the total number of different access codes that can be created.
A school is forming a student council committee of 6 members. The candidates consist of 8 students from Grade 12 and 6 students from Grade 11. The committee must have at least one student from Grade 11, and there must be more Grade 12 students than Grade 11 students. Calculate the number of different committees that can be formed.
Consider the number of choices for the first position in the row. Once that student is placed, how many choices are left for the second position? Continue this pattern for all positions.
This problem needs to be broken down into cases based on the length of the access code. Calculate the number of possible codes for each length (4, 5, and 6 characters) separately, then add them together. For each case, consider the restrictions on the first and last characters first.
First, identify all the possible compositions of the committee (number of Grade 12 vs. Grade 11 students) that satisfy all the given conditions. For each valid composition, use combinations to calculate the number of ways it can be formed. Finally, sum the results.
Question 9
MediumPaper 2 · calculator5 marksA research laboratory has a collection of 27 unique experimental power cells, with charge levels ranging from 1 unit to 27 units. A scientist needs to select three power cells for a specific experiment.
For the experiment to be successful, the sum of the charge levels of the three selected power cells must be divisible by 3.
Determine the total number of distinct selections of three power cells the scientist can make to ensure a successful experiment. The order of selection does not matter.
Consider categorizing the power cells based on their charge level modulo 3. How can three numbers sum to a multiple of 3 based on their remainders when divided by 3?
Question 10
HardPaper 1 · no calculator8 marksA company has a server rack with 7 servers arranged in a single row. Five distinct software applications, App A, App B, App C, App D, and App E, are to be deployed. Each server is powerful enough to run all five applications. However, App A and App B are incompatible and cannot be deployed on the same server.
(a) Find the number of ways of deploying the applications.
(b) In a different scenario, six distinct applications, App 1 to App 6, are to be deployed. Each server can only run one application. App 1 and App 2 require significant network bandwidth and must not be deployed on adjacent servers. Find the number of ways of deploying these six applications.
Consider the total number of ways to deploy the applications without any restrictions. Then, think about the cases where the restriction is violated and subtract them. Alternatively, consider placing the restricted applications first.
This is a permutation problem. You can find the total number of arrangements and subtract the arrangements where the two specific applications are adjacent. Alternatively, you can place the other applications first to create spaces for the two restricted applications.
Question 11
MediumPaper 2 · calculator6 marksA software development team consists of four senior engineers and six junior technicians.
The team members are to be placed in a line to have their photograph taken.
(a) Calculate the number of ways the team members can be placed if
(i) there are no restrictions;
(ii) all senior engineers must be placed next to each other.
Five members of the team are selected to work on a critical project. Find the number of possible selections that contain at least three senior engineers.
Consider the total number of distinct positions available for each team member.
Treat the group of senior engineers as a single unit. Remember to account for the internal arrangements within that unit.
Consider the different cases that satisfy the condition 'at least three senior engineers'. Remember that the total number of senior engineers is limited.
Question 12
MediumPaper 1 · no calculator9 marksA bag contains five tiles, each with a different number from the set . Two tiles are drawn from the bag at random, one after the other, without replacement. The outcome is recorded as an ordered pair.
(a) State the number of possible outcomes.
(b) Find the probability that the number on the second tile is greater than the number on the first tile.
(c) Find the probability that the sum of the numbers on the two tiles is an even number.
The order in which the tiles are drawn matters, and they are not replaced. Consider how many choices there are for the first tile drawn, and then how many choices remain for the second tile.
You can either list all the pairs where the second number is larger than the first, or you can think about the symmetry of the problem. Out of all possible pairs of distinct numbers, in how many of them will the second be larger?
The sum of two integers is even if they are both even or if they are both odd. Consider these two cases separately and add their probabilities.
Question 13
MediumPaper 2 · calculator7 marks(a) A university library contains a collection of new fiction books, of which are fantasy novels. A student randomly selects books from this collection to take home.
Find the probability that the selection will contain no fantasy novels.
(b) Find the probability that the selection will contain at least two fantasy novels.
To find the probability of selecting no fantasy novels, consider the number of ways to choose fantasy novels from the available fantasy novels and non-fantasy novels from the available non-fantasy novels. Divide this by the total number of ways to select books from the entire collection.
Consider using the complementary event. The probability of selecting 'at least two fantasy novels' is minus the probability of selecting 'no fantasy novels' and 'exactly one fantasy novel'. You may have already calculated the probability of no fantasy novels in part (a).
Question 14
MediumPaper 2 · calculator6 marksA local cinema has a row of available seats for a special movie screening. Four friends, Alex, Ben, Chloe, and David, want to sit in this row.
Find the number of possible ways that they can be seated in this row if they decide not to sit together as a group of four.
The next day, Alex, Ben, Chloe, and David are joined by two additional friends, Emily and Frank, for another screening in the same cinema row of seats. This time, Alex, Ben, Chloe, and David decide to sit next to each other as a group of four.
Find the number of possible ways that these people can be seated.
First, calculate the total number of ways to seat the four friends in the available seats. Then, calculate the number of ways they can sit together as a single group. Finally, subtract the latter from the former.
Consider the group of four friends (Alex, Ben, Chloe, David) as a single unit. Determine how many ways this unit can be placed and how many ways the friends within the unit can be arranged. Then, consider the remaining two friends and how they can be seated in the remaining available seats.
Question 15
MediumPaper 1 · no calculator5 marksFour distinct French novels and three distinct German novels are placed randomly on a bookshelf.
Find the probability that all the French novels are grouped together, and all the German novels are grouped together.
First, determine the total number of ways to arrange all the books. Then, consider the case where all books of the same language are together as a single block. How many ways can you arrange these blocks, and how many ways can you arrange the books within each block?
No question on this page matches those filters. Try another difficulty or paper.
Every Permutations & combinations question, marked for you
Every answer is marked mark by mark, IB-style, and the AI tutor helps when you are stuck.
Where marks are lost
- Using your own wrong value after failing a "show that".