A question mentions choosing three students, so you reach for a combination. Another mentions arranging three students, so you choose a permutation. That distinction often helps, but wording alone is not enough. You need to decide what makes two outcomes different.
If exchanging the order changes the result being counted, order matters. If the same selected members still form the same outcome, order does not matter. Roles, restrictions and repeated objects can change the calculation again.
This guide develops that decision using original examples. It is a revision explanation rather than a complete syllabus checklist. Match your practice to your examination year and component. For structured topic coverage, explore AS Level Math S1 at Abeel Eschool.
Describe one complete outcome
Before calculating, write an example of one result. If the task is to form a team of three from six students, a complete outcome could be the team consisting of A, B and C. Writing the names in another order does not create another team.
If the task is to appoint a captain, secretary and treasurer from six students, an outcome must say who receives each role. A as captain, B as secretary and C as treasurer differs from B as captain, A as secretary and C as treasurer.
Both questions use three students from the same six. The distinction is the information included in a complete outcome. A selection records membership. An assignment records membership and placement or role.
This definition is more reliable than looking for a single keyword. In an unfamiliar question, ask whether swapping two selected objects produces a new valid result.
Build ordered counts from the multiplication principle
Suppose three different roles are filled by three of six students, with no student holding more than one role. There are six choices for the first role, five for the second and four for the third.
The total is 6 × 5 × 4 = 120. Each step describes the choices remaining after the earlier assignments. The order of filling the roles is a counting method; the distinct roles are what make the resulting assignments different.
This is the permutation count 6P3, often written as 6!/(6−3)!. The factorial notation compresses the same multiplication. It does not replace the need to know whether repetition is allowed.
If a student could hold several roles, the available choices would not decrease in that way. Read the restrictions and construct the actual process rather than applying a formula merely because roles are present.
Convert ordered arrangements into unordered selections
Return to selecting a team of three from six students. The ordered count of 120 includes every team several times. A team containing A, B and C appears in six orders: ABC, ACB, BAC, BCA, CAB and CBA.
Every three-person team has 3! = 6 orders because the members are distinct. Dividing the ordered total by six gives 120/6 = 20 teams. This is the combination count 6C3.
In general, nCr = n!/[r!(n−r)!] when selecting r distinct members from n distinct available members without ordering the selected group. The r! factor removes the repeated orders of each selection.
Understanding that division helps prevent a common mistake: using a permutation and then dividing by an arbitrary number. You must establish how many times each desired outcome has been counted.
Check your method on a smaller example
If six choose three feels abstract, select two members from four labelled students A, B, C and D. The unordered pairs are AB, AC, AD, BC, BD and CD. There are six.
The ordered pairs number twelve because AB and BA are different ordered results. Each unordered pair is counted twice, so 4P2/2! = 12/2 = 6.
A small list gives you a way to test the meaning of a formula. It can reveal whether you are counting roles, groups or sequences. It also shows why an outcome with the same members in another order may or may not be new.
Listing is a revision tool, not a requirement to enumerate a large answer under exam conditions. Once the structure is clear, use a concise calculation and explain its key factors.
Apply restrictions before multiplying
Imagine selecting a chair and a secretary from eight students, where only three students are eligible to chair. Assume each student can hold at most one role. There are three choices for chair and seven remaining choices for secretary, giving 21 assignments.
Using 8P2 would include ineligible chairs. Using 3 × 8 would allow the chair to be selected again as secretary. Both expressions miss a stated restriction.
The easiest counting order is often to fill the most restricted position first. This avoids having to split later cases according to whether an eligible person has already been used elsewhere.
Do not turn that into an absolute rule. Some problems are clearer through cases or complements. Choose a counting process that keeps the remaining choices easy to describe and does not count an outcome twice.
Count teams with required members
Suppose a team of four is chosen from nine students and a particular student must be included. Include that student first. You then choose three additional members from the remaining eight, giving 8C3 = 56 teams.
If two specified students must both be included, choose the remaining two members from the other seven: 7C2 = 21. The required students do not need to be “arranged” inside an unordered team.
If the condition changes to “at least one of two specified students,” splitting into “first included” and “second included” without care counts teams containing both twice. You could instead count all teams and subtract those containing neither.
For nine students and teams of four, that complement is 9C4 − 7C4 = 126 − 35 = 91. The subtraction removes every team that fails the condition exactly once.
Use cases that cannot overlap
Another way to count teams with at least one of two specified students is to separate exactly one from both. Exactly one can be selected in 2C1 ways, and the other three members come from the remaining seven, giving 2C1 × 7C3 = 70.
For teams containing both specified students, choose two more from seven: 7C2 = 21. Adding gives 70 + 21 = 91, agreeing with the complement method.
The cases are mutually exclusive: a team cannot contain exactly one and both specified students. Together they cover every team satisfying “at least one.” These are the two checks that make a case split useful.
Write a short label for each case. A long string of combination expressions is difficult to review if you cannot tell which situation each expression counts.
Arranging objects together uses a block carefully
Suppose five distinct books are placed in a row and two particular books must be next to each other. Treat the pair as one block. You now arrange four units: the block and the other three books.
There are 4! arrangements of these units. The two books can swap positions within their block in 2! ways. The total is therefore 4! × 2! = 48.
The block does not make the two books indistinguishable. Its internal arrangements still matter. Forgetting that factor counts only one order for each adjacent pair.
If three particular books must stay together, there are three units to arrange and 3! internal arrangements of the block, giving 3! × 3! = 36. This example assumes a straight row and five distinct books; circular arrangements or repeated objects require different treatment.
Repeated letters remove indistinguishable orders
Consider arrangements of the letters in LEVEL. There are five letters, with two Ls and two Es. Treating all five positions as occupied by distinct labelled objects gives 5!, but swapping the identical Ls or identical Es does not create a new visible arrangement.
The number of distinct letter arrangements is 5!/(2!2!) = 30. The division removes the repeated labels that are not part of the result you want to count.
Do not apply this division merely because objects share a colour. If the question describes individually distinct objects, their identities may still matter. Decide what a complete outcome records.
Similarly, choosing objects from categories with limited supplies can require more careful reasoning than a simple repeated-letter formula. Read whether individual objects are distinguishable and whether the task asks for arrangements or selections.
Probability questions need consistent counting
When equally likely unordered selections are the natural outcomes, a probability can be calculated as qualifying combinations divided by total combinations. For example, a random team of three from six students contains one specified student in 5C2 ways out of 6C3 total teams.
The probability is 10/20 = 1/2. The numerator and denominator both count unordered teams under the same selection model.
Mixing an unordered numerator with an ordered denominator generally produces an incorrect ratio. If you choose an ordered model, count both qualifying and total outcomes in that ordered model.
Also check that outcomes are equally likely. A procedure that gives some groups more opportunities than others cannot automatically be analysed by dividing one simple count by another. The random process matters alongside the counting formula.
Review the meaning of each factor
When an answer differs from a solution, annotate your expression. What does the first factor count? What choices remain for the next factor? Does a division remove a fixed number of duplicate counts for every outcome?
Record the type of error: order, repetition, eligibility, overlapping cases or indistinguishable objects. Then create a smaller version you can enumerate. This connects the correction to a concrete counting process.
For broader practice planning, see Abeel’s Cambridge past-paper guide and AS/A2 study planning. Work through a mixed set after topical practice so the heading no longer announces the method.
Explore Abeel Eschool and its course catalogue for current subject options. If you need help, bring an attempted count to admissions and FAQs and ask how the relevant course supports the topic.
Frequently asked questions
How do I know whether order matters?
Describe a complete outcome, then swap two selected members or objects. If the result changes because positions or roles differ, order matters.
Why do combinations divide by r factorial?
An unordered selection of r distinct members appears in r! orders in the corresponding ordered count. Dividing removes those repeated orders.
Should I always count restrictions first?
It is often convenient to fill a restricted position first, but choose the clearest complete method. Some restrictions are easier through disjoint cases or a complement.
Why do I multiply by an internal block factorial?
Grouping objects keeps them together, but their order within the block can still change. Count those internal arrangements when the objects are distinct.
Can I use permutations in a probability calculation?
Yes, if the numerator and denominator consistently count the same kind of equally likely ordered outcomes. Do not mix ordered and unordered counts without justification.
Have a question about this topic?
Send your query to Abeel Eschool and our admissions team will get back to you.