A permutation or combination formula is useful only after the outcome being counted has been defined. The same people or objects can produce different counts when the task changes from selecting a group to assigning positions. Begin with a concrete outcome and ask what would make another outcome different. That decision gives the formula its meaning.
This original practice guide supports the Gujranwala O and A Level family plan and the general permutations and combinations guide. The examples are invented teaching exercises, not official examination items. Use notation and methods appropriate to the student's current syllabus and the task's instructions.
Describe one outcome in ordinary words
Suppose five distinct people labelled A, B, C, D and E are available. If the task selects three for an unranked committee, one outcome is the membership set containing A, B and C. Writing the same names as C, A and B does not create another committee. No positions or roles were assigned by that description.
If the task chooses a chair, secretary and treasurer, an outcome must specify who holds each office. A as chair, B as secretary and C as treasurer differs from B as chair, A as secretary and C as treasurer. The membership is unchanged, but the role assignment is different. The task's definition determines what is counted.
Do not decide solely from the words choose or arrange. A question can say choose people for distinct roles, in which case the roles distinguish outcomes. Read the whole statement and write a brief outcome description. That explanation can reveal a method-selection issue before a calculator or factorial expression hides it.
Count the role assignments directly
Choose a chair from the five people. Four remain eligible for secretary because the exercise specifies that no person may hold more than one role. After those choices, three remain for treasurer. The multiplication principle gives 5 × 4 × 3 = 60 assignments. Each sequence of role choices produces one complete assignment.
Explain the decreasing numbers. They result from the no-repeat restriction, not from a general rule that every successive choice must be smaller. If a different task allowed the same person to hold multiple roles, its choices would need a different analysis. Do not carry the restriction into a new problem unless it is stated or justified.
The role order is fixed in the counting procedure: chair, secretary, treasurer. That makes the list systematic. Choosing offices in another consistent order would lead to the same total, but mixing procedures without tracking duplicates can make a manual list unreliable. Define the outcome and the counting route clearly enough to see whether each assignment appears exactly once.
Remove repeated counting for an unranked committee
The sixty role assignments contain each membership group six times, once for each arrangement of its three members among the three offices. For A, B and C, there are three choices for the first role, two for the second and one for the last, giving six. Every three-person group has the same six assignments under these conditions.
Therefore the unranked committee count is 60 divided by 6 = 10. This is 5 choose 3. The division removes a known repeated count. It is not a correction applied merely because sixty looks too large. The explanation depends on every committee being represented exactly six times in the ordered count.
A small explicit list can check the result. The ten committees are ABC, ABD, ABE, ACD, ACE, ADE, BCD, BCE, BDE and CDE. Each label here represents membership with no roles. Sorting the names in a consistent order helps avoid listing the same group again under a different written arrangement.
Apply a required-member condition before calculating
Now require A to be a member of the committee. A is fixed, so choose the remaining two members from B, C, D and E. There are 4 choose 2 = 6 possible committees: ABC, ABD, ABE, ACD, ACE and ADE. The count can be checked against the full ten-committee list.
If the condition instead excludes A, all three members must be chosen from the other four, giving 4 choose 3 = 4 committees. The required-A and excluded-A cases partition the full set, and their counts add to ten. This complement comparison checks the interpretation without relying on a second identical formula entry.
Do not confuse A being a member with A holding a specified office. If A must be chair in the role-assignment task, choose secretary and treasurer from the other four in 4 × 3 = 12 ways. A's membership alone would allow A to hold any of the three offices, so it is a different restriction.
Use a book example to test transfer
Take six distinct books and select three to carry, with no order assigned. The number of selections is 6 choose 3 = 20. Now place three of those books in three distinct left-to-right shelf positions. The count is 6 × 5 × 4 = 120 arrangements. Each chosen three-book group can occupy the positions in six orders.
This is the same structural distinction as committees and roles, but the surface objects differ. Ask the student to explain why the count changes rather than recognise the earlier numbers. The statement “the books are different” is not enough; the question must also distinguish their positions for the ordered count to be the requested result.
If all six books are placed on a shelf, there are 6! = 720 arrangements under the simple distinct-book model. A task involving identical copies or additional placement restrictions requires more thought. Do not assume that the distinct-object calculation automatically applies to objects the task treats as indistinguishable.
Consider a simple position restriction explicitly
Suppose the six distinct books include a particular book R, and three are placed in the shelf positions with R required to be in the first position. Fix R first. There are five choices for the second position and four for the third, giving twenty arrangements. The required position removes one choice from the general three-position procedure.
If R must be included somewhere among the three positions, choose its position in three ways and fill the other two positions in 5 × 4 ways. This gives sixty arrangements. The three cases are disjoint because R occupies exactly one of the three positions. The count differs from the first-position requirement because the condition allows more outcomes.
A complement check gives the same sixty: start with 120 arrangements and subtract the 5 × 4 × 3 = 60 that exclude R. This agreement can help detect a counting error. Explain why the complement is exhaustive and nonoverlapping rather than treating agreement between two unexplained calculations as proof that the model fits.
Avoid assuming every division has a factorial explanation
When ordered outcomes are grouped into unordered selections, a factorial factor can arise because each group has a fixed number of arrangements. Check that the grouping is uniform. If restrictions distinguish some arrangements or objects are repeated, dividing by a familiar factorial without a counting argument can give an unjustified result.
For practice, ask the student to identify what is counted more than once and how often. If they cannot name the repeated object, return to a small list. An expression such as n factorial divided by r factorial is not self-explanatory merely because it resembles a memorised formula. Connect each factor to a choice or repeated count.
The compare-methods guide offers a related routine for explaining why two valid routes agree. The changed-condition guide helps inspect a new role or membership restriction. Use the link that addresses the student's observed difficulty rather than adding unrelated work.
Keep counting distinct from a probability conclusion
A count of outcomes is not automatically a probability. To form a favourable-count divided by total-count probability, the counted elementary outcomes must be equally likely and defined consistently. A task that selects people or books using unequal weights cannot be solved by treating every membership group as equally probable without further justification.
Even with a uniform process, check that numerator and denominator count the same kind of object. Counting favourable unranked groups over total ordered assignments would mix representations. Either use a consistent outcome space or justify the relationship between the counts. The Lahore S1 model-choice guide provides related practice in defining the quantity before choosing a method.
The Rawalpindi restricted-outcome guide illustrates why equal-likelihood assumptions and the reference set matter in probability. Its ordered dice examples are a different experiment, but the habit of defining an elementary outcome transfers to counting tasks when used with the correct conditions.
Finish with a fresh independent description
Give a new task and ask the student to describe one outcome before calculating. Include a comparison in which the same names receive roles and another in which they form an unranked group. Then add one clear restriction. Keep the model closed so the choice is not supplied by the example heading.
Record meaningful hints through the independent-attempt routine and bring an unresolved small list to a teacher using the specific-question guide. Place the next revisit within the AS and A2 Pakistan plan. Confirm subject support and work review through the admissions FAQ; this article establishes no local class, marking entitlement or examination arrangement in Gujranwala.
Frequently asked questions
What is the first decision in a counting question?
Define one outcome. Decide whether it is an unranked group, an ordered arrangement or an assignment of distinct roles. Then identify restrictions. The formula should follow that interpretation rather than be chosen from an isolated word.
Why divide sixty role assignments by six for the committee count?
Each three-person membership group appears in six different role assignments under the stated model. Dividing removes that uniform repeated count. The factor must be justified by the structure of the task, not by the size of the answer.
Is a required member the same as a required roleholder?
No. Requiring A to be included allows different roles or positions for A, while requiring A to be chair fixes one office. Identify exactly which outcomes the condition allows before choosing the remaining people or positions.
Does a combination count automatically give a probability?
No. A probability requires a defined random process and appropriate outcome probabilities. Favourable-count over total-count reasoning needs equally likely elementary outcomes and consistent counting in numerator and denominator. Do not assume uniformity from a convenient list.
How can I check whether the method is understood?
Use a fresh task with different objects and ask the student to explain what makes two outcomes distinct. Then vary one role or membership condition. A justified method choice without a hint is more informative than repeating a familiar formula immediately after a model.
Ask about O and A Level courses
Share your subjects, current study stage and the support you need. The Abeel Eschool team can help you check the current course options.