JC2 · H2 Mathematics · Notes
Choose and arrange under restrictions, with complete working for repeated objects, distributions, groups, blocks, gaps and rotational symmetry.
Permutations and Combinations summary and formula sheet: every method on 4 pages
Mr Ian Ang’s summary of the whole permutations and combinations chapter on four pages.
Page 1 of 4 Choosing the method
H2 Math summary notes
Permutations and Combinations formulas and methods, section by section
Page 1 of 4Choosing the method
The basics and the key words: n!, nCr, together, separated, repetition
- distinct in a row: ; in a circle: . Choose of : ; choose, then arrange: "P n C". Together: group them. Separated: permute the rest, then slot in.
- 6 boys, 4 girls: choose 3 boys and 2 girls, line up the 5: .
- 4 boys, 3 girls in a row, girls together: . Girls separated: .
- 4-digit numbers from 1 to 6, repetition allowed: . Not allowed: .
- Warning: already arranges, so not again.
Codewords: all the letters, dividing out the identical letters
- : divide out the identical letters. ARRANGEMENT has A, R, N, E twice and G, M, T once.
- No restrictions: .
- Vowels together (group A, A, E, E): .
- Vowels all separated: permute the consonants, then slot in: .
- Vowels not all together: complement, .
Codewords: some of the letters, split by the repeat pattern
- 4-letter codewords from BALLOON: split by the repeat pattern, then choose, then permute.
- ABCD: . AABC: .
- AABB: .
- Total .
- Warning: not for the two single letters: that orders them.
Passcodes and numbers: repetition allowed, odd and less than, exactly four different digits, zero not first
- 6-digit codes from 1 to 7 (even 2, 4, 6; odd 1, 3, 5, 7), repetition allowed: . Alternate: . Exactly 3 even: positions .
- 5-digit, no repeat, odd, less than 50000: first 1 or 3: ; first 2 or 4: ; total 840.
- 6-digit codes from 1 to 7, exactly four different digits. AAABCD: . AABBCD: . Total 54600.
- Warning: two pairs: , not .
- Digits 0, 1, 2, 2, 3, 3 once each, with 0 not first: .
- Odd, less than 300000, by first and last digit: : ; : ; : . Total 48.
Labelled and unlabelled groups: divide by the factorial of the identical groups
- 9 people into 3 groups of 3. Unlabelled: . Labelled A, B, C: .
- Groups of 4, 4, 1: .
- Divide by the factorial of the identical groups.
- Alan and Bea in the same group of the 3: .
Distributing objects: distinct prizes, identical prizes and at least one each
- 4 distinct prizes to 3 students: each prize picks one, so . Not : the prizes are the ones choosing.
- 4 identical prizes to 3 students: list the cases. : 3; : ; : 3; : 3. Total 15.
- 6 different sweets, 3 children, each at least one. : . : . : .
- Total 540.
- Warning: pick one split only and a child may get none.
Page 2 of 4Conditions
"A or B, or both": n(A union B) = n(A) + n(B) - n(A intersect B)
- .
- Beads in a row: 3 R, 3 B, 2 G (the same colour identical); the first is R or the last two are G.
- , and .
- So .
- Warning: do not add the two counts alone: both is counted twice.
Exactly X out of N together: stars first, slot the block and the single heart
- 4 distinct stars, 5 distinct hearts in a line, exactly four hearts next to each other.
- Stars first: . Slot the block and the single heart: .
- Hearts: choose the block , arrange .
- Total . Separated means slot.
At least: cases, complement, yes or no
- Three routes: (1) cases, (2) complement, (3) yes or no.
- A committee of 5 from 6 men and 5 women, at least 2 women. Cases: 2W: , 3W: 150, 4W: 30, 5W: 1, total 381. Complement: .
- Warning: not : do not choose from the balance.
- 9 students, a delegation of at least 1: each is yes or no, so . The 1 is the all-no case.
- 8 distinct balls: 3 red, 2 blue, 3 green. Choose 5 with every colour: .
Separating two sets of items: complement of the union, and why a double slot fails
- A, A, B, B, C, D with no two adjacent letters the same. No restrictions: .
- AA together: ; BB together: ; both together: .
- The Venn diagram shows AA and BB overlapping in both: this is the complement of the union.
- .
- Warning: slotting A first, then B is a "double slot": it misses ABAB cases.
All not, not all, separated, alternate: four phrases, four methods
- 4 men, 4 women in a row. Women all together: .
- Women not all together: .
- Women all separated: .
- Alternate: .
- "All not together" and "all separated" are not the same as "not all together".
Selecting identical objects: list how many of each
- 6 identical red, 4 identical blue, choose 5: list how many of each. , , , , gives 5 ways. For numbered balls it would be .
- 4 colours, plenty of each, choose 3. All different: .
- Exactly two the same: .
- All the same: . Total 20.
Page 3 of 4Circles and more
Circular arrangements: (n - 1)!, numbered seats, separated, couples, opposite and empty chairs
- distinct in a circle: . Numbered seats: (the number of seats).
- 9 people at a round table, 3 named people separated: the other 6 in a circle , slot the 3 in 6 gaps . So . Numbered seats: . In a row: .
- 5 couples, each couple together: . 4 men, 4 women alternate: .
- Alan and Bea opposite each other, table of 8: fix Alan, then .
- 4 people, 2 identical empty chairs, table of 6: empty chairs are identical objects, so .
Rotational symmetry of tables: ways = n! divided by the order
- The order of rotational symmetry is the number of times the shape fits into itself in a full turn. Ways .
- Square, 2 chairs a side, 8 people: .
- Triangle, 2, 2, 3 chairs, 7 people: after the shape is different, so .
- Rectangle, 3 chairs on each long side: after the same, so .
- A door on the shape: the turned shape is different, order 1.
Particular people in a selection: a person who is in is fixed, do not choose him
- A particular person is selected: do not choose him, he is fixed.
- Committee of 4 from 5 men, 4 women, a particular man in: .
- 5 from 6 men and 5 women: Chris or Dora, not both, at most one woman. Chris in, Dora out: 0 women ; 1 woman: .
- Dora in, Chris out: . Total 50.
Ties: list the splits with a repeated top value
- 6 voters, 3 candidates: a tie for the most votes.
- : .
- : .
- Total 150. List every split with a repeated top value.
Seats in a row, empty seats: not together by complement
- 8 seats, 6 people; two named people not next to each other.
- All: .
- Together: 7 seat pairs .
- Not together: complement, .
Page 4 of 4Pictures of the slot and circle methods
Separated: slot diagram, men first and women in the gaps
- 4 men, 4 women, women all separated. The diagram shows the four men with five gaps numbered 1 to 5.
- Men first: , then 4 of the 5 gaps: .
- Women in those gaps: .
- So .
Together: group first, then arrange inside the group
- 4 men, 4 women, women all together. The four women are boxed as one group.
- The group and the 4 men: ; inside the group: .
- So .
Round table: separated, the other 6 in a circle and the 3 named in the gaps
- 9 people, 3 named separated. P: the other 6; N: named, in gaps.
- The 6 in a circle: .
- 3 of the 6 gaps, arranged: .
- So .
Round table: alternate, men round the table and women in the gaps
- 4 men, 4 women alternate, in the pattern M W M W and so on.
- Men round the table: .
- Women in the 4 gaps: .
- So .
Round table: opposite, fix Alan and Bea has one seat
- A table of 8, Alan and Bea opposite.
- Fix Alan: Bea has one seat.
- The other 6 anywhere: .
Round table: empty chairs are identical, so divide by 2 factorial
- 4 people, 2 identical empty chairs, 6 seats. The empty chairs e are identical.
- 6 objects round a table: .
- The 2 empty chairs are the same: .
- So .
Worked examples
Permutations and Combinations worked examples
Mr Ian’s worked examples for the chapter, with the full working.
What is being counted?
Before choosing a formula, decide whether the objects are distinct or identical, whether order matters, and which arrangements count as the same. “Choose a team” and “assign its captain and secretary” describe different outcomes. Multiply for consecutive choices; add only mutually exclusive cases.
Choose first, then arrange if needed
Select four objects with a colour restriction
A box contains 5 distinct red tokens, 4 distinct blue tokens and 3 distinct green tokens. Four tokens are selected, with order irrelevant. Find the number of selections with at least two colours, and with all three colours.
For at least two colours, subtract selections that use only one colour. Green has fewer than four tokens, so contributes no such selection.
With all three colours, exactly one colour occurs twice. These cases do not overlap:
There is no extra factor of : a selection does not record the order in which tokens are drawn.
Repeated letters and repeated digits
Arrange repeated letters, then form shorter words
How many arrangements of all the letters of BANANA are there? How many four-letter codewords can be made from its available letters?
For shorter codewords, dividing does not work: first decide which multiplicities occur. The available letters are A three times, N twice and B once.
| Multiplicity | Choice and arrangement | Count |
|---|---|---|
| 3 + 1 | AAA with N or B: | 8 |
| 2 + 2 | AANN: | 6 |
| 2 + 1 + 1 | repeat A or N, use the other and B: | 24 |
The letter B cannot be repeated. Every valid codeword appears in exactly one row.
A six-digit number with exactly three even digits
Digits 1–9 may be repeated. Find the number of six-digit numbers containing exactly three even digits. Then count six-digit odd numbers below 600000 when repetition is forbidden.
For the first task, choose the three even positions, then fill them. There are four even digits and five odd digits:
For the second task, the last digit must be odd and the first digit is 1–5. Split on whether the first digit is odd or even, because that changes the last-digit choices.
After choosing the first and last digits, seven unused digits remain for four ordered middle positions.
Are the groups labelled?
Three teams of equal size
Nine distinct people are split into three teams of three. Find the number of splits if the teams are unlabelled, then if the teams play three different named games. For unlabelled teams, count the splits in which two specified people are together.
Divide by only in the first task: permuting the same three teams creates no new split. For the specified pair, form their team first, then split the remaining six people into two unlabelled teams:
Check: the probability that a particular other person joins the first person is ; , as expected.
Distribute objects: identify what can be distinguished
Five distinct gifts, at least one each
Five different gifts are given to three named people, each receiving at least one. Count by the size of each person’s share.
In the second line choose the person receiving one gift, then give two gifts to the first of the other two named people and two to the other. Their names already distinguish them; no further is needed.
If all five gifts were identical, only the share sizes matter. The positive splits are permutations of and : distributions.
“Either … or … or both”: subtract the overlap
A row uses 4 identical E pieces, 3 identical C pieces and 2 identical W pieces. Count rows whose first piece is E or whose last two pieces are E, or both.
Let A be “first is E” and B be “last two are E”. Fix those positions before arranging the remaining repeated pieces:
In the overlap, three E pieces are fixed, leaving one E. Do not subtract an arrangement in which the required E positions are not all fixed.
Blocks, gaps and “exactly”
Exactly three of four friends sit together
Four specified friends and three other distinct people stand in a row. Count arrangements in which there is a block of exactly three friends, with the fourth friend separated from that block.
Choose the isolated friend. Arrange the block of three internally, then arrange this block with the three other people. Those four units create five gaps. The two gaps touching the block are forbidden to the isolated friend, leaving three.
The block of three is unique in each valid row, so nothing is counted twice. Treating three friends as a block without keeping the fourth away would include all four together.
Separate two different pairs of repeated letters
Arrange A, A, B, B, C, D in a row so that no identical letters are adjacent. Use complementation: a gap method that first separates A may let later B insertions create new choices inconsistently.
For , the four units are AA, BB, C and D. Add this overlap back because the first two subtractions removed it twice.
A selection of any non-zero size
Each person is chosen or not chosen
A non-empty delegation is chosen from eight people, with two specified people either both included or both excluded. The pair has two choices; each of the other six people has two choices.
Subtract the empty delegation once. Summing combinations by delegation size is possible, but the independent yes/no choices are shorter here.
Around a circle: arrange the blocks, then use the gaps
Four pairs and two separated hosts
Four teams of two distinct people and two distinct hosts sit around a round table. Teammates must sit together and the hosts must not sit next to each other. Rotations count as the same; reflections count as different.
Arrange the four team blocks around the circle, then arrange each team internally. Put the hosts in two different gaps between team blocks:
There are four gaps in a circle. Choosing different gaps ensures that a team block separates the hosts. The internal order of each pair matters.
Choose the hosts’ gaps
Each highlighted pair of gaps supports two orders of the distinct hosts.
Gaps 1 and 2: host H can use either selected gap, with host J in the other. Six gap pairs × two orders = 12 placements.
Variation: seats on a square table
Eight distinct people sit two per side of a square table. Rotations that carry the whole seating layout onto itself count as the same. Reflections remain different.
There are four valid rotations, not eight: rotating by one seat does not preserve the square. If a door fixes an absolute orientation, all eight seats are distinguishable and the answer is . With four boys and four girls, one of each on every side:
Choose which seat on each side is occupied by a boy, then fill the boy and girl positions separately, before dividing by the four rotations.
Before you finish
Check that cases are exhaustive and do not overlap, and that each factorial has a reason. “Not all together” removes one block case; “none together” requires separation. Divide by a group factorial only when exchanging entire groups creates the same outcome.