admin Combinations, Identities, and Advanced Selection Techniques
Introduction
In Part 1, we explored permutations, where order matters. In this part, we shift our focus to combinations, where the order of selection does not matter.
Understanding this distinction is crucial. Many mistakes in exams and problem-solving arise from confusing permutations with combinations.
4. Combinations
What is a Combination?
A combination is a selection of objects where order does not matter.
For example, selecting students for a team:
- Choosing A, B, C is the same as B, A, C
- Only the group matters, not the arrangement
Formula for Combinations
Number of ways to select ( r ) objects from ( n ) objects:
[C(n, r) = \frac{n!}{r!(n – r)!}
]
Example 1
Select 2 students from 4 students: A, B, C, D
[C(4, 2) = \frac{4!}{2!2!} = 6
]
Possible selections:
- AB, AC, AD, BC, BD, CD
Key Insight
Permutation counts arrangements.
Combination counts selections.
Properties of Combinations
1. Symmetry Property
[C(n, r) = C(n, n – r)
]
This means selecting ( r ) items is the same as rejecting ( n – r ) items.
Example:
[C(5, 2) = C(5, 3) = 10
]
2. Boundary Values
- ( C(n, 0) = 1 )
- ( C(n, n) = 1 )
There is only one way to select nothing or everything.
3. Maximum Value
For a fixed ( n ), ( C(n, r) ) is maximum when ( r \approx n/2 )
Relation Between Permutation and Combination
The relationship is:
[P(n, r) = C(n, r) \times r!
]
This means:
- First select ( r ) objects (combination)
- Then arrange them (permutation)
Example
Arrange 2 students from 4:
[P(4, 2) = 12
] [
C(4, 2) = 6
] [
6 \times 2! = 12
]
5. Important Identities
1. Symmetry Identity
[C(n, r) = C(n, n – r)
]
Already discussed, very useful in simplification.
2. Pascal’s Identity
[C(n, r) = C(n-1, r) + C(n-1, r-1)
]
Example
[C(5, 2) = C(4, 2) + C(4, 1)
] [
10 = 6 + 4
]
This identity is the foundation of Pascal’s Triangle.
3. Summation Identity
[\sum_{r=0}^{n} C(n, r) = 2^n
]
Example
For ( n = 3 ):
[C(3,0) + C(3,1) + C(3,2) + C(3,3)
] [
= 1 + 3 + 3 + 1 = 8 = 2^3
]
7. Combinations with Conditions
Real-world problems often include restrictions. These are more advanced and important for exams.
7.1 Selection with Restrictions
Example
Select 3 students from 5 students, but A must always be included.
Solution:
- Fix A
- Choose remaining 2 from remaining 4
C(4, 2) = 6
]
Example (Exclusion)
Select 3 students from 5, but A is not allowed.
[C(4, 3) = 4
]
7.2 Selection with Repetition
When repetition is allowed:
[\text{Number of ways} = C(n + r – 1, r)
]
Example
Select 3 fruits from 2 types (Apple, Banana), repetition allowed.
[C(2 + 3 – 1, 3) = C(4, 3) = 4
]
Selections:
- AAA
- AAB
- ABB
- BBB
7.3 Distribution of Identical Objects
This is a classic application.
Example
Distribute 5 identical balls into 3 boxes.
[C(5 + 3 – 1, 5) = C(7, 5) = 21
]
Key Insight
- Identical objects + distinct boxes → combinations with repetition
- Distinct objects → simple combinations
Common Mistakes
- Using permutation instead of combination
- Ignoring restrictions in selection problems
- Forgetting repetition formulas
- Not simplifying factorial expressions properly
Final Thoughts
Combinations focus on selection, not arrangement. Once this idea is clear, many problems become straightforward.
The real challenge lies in identifying:
- whether order matters
- whether repetition is allowed
- whether restrictions are present
Recommendation
To understand these concepts in depth, learn from the Math By Series – Permutations and Combinations Book, available on Amazon. You can also explore a wide range of books under the Math By Rishabh Series and Mathematics Elevate Series for structured learning and advanced problem-solving.
