Both Permutations and Combinations
are counting techniques used to determine how many ways selections or arrangements can be made from a set of objects.
| Concept | Use when |
|---|---|
| Permutation | Order matters |
| Combination | Order does NOT matter |
Permutations — (
)
Permutation is an arrangement of objects where order is important.
Example: Arranging students in a line, ranking winners, passwords.
Formula
where
- (n) = total number of objects
- (r) = number of objects selected
- (!) denotes factorial
Example 1: Simple Permutation
Question:
How many ways can 3 students be arranged from 5 students?
Solution:
✔ Order matters, so permutation is used.
Example 2: Letter Arrangement
Question:
How many 2-letter words can be formed from A, B, C?
Solution:
Possible arrangements:
AB, BA, AC, CA, BC, CB
Combinations — (
)
Combination is a selection of objects where order is not important.
Example: Selecting committee members, choosing lottery numbers.
Formula
Example 3: Simple Combination
Question:
How many ways can 3 students be chosen from 5 students to form a team?
Solution:
✔ Order does not matter, so combination is used.
Example 4: Comparing with Permutation
From A, B, C:
- Permutations of 2 letters = 6
- Combinations of 2 letters = 3
Combinations:
AB, AC, BC
Order like AB and BA are considered same.
Relationship Between
and 
This shows:
- A permutation is a combination arranged in all possible orders.
Practical Comparison Example
Question:
A class has 10 students.
(a) Choose a captain and vice-captain
Order matters → Permutation
(b) Choose 2 class representatives
Order does not matter → Combination
Key Properties of 
- Symmetry property
Example:
- Edge values
Summary
| Feature | ||
|---|---|---|
| Order matters | Yes | No |
| Used for | Arrangements | Selections |
| Formula | ||
| Example | Ranking, seating | Teams, committees |