Permutations and Combinations Explained
Permutations and combinations are methods of counting arrangements and selections. Permutations count ordered arrangements where order matters. Combination
TL;DR: Permutations and combinations are methods of counting arrangements and selections. Permutations count ordered arrangements where order matters. Combin…
Written & reviewed by the Syllab.in Academic Team (CBSE/NCERT subject experts) · Updated
Permutations and Combinations: Permutations and combinations are methods of counting arrangements and selections. Permutations count ordered arrangements where order matters. Combination
Permutations and Combinations Explained Simply
Permutations and combinations are methods of counting arrangements and selections. Permutations count ordered arrangements where order matters. Combination This is a key Mathematics concept for Class 11.
Fundamental Counting Principle
If an event can occur in m ways and another independent event can occur in n ways, then both events can occur in m × n ways. Example: Choosing shirt (3 options) and pants (4 options) gives 3 × 4 = 12 combinations. This principle extends to multiple events: If events A, B, C can occur in m, n, p ways respectively, then total ways = m × n × p. This is the foundation for permutations and combinations.
Permutations
Permutation is an ordered arrangement of objects. Number of permutations of n objects taken r at a time: P(n, r) or nPr = n! / (n - r)!. Example: Arranging 3 out of 5 books in a row: 5P3 = 5! / (5-3)! = 5! / 2! = 120 / 2 = 60. Special case: n! = n × (n-1) × (n-2) × ... × 1. For all n objects: nPn = n!. Permutations are used when the order matters (passwords, rankings, arrangements).
Combinations
Combination is a selection of objects where order does not matter. Number of combinations of n objects taken r at a time: C(n, r) or nCr = n! / [r!(n - r)!]. Example: Choosing 3 out of 5 books (not arranging): 5C3 = 5! / (3! × 2!) = 120 / (6 × 2) = 10. Relationship: nCr = nP(n - r) = nP(n - r). Combinations are used when order does not matter (selecting team members, choosing lottery numbers).
Relationship Between Permutations and Combinations
nPr = nCr × r! (Arranging is selecting then arranging) or nPr = r! × nCr. Example: 5P3 = 60 = 5C3 × 3! = 10 × 6 = 60. This relationship shows that permutations equal combinations multiplied by the number of arrangements. Special properties: nCr = nC(n-r) (symmetry), nCn = 1, nC0 = 1, nC1 = n.
Applications and Problem Solving
Permutation examples: Arranging people in a line, forming passwords, ranking teams, distributing distinct items. Combination examples: Selecting committee members, choosing lottery numbers, distributing identical items, forming groups. Problems may involve restrictions like 'certain person must be included' or 'certain arrangement must be avoided'. In such cases, count favorable cases and subtract unfavorable cases, or use conditional counting.
Binomial Coefficient and Pascal's Triangle
Binomial coefficient C(n, r) appears in binomial expansion (a + b)^n = Σ C(n, r) × a^(n-r) × b^r. Pascal's triangle displays binomial coefficients: each entry is the sum of two entries above it. Row n contains C(n, 0), C(n, 1), ..., C(n, n). The sum of row n equals 2^n (C(n, 0) + C(n, 1) + ... + C(n, n) = 2^n).
Worked Examples
Example 1. In how many ways can 5 friends be arranged in a row?
Solution: This is a permutation problem where we arrange all 5 distinct objects.
n = 5, r = 5
Number of arrangements = 5! = 5 × 4 × 3 × 2 × 1 = 120 ways
Or using formula nPr = n!/(n-r)!
5P5 = 5!/(5-5)! = 5!/0! = 120/1 = 120 ways
Example 2. In how many ways can a committee of 3 people be formed from 8 people?
Solution: This is a combination problem (order doesn't matter in a committee).
n = 8, r = 3
Using formula nCr = n! / [r!(n-r)!]
8C3 = 8! / (3! × 5!)
8C3 = (8 × 7 × 6 × 5!) / (3! × 5!)
8C3 = (8 × 7 × 6) / (3 × 2 × 1)
8C3 = 336 / 6
8C3 = 56 ways
Example 3. How many 4-digit numbers can be formed using digits 1, 2, 3, 4, 5 if (a) repetition is allowed, (b) repetition is not allowed?
Solution: (a) Repetition allowed:
Using fundamental counting principle:
- First digit: 5 choices
- Second digit: 5 choices (can repeat any)
- Third digit: 5 choices
- Fourth digit: 5 choices
Total = 5 × 5 × 5 × 5 = 625 numbers
(b) Repetition not allowed:
This is permutation of 5 taken 4 at a time.
5P4 = 5! / (5-4)! = 5! / 1! = 120 numbers
Or using counting principle:
- First digit: 5 choices
- Second digit: 4 choices (1 already used)
- Third digit: 3 choices (2 already used)
- Fourth digit: 2 choices (3 already used)
Total = 5 × 4 × 3 × 2 = 120 numbers
Where You See This in Real Life
- Indian lottery systems use combinations to calculate odds. Lottery winning number selection uses combinations since the order of selection does not matter.
- Cricket teams in India use permutations and combinations to analyze batting orders (permutation) and select 11 players from 15 available (combination).
- Password creation uses permutations to determine the number of possible passwords of given length from a character set.
- Indian schools use combinations to form groups or committees and permutations to arrange students in lines or seats.
Common Mistakes Students Make
- Confusing permutations with combinations. If order matters, use permutations; if not, use combinations.
- Forgetting to use the division by r! in combinations. Many students compute n!/(n-r)! which gives permutations, not combinations.
- Not reducing the problem correctly for restrictions. When a person 'must be included', include them and count arrangements of remaining.
- Assuming repetition is always not allowed. Read the problem carefully; repetition may or may not be allowed.
Frequently Asked Questions
What is the difference between arranging 3 people in 3 seats vs. selecting 3 people from 5?
Arranging 3 specific people in 3 seats uses permutation formula. Selecting 3 from 5 uses combination formula because selection does not depend on order. If we then arrange the 3 selected people, we multiply combination by permutation.
Why does n! include 0! = 1?
0! = 1 by definition, which makes many formulas work correctly. It represents one way to arrange zero objects (doing nothing). This definition ensures formulas like nPn = n! and nCn = 1 remain consistent.
When solving a problem, how do I know if I should use permutation or combination?
Ask yourself: Does the order in which I select or arrange matter? If YES, use permutation (nPr). If NO, use combination (nCr). Example: Seating order matters (permutation); committee selection doesn't (combination).