eduKate Singapore

VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Next useful routeCanonical hubHELP

Mathematics in Bukit Timah | Permutations, Arrangements and Seating Restrictions

—

by

eduKate Asia
Illustration of two students discussing mathematical reasoning with square tiles and a notebook.

Five fictional pupils arrange five different books in a row. One pupil calculates five choices for each of five positions and answers 5⁵. Another calculates 5! = 120 because a book already placed cannot be selected again. Both have used multiplication, but only the second respects the rule that each distinct book appears exactly once. This is the central idea behind permutations.

This Mathematics in Bukit Timah article teaches the multiplication principle, factorials, permutations versus combinations, repeated objects, circular arrangements, adjacency restrictions, complement counting and inclusion–exclusion. Every student, book, seating plan, classroom and activity is fictional mathematical data, not an actual Bukit Timah school’s roster, assessment or event. The aim is to teach students how to count arrangements without double-counting or missing valid cases.

The quick answer: five distinct objects in five ordered positions can be arranged in 5×4×3×2×1=120 ways. If two specified objects must be next to one another, treat them as a block and multiply by their two internal orders: 4!×2!=48 ways. If they must not be adjacent, subtract from the total: 120−48=72 ways.

Article contents

October educational illustration of students reasoning about mathematical examples and counterexamples, accompanying invented permutation and seating problems rather than a real class roster.

Quick answer: ask whether order matters

A permutation is an ordered arrangement or selection. A combination selects objects without caring about their order.

Selecting three pupils from five gives C(5,3)=10 possible groups. Assigning three different positions to three chosen pupils gives P(5,3)=5×4×3=60 ordered outcomes.

The difference is not the notation alone. It is whether changing positions creates a new result under the question’s rules.

Why Bukit Timah is context, not evidence about a real timetable

Parents around Sixth Avenue, Beauty World and King Albert Park may recognise classroom book displays and group assignments. They make combinatorics tangible without requiring real pupil names.

But no actual school seating arrangement or participant choice is reported here. The counts follow from explicit fictional constraints, not collected observations.

Mathematics becomes more reliable when the learner first names the objects, positions, repetition rules and restrictions instead of immediately choosing a familiar formula.

The multiplication principle counts sequential choices

If one action offers a choices, and every such choice can be followed by b choices for another action, there are ab possible ordered outcomes.

For example, three invented shirt colours and two notebook-cover colours create 3×2=6 colour pairs when every combination is allowed.

The principle depends on the number of second-stage options being correctly counted. If an earlier choice restricts later choices, the factors must reflect that reduction.

Worked example 1: arrange three different books

Let the books be A, B and C. There are three choices for the first position, two for the second and one for the third.

Total arrangements are 3×2×1=6. They are ABC, ACB, BAC, BCA, CAB and CBA.

Listing all six confirms the count. There is no seventh arrangement because every ordered use of A, B and C has already been included once.

Factorial notation compresses the product

For a positive integer n, n! means n(n−1)(n−2)⋯2×1. By convention 0!=1.

Thus 3!=6, 4!=24 and 5!=120. Factorials count linear arrangements of n distinct objects into n distinct slots when each object is used once.

The notation is not an instruction to apply an exclamation mark to the answer. It represents a defined multiplication product.

Worked example 2: calculate six factorial

Compute 6!=6×5×4×3×2×1=720.

Therefore six distinct books can be arranged on six ordered shelf positions in 720 ways under the no-repetition rule.

If some books are identical, or some positions are not distinguished, this result may overcount. Read the object’s identity and slot conditions before using n!.

Repetition changes the counting rule

Imagine a four-character classroom code using the letters A, B, C, D and E. If repetition is allowed, each of four positions has five choices.

There are 5⁴=625 four-character strings, including examples such as AAAA and ABBA.

If letters cannot repeat, the choices are five, four, three and two, giving 5×4×3×2=120. The same alphabet gives a very different count when the repetition condition changes.

Worked example 3: four-character code with no repeats

Choose four positions from five distinct letters, without replacement.

First position has five choices, second four, third three and fourth two. Product is 120.

It is incorrect to use 5⁴=625 because that formula permits a letter already chosen to appear again, violating the stated constraint.

Ordered selections are counted by nPr

For n distinct objects and r ordered positions with 0≤r≤n, the number of no-repetition assignments is P(n,r)=n!/(n−r)!.

The numerator counts n choices decreasing by one, and the denominator removes factors not used in the first r positions.

For r=n, the expression reduces to n!. For r=0, there is one empty arrangement, represented by P(n,0)=1.

Worked example 4: assign three jobs to seven candidates

Seven fictional candidates are eligible for three different labelled roles: leader, recorder and presenter. No candidate can take more than one role.

There are 7 choices for leader, 6 for recorder and 5 for presenter. Total =7×6×5=210.

This is P(7,3), not C(7,3), because exchanging leader and recorder produces a new assignment.

Combinations remove the position order

If the seven candidates only need to form an unlabelled group of three, changing their listing order does not create a new group.

The number is C(7,3)=7!/(3!4!)=35, not 210.

Every unlabelled group of three can be ordered into 3!=6 role sequences. That explains 210=35×6. The relationship is derived from counting the same results in two stages.

Worked example 5: choose and then arrange

Select three pupils out of five, then assign them to three distinct chairs.

There are C(5,3)=10 possible chosen trios, and each trio has 3!=6 seating orders. Total=10×6=60.

Directly, P(5,3)=5×4×3=60. The agreement verifies the connection between permutations and combinations.

Distinct objects are essential to n factorial

Suppose the letters A, B, B are arranged in a row. Treating the two B copies as distinguishable would give 3!=6 labelled permutations.

But swapping the two indistinguishable Bs produces the same visible string. The distinct strings are ABB, BAB and BBA—only three.

The correct count divides by the permutations of identical copies. With two identical B letters, 3!/2!=3.

Worked example 6: arrange the letters of ABBA

The word ABBA contains two A letters and two B letters. If all four copies were labelled, there would be 4!=24 arrangements.

Swapping the A copies does not change the visible word, and neither does swapping the B copies. Divide by 2!2! to obtain 24/4=6 distinct arrangements.

The answer counts different visible four-letter strings, not different hidden identities of identical letters.

The repeated-letter formula

For n positions containing groups of identical objects with multiplicities a,b,c,… summing to n, the number of distinct linear arrangements is n!/(a!b!c!…).

The denominator corrects overcounting from swapping identical items within their groups.

It assumes every object is used and that the only indistinguishability is the one explicitly stated. Other restrictions need additional reasoning.

Worked example 7: arrange BANANA

BANANA contains six letters: A appears three times, N twice and B once.

The number of distinct strings is 6!/(3!2!1!)=720/(6×2)=60.

A pupil who reports 720 has treated equal letters as distinct. A pupil who divides by only 3! forgets the second repeated group.

Leading positions can impose extra constraints

Suppose a fictional number is formed from digits 0,1,2,3 without repetition and must have exactly four digits.

The first position cannot be zero, because a leading zero would produce a shorter ordinary decimal integer. It has three choices.

After that, the remaining three positions can be filled in 3!=6 ways. Total four-digit integers are 3×6=18.

Worked example 8: four-digit integers with no repeated digits

First digit is chosen from 1,2,3: three choices. The remaining three digits come from the remaining set, in 3×2×1 ways.

Total is 3×3×2×1=18.

If the question instead asks for four-character PINs, a leading zero may be valid. Then all 4!=24 arrangements are allowed under the no-repetition rule. The interpretation of “number” versus “code” changes the count.

Codes and integers are not identical objects

A PIN such as 0073 has four characters. As an ordinary decimal integer, 0073 is represented by the same value as 73.

Thus a four-position code can allow a leading zero even when a four-digit number cannot. The question must define whether leading zeros matter.

Students should not automatically impose the first-digit nonzero rule on strings, access labels or other codes.

Worked example 9: four-position PIN with repetition

A fictional PIN uses exactly four decimal digits from 0 through 9. Leading zeros and repeated digits are allowed.

Each position has ten choices, giving 10⁴=10,000 strings.

The result includes 0000 and 9999. It is a count of possible representations under the stipulated code format, not a recommendation to use any particular security practice.

A fixed first object reduces the factorial

If five distinct books must have A first, only the remaining four books are free to change order.

There are 4!=24 arrangements. The choice for the first position is no longer five; it has already been fixed by the condition.

The same reasoning holds if one object is forced into any one specified slot in an ordinary line.

Worked example 10: one pupil seated first

Five distinct fictional pupils A,B,C,D,E must sit in five distinct chairs, with A in the first chair.

The other four can be arranged in 4!=24 ways. Check that allowing A any of the five chairs would multiply the count by five, giving the unrestricted 5!=120.

The ratio 24/120=1/5 reflects the symmetry of A’s possible positions in an unrestricted arrangement.

“A or B first” requires disjoint cases

If either A or B may occupy the first chair, but only one can sit there, consider two cases.

A first gives 4!=24 arrangements. B first gives another 24. Because the cases cannot overlap, add to get 48.

This is not the same as requiring A and B both to occupy the first chair, which would be impossible.

Worked example 11: exclude one person from the first position

Five pupils are to sit in a row, but A cannot be first.

Unrestricted arrangements total 5!=120. Arrangements with A first total 4!=24, so valid arrangements =120−24=96.

Alternatively choose the first person from B,C,D,E (four choices) and arrange the other four (4! choices), giving 4×24=96.

Adjacent objects can be treated as one block

Suppose A and B must sit next to each other among five distinct pupils in a row.

Treat the pair as one block [AB]. Along with C,D,E, there are four objects to arrange, giving 4! possibilities.

The pair can be AB or BA internally, so multiply by 2!. Total 4!×2=48 arrangements.

Worked example 12: A and B together

For A,B,C,D,E in a row, combine A and B into one block.

Arrange [AB],C,D,E: 4!=24 ways. The block has two orientations, AB and BA.

Total 24×2=48. This method counts every adjacent A–B arrangement exactly once because each has a unique combined block position and internal order.

Not adjacent is often easier by subtraction

If the same A and B must not be adjacent, use the complement of the adjacent event.

Total arrangements are 5!=120. Adjacent arrangements are 48.

Therefore nonadjacent arrangements are 120−48=72. The complement method is valid because every arrangement is either adjacent or nonadjacent, never both.

Worked example 13: verify a complement

Count arrangements of five distinct pupils where A and B cannot sit together.

The complementary groups partition all possibilities: 48 adjacent and 72 nonadjacent. Their sum is 120.

A student who subtracts 2! directly from 5! would remove only two arrangements, not the many positions in which the pair can appear.

Ordered pairs have two internal arrangements

If A and B are grouped together in a block, [AB] and [BA] are different orders because A and B are distinct.

If two identical objects are forced adjacent, the internal swap may not create a new visible arrangement and the extra factor of two would be inappropriate.

The distinction between distinct people and identical letters must be kept throughout the count.

Worked example 14: identical letters required adjacent

Arrange letters A,A,B,C with the two identical As together.

Treat AA as one block with B and C, giving 3!=6 distinct arrangements. There is no internal factor 2! because swapping the identical As changes nothing.

This contrasts with two named pupils A and B, whose adjacent block has two orientations.

A before B cuts a symmetric count in half

For two distinct named objects A and B in an otherwise unrestricted row arrangement, reversing the positions of A and B pairs arrangements one-to-one.

Exactly half have A before B and half have B before A. With five distinct pupils, this gives 5!/2=60 arrangements with A before B.

The argument assumes no other asymmetric restriction distinguishes A from B.

Worked example 15: a before b without adjacency

Suppose five distinct pupils must sit in a row with A somewhere before B, but not necessarily directly beside B.

By symmetry, 120 total arrangements split evenly into 60 with A before B and 60 with B before A. Answer: 60.

If an additional rule such as “A must sit in chair one” is imposed, the symmetry calculation needs reconsideration rather than automatic halving again.

A and B at opposite ends

For five distinct pupils, require A and B to occupy the two end chairs.

There are two ways to assign A and B to left and right ends. The three remaining pupils can occupy the middle seats in 3!=6 ways.

Total is 2×6=12. This is smaller than merely requiring A or B to be at one end, because both endpoint positions are constrained.

Worked example 16: fixed pair of end seats

Arrange A,B,C,D,E with A and B at the ends.

Choose which endpoint has A (two choices); B gets the other. Permute C,D,E in the middle: six choices.

Total 12. No additional factor 5! should appear because the end conditions have already assigned two of the positions.

Inclusion–exclusion handles overlapping forbidden cases

Sometimes two restrictions can fail simultaneously. If we subtract each forbidden group from the total, arrangements violating both are subtracted twice.

The inclusion–exclusion principle adds that overlap back once.

For two events U and V, the count satisfying neither is total−|U|−|V|+|U∩V|. The overlap term is necessary whenever U and V are not disjoint.

Worked example 17: neither A nor B may sit at an end

Five distinct pupils A,B,C,D,E sit in a row. A and B may occupy only the three middle chairs.

Count directly: assign A to one of three middle positions and B to one of the remaining two. Arrange C,D,E in the remaining seats in 3! ways.

Total is 3×2×6=36 valid arrangements.

Check the preceding result by inclusion–exclusion

Let U be the event A sits at either end, and V be B sits at either end. Each has 2×4!=48 arrangements.

Their overlap requires A and B at opposite ends: 2×3!=12 arrangements.

Valid arrangements with neither at an end are 120−48−48+12=36, matching the direct method. The agreement verifies the overcounting correction.

Why an overlap must not be forgotten

If we simply compute 120−48−48=24, we remove the 12 arrangements with both A and B at ends twice.

Adding twelve restores them to the correct count of arrangements satisfying neither forbidden condition.

The method requires events with correctly defined membership. One should not add arbitrary factorial terms because a formula is remembered vaguely.

Arranging objects around a circle is different from a row

In a round seating arrangement where rotations are considered equivalent, n distinct people around a circle have (n−1)! arrangements.

The reason is that rotating everyone by the same amount does not create a new relative seating order. Fix one reference person to break rotational symmetry, then arrange the other n−1 people around them.

This count treats reflections as different unless the problem explicitly declares mirror images equivalent.

Worked example 18: five distinct pupils at a round table

Five named pupils sit around a circular table with no numbered seats. Rotating the entire arrangement does not create a new seating order.

Fix pupil A at a reference position. The remaining four can appear clockwise in 4!=24 orders.

Using 5!=120 would count each relative circle arrangement five times due to rotation.

The circular formula depends on the meaning of “same”

If the round table’s seats are individually numbered or fixed to distinct compass-facing positions, rotations may be considered different.

If the question treats a bracelet that can be flipped over, reflections may also be equivalent under additional conditions.

The standard (n−1)! circle count assumes distinct people, rotational equivalence and no reflection equivalence. State those assumptions rather than applying the formula to every object drawn in a circle.

Worked example 19: four labelled seats versus an unlabelled circle

Four distinct pupils at four labelled positions have 4!=24 assignments.

At an unlabelled round table where rotations are equivalent, they have (4−1)!=3!=6 relative cyclic arrangements.

The difference comes from what constitutes a distinct outcome, not from a change in the number of people.

Adjacency at a round table needs circular counting

Suppose five distinct pupils sit at an unlabelled round table and A and B must be adjacent.

Treat them as one block, giving four objects around the circle. Those have (4−1)!=3!=6 circular orders.

Multiply by two for AB versus BA inside the block. Total is 12 relative arrangements.

Worked example 20: compare line and circular adjacency

For five distinct pupils in a row, adjacent A and B yield 2×4!=48.

For five around a circle up to rotations, adjacent A and B yield 2×3!=12.

Both use a block and an internal-order factor, but the count of objects outside the block is arranged linearly in one problem and circularly in the other.

Circular “not adjacent” follows by complement

For five distinct pupils around a rotationally unlabelled circle, unrestricted arrangements total (5−1)!=24.

Adjacent A,B arrangements total 12. Therefore not-adjacent arrangements total 24−12=12.

The result can be checked by fixing A and noting that B has two non-neighbour seats among the four remaining locations; the other three pupils then have 3! arrangements, giving 2×6=12.

Worked example 21: check circular adjacency positions

Fix A at the reference position on a five-seat circle. B has four possible seats relative to A.

Two are immediately adjacent and two are nonadjacent. For each selected B seat, the remaining three pupils can be arranged in 3!=6 ways.

Thus adjacent =2×6=12 and nonadjacent =2×6=12. Their sum 24 matches the complete circular count.

Grouping several people introduces internal factorials

Suppose three specific pupils must sit together in a row among six distinct pupils.

Treat their three-person group as one block. Together with the three other pupils, there are four objects to order, giving 4!.

Inside the block, the three named pupils can appear in 3! orders. Total =4!×3!=24×6=144.

Worked example 22: three together among six

Label the specified pupils A,B,C and the others D,E,F.

The block [ABC] can occupy one of the appropriate positions among the four arranged objects. Four-object arrangements give 24, while six internal ABC arrangements give 6.

Answer 144. The restriction means the three must be consecutive but allows any order within their consecutive seats.

Restricting a group to one particular order changes the answer

Suppose A,B,C must sit together in that exact left-to-right order.

The combined block has only one permitted internal arrangement instead of 3!=6. With the same three other pupils, count is 4!=24.

The phrase “together” is not the same as “together in order A,B,C”. Small wording differences change multiplication factors.

Worked example 23: require exact internal order

Six distinct pupils A,B,C,D,E,F sit in a row. A,B,C must occupy consecutive positions in the order ABC.

Treat ABC as one fixed block. Arrange it with D,E,F, giving 4!=24.

Multiplying by six would violate the explicit fixed-order condition. Always ask whether the internal block arrangement can vary.

Alternating groups are a different restriction

Suppose three distinct pupils from Group X and two from Group Y sit in five chairs and must alternate group types.

Only the group pattern X–Y–X–Y–X works because X has one more member than Y.

The three X pupils can occupy their positions in 3! ways and the two Y pupils in 2! ways, giving 3!2!=12 arrangements.

Worked example 24: alternate three and two

With X pupils A,B,C and Y pupils D,E, the pattern X Y X Y X is fixed.

Arrange A,B,C in their three X slots in six ways; arrange D,E in two Y slots in two ways. Total is 12.

An alternating pattern beginning and ending Y is impossible with three X and two Y because it would require three Y slots.

The complement method is powerful but requires exhaustive categories

“Either A and B adjacent or not adjacent” partitions all arrangements into two disjoint cases, so subtracting one count from the total is safe.

Other problems may have more than one forbidden event, requiring inclusion–exclusion rather than a single subtraction.

Before using a complement, state the exact event excluded and confirm that every arrangement belongs to one category or its complement.

Arrangements with repeated symbols can be checked by positions

For the letters BANANA, another approach chooses the positions of the three As among six, then the positions of the two Ns among the remaining three.

There are C(6,3)=20 choices for A positions and C(3,2)=3 choices for N positions. The remaining position is B.

Total =20×3=60, agreeing with 6!/(3!2!).

Worked example 25: repeated objects by choosing slots

In the word AABBCC, choose which two of six positions contain As: C(6,2)=15.

Choose two of the remaining four for Bs: C(4,2)=6. The final two positions belong to Cs.

Total 15×6=90, agreeing with 6!/(2!2!2!)=720/8=90.

Identical objects are not distinguished by imagined hidden labels

A learner sometimes names identical counters A₁ and A₂ while arranging them, which creates a labelled intermediate count.

That is permitted as a technique only if the overcounting from hidden label exchanges is removed afterward.

If the problem’s output is a visible arrangement of identical objects, swaps of identical copies do not create new results. The distinction is in the definition of a distinct outcome.

A restricted first digit may change several later choices

Consider four-digit even integers formed without repetition from digits 0,1,2,3,4. The first digit cannot be zero, and the last digit must be even.

The cases differ depending on whether the last digit is zero or is two or four, because using zero in the final place changes whether zero is available among the remaining digits.

A systematic case split is safer than multiplying one generic first-digit count by one generic last-digit count.

Worked example 26: count four-digit even numbers

Case 1: last digit zero. First digit has four choices from 1–4. The two middle positions have 3×2=6 choices. Count is 4×6=24.

Case 2: last digit is two or four (two choices). First digit cannot be zero or the chosen final digit, leaving three choices. Middle positions again have 3×2=6 choices. Count is 2×3×6=36.

Total 24+36=60 valid four-digit even numbers. The cases are disjoint and exhaustive under the stated digit set.

Fixing multiple seats can create factorial subproblems

Suppose six distinct pupils sit in six labelled chairs. A must be in chair one and B must be in chair six.

The remaining four pupils occupy the middle chairs in 4!=24 ways.

If A and B may exchange the two ends, multiply by two to get 48. If their end assignments are fixed, no such factor is allowed.

Worked example 27: distinguish fixed and flexible ends

Six pupils A,B,C,D,E,F occupy six chairs.

With A on the left end and B on the right end, count 4!=24. With A and B at the two ends in either order, count 2×4!=48.

The difference is exactly the number of allowed end orientations.

Derangements count arrangements where nobody keeps their own position

For n distinct objects with a designated original position, a derangement is a permutation in which no object occupies its own original position.

For four named objects, the derangement count is nine. This can be found through inclusion–exclusion, not by simply subtracting four arrangements from 4!.

The condition “none correct” creates overlapping forbidden fixed-position events.

Worked example 28: derangements of four

There are 4!=24 unrestricted arrangements. Let each of four events mean a particular object remains in its original position.

Inclusion–exclusion gives D₄=4!−C(4,1)3!+C(4,2)2!−C(4,3)1!+C(4,4)0!.

Compute 24−4×6+6×2−4×1+1=24−24+12−4+1=9.

Why subtracting one-per-person fails

Four objects have 24 permutations, and each object appears in its original position in many permutations.

Subtracting “four wrong arrangements” would not remove all fixed positions; subtracting all single-person fixed cases without adding overlaps back would remove some outcomes multiple times.

Inclusion–exclusion explicitly accounts for two, three and four simultaneous fixed positions.

Worked example 29: exactly one person in the original chair

With four distinct people, choose which one remains in the correct chair: C(4,1)=4 choices.

The other three must form a derangement of their three original positions. D₃=2.

Therefore the number of permutations with exactly one correct position is 4×2=8.

Two objects left cannot exchange unless both move

For two specified distinct objects in two designated positions, exactly one remaining correct position is impossible: if one stays, the other must occupy the only remaining position and also stays.

In the four-person problem, exactly three correct positions cannot occur for the same reason. The fourth would necessarily be correct.

This logical constraint can settle a counting case without factorial calculation.

Worked example 30: exactly two correct chairs among four

Choose which two people keep their original chairs: C(4,2)=6.

The remaining two must exchange their positions, which is one valid derangement of two objects. Total 6 arrangements with exactly two fixed positions.

The counts by number of fixed positions are 0:9, 1:8, 2:6, 3:0, 4:1. Their sum is 24, verifying completeness.

A probability can be obtained after counting

If all 5! linear arrangements of five distinct pupils are equally likely, then the probability A and B are adjacent is 48/120=2/5.

The probability they are not adjacent is 72/120=3/5.

These probabilities depend on the uniform random-permutation assumption. The combinatorial counts alone do not show that real seating plans are generated uniformly at random.

Worked example 31: probability of a fixed first seat

If every permutation of five distinct pupils is equally likely, the probability A sits first is 4!/5!=24/120=1/5.

The result agrees with symmetry: A has five equally likely possible positions.

Do not claim a school assigns seats randomly just because a mathematical question models all arrangements as equally likely.

Counting valid arrangements is not scheduling feasibility by itself

If the constraint is “A and B cannot sit next to each other”, counting valid rows is a permutation problem.

If the constraint is “activities sharing pupils cannot occur in the same time period”, graph colouring may be more appropriate. A timetable has resource conflicts that are not necessarily captured by a single row ordering.

The Bukit Timah graph-colouring guide addresses that different optimisation question.

Counting grid routes is another distinct use of combinations

A shortest grid route requiring four east steps and three north steps can be counted by choosing which four of seven ordered steps are east: C(7,4)=35.

This is an arrangement of repeated step types, not an arrangement of seven distinctly named pupils. The counting connection is real, but the underlying objects differ.

See Mathematics in Bukit Timah: Pascal’s Triangle and Grid Paths for that separate problem class.

A useful checklist before selecting a counting method

Define which objects are distinct, which positions are distinguishable, whether order matters, whether repetition is allowed and whether a circle is considered equivalent under rotation.

Then read each restriction: fixed position, forbidden position, adjacency, relative order, identical copies or group alternation.

Only after those decisions should the learner select a factorial, permutation, combination, block method or inclusion–exclusion.

Common error 1: use n to the power r with no replacement

For four positions filled from five distinct letters without repeats, 5⁴ incorrectly allows repeated letters.

The correct factors decrease: 5×4×3×2=120. A pupil should explain why each chosen letter is no longer available.

Repair the meaning of without replacement before asking for another formula.

Common error 2: forget the block’s internal order

With distinct A and B together, [AB] and [BA] are different. Treating the block as fixed gives 4!=24 and misses the other orientation.

Multiply by 2! for the two internal orders to obtain 48. For identical As, that internal multiplier would not apply.

The object-identity assumption determines the correction.

Common error 3: use linear factorials for an unlabelled circle

Five distinct pupils in a row have 120 arrangements. Around a circular table with rotations equivalent, the count is 24.

The missing factor five accounts for the rotational copies of each relative order. Fixing one reference person gives a simple explanation.

Do not apply circular counting if positions are individually labelled; read the precise condition.

Common error 4: subtract overlapping forbidden cases twice

When A and B are both banned from the end seats, subtracting the cases “A at an end” and “B at an end” removes arrangements with both at ends twice.

Add their overlap back using inclusion–exclusion. The result 36 matches direct placement in the three middle seats.

A student should draw the categories or write event sets rather than memorise an unexplained correction term.

Common error 5: ignore repeated letters

BANANA has only sixty distinct visible permutations, not 720, because its three As and two Ns are identical within each group.

The standard correction divides by 3!2!, accounting for swaps that leave the visible string unchanged.

The final result should be checked with a small repeated-letter example first if factorial cancellation is unfamiliar.

Primary readiness: small lists and choice diagrams

Young pupils can arrange three different cards and list all six orders. They can recognise that ABC and BAC are different orders.

This is a concrete foundation for the multiplication principle. Avoid large factorial formulas until students reliably identify when an object may be reused.

A systematic tree with shrinking branches often communicates no-replacement counting better than a bare numerical formula.

Upper Primary: multiplication principle and restrictions

Older Primary learners can count two-stage and three-stage choices, then consider simple restrictions such as “A must be first”.

They should explain why one condition reduces the first factor from five to one, or why two mutually exclusive cases can be added.

The priority is careful enumeration rather than speed. Formal notation can follow once the reasoning is secure.

Secondary preparation: factorials, ratios and combinations

Students can connect factorials with the number of ordered slots, then learn nPr and nCr as compressed versions of products.

The most important diagnostic is asking: “Does swapping two selected objects create a new outcome?” If yes, order matters; if no, combination counting may be appropriate.

Advanced circular or inclusion–exclusion problems should be treated as enrichment where outside the student’s current course.

Additional Mathematics and further combinatorics

The SEAB 2027 G3 Additional Mathematics syllabus includes factorial and combination notation in its binomial expansion context. Not every restricted permutation, derangement or circular-seating technique here is asserted to be examinable.

A learner who enjoys the extensions may later study discrete Mathematics and probability. The foundational habit remains defining the distinct outcomes correctly.

A twenty-minute family diagnostic

Minutes 1–5: Arrange four different books with no repeats: 4!=24. Compare with a four-character code from five letters with repetition: 5⁴=625.

Minutes 6–10: For five distinct pupils in a line, count adjacent A and B: 48. Then count nonadjacent: 72.

Minutes 11–15: Compare five people in a row (120) with five around an unlabelled circle (24). Explain rotational equivalence.

Minutes 16–20: Count arrangements of BANANA (60) and four-digit even numbers without repeated digits from 0–4 (60). Explain why the two sixties arise through different counting arguments.

A seven-day practice sequence

Day one lists all orders of three objects. Day two practises multiplication with and without repetition. Day three introduces factorials and ordered selections.

Day four distinguishes permutations from combinations. Day five handles fixed seats and adjacent blocks. Day six uses circular equivalence and repeated letters.

Day seven changes one restriction in a fresh problem and asks for an independent count and check. If the learner cannot define a distinct outcome, pause before applying more advanced formulas.

Challenge questions with checked answers

A. Arrange four distinct books. Answer: 4!=24.

B. Assign three ordered roles among five people. Answer: 5P3=60.

C. Choose three people from five without roles. Answer: C(5,3)=10.

D. Arrange five distinct pupils with A and B adjacent. Answer: 48.

E. Arrange five distinct pupils with A and B not adjacent. Answer: 72.

F. Arrange letters of BANANA. Answer: 60.

G. Seat five distinct people around an unlabelled circular table. Answer: 4!=24.

H. Count derangements of four distinct objects. Answer: 9.

Frequently asked questions

What is the difference between permutation and combination?

Permutations count ordered results; combinations count selected groups without order.

Why does the number of options decrease without repetition?

After selecting an object it is no longer available for later positions, so the count of choices shrinks.

Why is 0! equal to one?

It is defined as one to preserve the factorial and combinatorial identities, including the single empty arrangement.

How do I count two pupils who must sit next to each other?

Treat them as a block, arrange the resulting objects, and multiply by the permitted internal orders of the pair.

How do I count pupils who must not sit next to each other?

Often subtract adjacent arrangements from all arrangements, provided the two cases partition the complete sample space.

Is a round table counted by n factorial?

When rotations are equivalent for n distinct people, the usual count is (n−1)!, not n!.

Why does BANANA need division by factorials?

The three As and two Ns are identical within their groups, so swapping their hidden copies does not create a new visible string.

Is a four-digit PIN allowed to start with zero?

It can be, when the code specification permits leading zeros. A four-digit ordinary decimal integer cannot have a leading zero.

Are these real seating plans from Bukit Timah schools?

No. They are fictional arrangements with explicitly defined mathematical rules.

How do parents recognise mastery?

The learner can describe what makes an outcome distinct, justify each multiplication or subtraction, avoid repeated-object overcounting and verify the result using an alternate method.

Sources and connected Bukit Timah Mathematics

For curriculum context, consult MOE’s Primary Mathematics syllabus, the SEAB 2027 G3 subject directory and the 2027 G3 Additional Mathematics syllabus. The extended circular seating and derangement examples are enrichment, not blanket examination requirements.

Continue with Mathematics in Bukit Timah: Counting Grid Paths, Binomial Expansion and Pascal’s Triangle and Graph Colouring for Conflict-Free Timetables for connected counting concepts with different objectives.

The immutable Clementi Secondary 1 Mathematics tutor reference anchors concept-first reasoning, explicit assumptions, worked checks and independent practice.

The durable habit is to define the distinct objects and positions, decide whether order and repetition matter, apply restrictions before counting, then check for overcounting from identical copies, rotations or overlapping cases.

Read the three companion Mathematics in Bukit Timah articles published in this batch: Circle theorems, chord angles and tangents · Absolute-value inequalities and distance intervals · Trigonometric identities, exact angles and solutions. Together they cover exact Euclidean geometry, inequalities, discrete counting and complete trigonometric solutions, with original practice and checked answers.

Discover more from eduKate Singapore

Subscribe now to keep reading and get access to the full archive.

Continue reading