Algebra · Grade 9
Solving problems using combinatorial formulae
Solving combinatorial problems: a plan for choosing the formula, problems with restrictions (zero is not the first digit, a member who must be included), choosing from two groups by the multiplication principle, tournaments and the diagonals of a polygon.
15 slides · 45 minutes · 22 test questions
30 days free. No card needed.
Lesson goals
- Find n, k and the kind of selection in a problem: permutations, arrangements or combinations
- Solve problems with restrictions, starting with the "difficult" place
- Solve problems on choosing from several groups by combining the formulae with the addition and multiplication principles
- Check an answer by another method or by an estimate
Key terms
- Permutations
- Arrangements
- Combinations
- Restriction in a problem
- Addition principle
- Multiplication principle
- Round-robin tournament
- Diagonal of a polygon
First slides
All 15 slides and the teacher’s script are in the workspace
Lesson plan
- Revising the formulae P, A, C4 min
- The plan and problems with restrictions14 min
- Practice: combinatorial problems14 min
- Check test10 min
- Summary and homework3 min
Sample test questions
In how many ways can 4 pupils be seated on 4 chairs?
- 24
- 16
- 4
- 10
How many three-digit numbers can be made from the digits 1, 2, 3, 4, 5 if no digit is repeated?
Ready to teach this lesson?
Open the lesson for freeFull access to all features · No Card, No Auto-renewal