Permutations and Combinations
Permutations and combinations are counting techniques used to find the number of ways a set of objects can be arranged or selected. The Fundamental Princip...
Counting Principles: Permutations and Combinations
Permutations and combinations are counting techniques used to find the number of ways a set of objects can be arranged or selected. The Fundamental Principle of Counting (Multiplication Principle) states: if one event can occur in m ways and a second independent event can occur in n ways, then both events can occur in m x n ways. The Addition Principle: if one event can occur in m ways or another mutually exclusive event in n ways, then one of the two events can occur in m + n ways.
The factorial of a positive integer n (written n!) is the product of all positive integers from 1 to n: n! = n x (n-1) x (n-2) x ... x 2 x 1. For example, 5! = 5 x 4 x 3 x 2 x 1 = 120. By definition, 0! = 1. Factorials grow very rapidly: 10! = 3,628,800.
A permutation is an arrangement of objects where order matters. The number of permutations of n distinct objects taken r at a time is: P(n,r) = nPr = n! / (n-r)!. For example, the number of ways to arrange 3 objects out of 5 = 5P3 = 5!/2! = 60. The number of permutations of n objects taken all at a time = n!. For permutations with repetition allowed, the count is n^r. For permutations of objects where some are identical: if there are n objects with p identical objects of one kind, q of another, etc., the number of distinct arrangements = n!/(p! x q! x ...).
A combination is a selection of objects where order does not matter. The number of combinations of n distinct objects taken r at a time is: C(n,r) = nCr = n! / (r! x (n-r)!). Important properties: nCr = nC(n-r) (symmetry); nCr + nC(r-1) = (n+1)Cr (Pascal's identity); nC0 = nCn = 1; nC1 = n. The Binomial Theorem uses combinations: (a+b)^n = sum from r=0 to n of [nCr x a^(n-r) x b^r].
Applications: In how many ways can a committee of 3 be chosen from 10 people? Answer: 10C3 = 10!/(3! x 7!) = 120. In how many ways can the letters of the word MATHEMATICS be arranged? MATHEMATICS has 11 letters with M appearing 2 times, A appearing 2 times, T appearing 2 times. Number of arrangements = 11!/(2! x 2! x 2!) = 39,916,800/8 = 4,989,600.
Worked Example: A student must choose 4 questions out of 7, but question 1 is compulsory. How many ways can the student choose? Since question 1 is fixed, the student must choose 3 more from the remaining 6 questions. Number of ways = 6C3 = 6!/(3! x 3!) = 720/(6 x 6) = 20 ways.
CBSE Exam Tip: Clearly distinguish when a problem requires permutations (order matters, e.g., arranging books on a shelf, forming numbers from digits) versus combinations (order does not matter, e.g., forming committees, selecting teams). The restriction problems (e.g., always include/exclude certain items, items together/apart) need careful case-by-case counting. Practice both types extensively for Class 11.