Class 11 – Permutations & Combinations (Lecture Notes)
1. Warm-Up & Motivation (5 min)
Start with a relatable question:
“If you have 3 different ice cream flavours and 2 cones, how many different ice cream cones
can we make if the order of scoops matters? What if the order doesn’t matter?”
Students will naturally see the difference between “order matters” (permutation) and
“order doesn’t matter” (combination) before you even define them.
2. Pre-knowledge Recap
Before diving in, ensure they know:
• Fundamental Principle of Counting (FPC)
- Multiplication Rule: If a task can be done in m ways and another in n ways, then
both together = m × n ways.
- Addition Rule: If a task can be done in m ways or n ways (mutually exclusive),
then total = m + n ways.
• Factorials
- n! = n × (n-1) × ... × 2 × 1
- Special case: 0! = 1
3. Permutations – Concept
Definition: A permutation is an arrangement of objects in a specific order.
Formula: ^nP_r = n! / (n-r)!
Where: n = total objects, r = objects selected & arranged
Special cases:
• ^nP_n = n!
• ^nP_0 = 1
Examples to teach:
1. 1. Arranging 3 people out of 5 in a row.
2. 2. 4-letter “words” from “MATH” without repetition.
4. Combinations – Concept
Definition: A combination is a selection of objects where the order does not matter.
Formula: ^nC_r = n! / (r! (n-r)!)
Relation with permutations: ^nP_r = ^nC_r × r!
Examples to teach:
3. 1. Choosing 2 players from a team of 11.
4. 2. Selecting 3 books from 10 for reading.
5. Difference Table
Feature Permutations Combinations
Order Matters Doesn’t matter
Formula ^nP_r = n! / (n-r)! ^nC_r = n! / (r!(n-r)!)
Example Positions in a race Choosing a race team
6. Variations & Special Cases
5. 1. With repetition allowed:
- Permutations: n^r
- Combinations: ^{n+r-1}C_r
6. 2. Identical objects:
- n! / (p! q! r! ...)
7. 3. Circular permutations:
- (n-1)! (distinct items in a circle)
- If reversible (necklaces): (n-1)! / 2
7. Step-by-Step Problem Solving Strategy
8. 1. Understand if order matters → Decide P or C.
9. 2. Check repetition allowed or not.
10. 3. Look for restrictions → together/apart, start with certain digits, etc.
11. 4. Break into stages → Apply FPC.
12. 5. Solve & simplify factorials.
8. Board-level Examples
Example 1: How many 4-digit numbers can be formed from digits 1–7 without repetition?
Solution: ^7P_4 = 7! / 3! = 840
Example 2: How many committees of 3 men and 2 women can be formed from 6 men and 4
women?
Solution: ^6C_3 × ^4C_2 = 20 × 6 = 120
9. Common Mistakes to Address
• Using permutation when order doesn’t matter.
• Forgetting to multiply by r! when converting C to P.
• Not applying restrictions correctly.
• Factorial calculation errors.
10. Quick Practice Questions
13. 1. How many 3-digit numbers can be formed from digits 1–5 if repetition is allowed?
14. 2. How many ways to arrange “BALLOON”?
15. 3. How many different necklaces can be made using 5 different beads?
16. 4. In how many ways can 5 people sit around a round table?
17. 5. A committee of 4 is to be formed from 8 men and 6 women, with at least 2 women.
How many ways?
