Porisma

Permutations and combinations

By the end, you can

  • Decide whether order matters
  • Count arrangements with restrictions or repetitions
  • Use addition and multiplication without double counting

about 30 minutes for the lesson · practise at your own pace.

The central idea

Use addition for disjoint alternatives and multiplication for successive choices. Selecting r objects from n distinct objects without order gives (nr)\binom nr. Assigning ordered roles gives n!/(n−r)!n!/(n-r)!. Repeated identical objects reduce arrangement counts; circular arrangements require an explicit convention about rotations.

Open the chapter exploration

Worked example

Choose two representatives from five people: (52)=10\binom52=10. Choose a chair and a secretary instead: 5 choices then 4 choices, giving 20. Swapping roles changes the outcome in the second problem.

Multiplication counts sequences of choices; it may count the same final unordered set more than once.

Check your understanding

How many distinct arrangements are there of the letters in LEVEL?

Mastery learning objectives

At the end of this chapter, I should be able to:

Apply the addition principle

Apply the addition principle for counting.

Apply the multiplication principle

Apply the multiplication principle for counting.

Distinguish selection from arrangement

Differentiate between permutations and combinations.

Count arrangements with constraints

Solve counting problems involving arrangements in a line or a circle, including repetition and restriction.

Choose a counting strategy

Take a complement.

Consider disjoint and exhaustive cases.

Group objects.

Use the slotting method.

Choose a practice question

Use the printed question-type map to choose a method to practise. Links open the complete question; the printed part references are retained below.

SkillLecture examplesDiscussionReview follow-up
Distinct-object permutations with restrictions3, 4, 5, 13, 15(i), 161, 2, 13(i)9(i), 13, 15(i)(i), 16(last part)
Repeated-object permutations with restrictions6, 12, 14(a), 15(ii)4, 5, 7, 102, 3, 5(a), 7(a), 8, 10, 11, 12(b), 14
Selection, including restrictions7, 8, 9(i)(ii)12(b)1
Selection into non-distinct groups of the same size103—
Circular arrangements18, 1985(b), 6, 7(b), 9(ii), 12, 14(iii), 15(iii)(iv), 16(i)(ii)
Complement8(iv), 9(iii)4(iii)2(iii)
Grouping and separation13, 16(iii)5(ii), 6, 11(a)4
Cases8(ii)(iii), 11, 14(b), 15(iii), 16(ii), 175(iv), 7(ii), 9, 10(ii), 11(b), 13(ii)7(a), 10(b)(i)

Read the printed references critically. The complement row prints Example8(iv), whose source working uses inclusion–exclusion and disjoint cases. The explicit complement method is in Example8(iii), “at least one girl”. Both are available in the linked Example8.

The printed Review15(i)(i) repeats(i); the link opens Review15 without inventing a missing part.

The repeated-object row includes Example15(ii), which actually allows repetition of the available distinct digits.

Preserve these source references as navigation pointers while deciding the counting model from each question. Some questions use more than one strategy.

Practice questions

55 examples and practice questions, in 10 sections.

Ready to try this on your own?

For “Permutations and combinations”, try a question without the working and explain your method. This records your confidence, saved in this browser only.

Ready to practise?Chapter practice