Permutation and Combination: Complete Master Guide for UPSC/MPSC CSAT (English)

Introduction to Permutation and Combination

Permutation and Combination is one of the most crucial and scoring topics in the CSAT (Civil Services Aptitude Test) for UPSC and MPSC examinations. This topic primarily deals with counting the number of ways certain events can occur without actually counting them one by one. Understanding the fundamental principles of counting, permutations (arrangements), and combinations (selections) is essential for solving complex problems efficiently.

In the context of the CSAT exam, questions from this section often test logical thinking and structural analysis rather than mere formula application. Mastering this topic not only helps in direct questions but also builds a strong foundation for Probability, another significant area in the syllabus.

Core Concepts and Formulas

1. Fundamental Principle of Counting

Multiplication Principle: If an event can occur in ‘m’ different ways and another independent event can occur in ‘n’ different ways, then the two events can occur in succession in ‘m × n’ ways.

Addition Principle: If an event can occur in ‘m’ ways and another event can occur in ‘n’ ways, and both events cannot occur simultaneously, then either of the events can occur in ‘m + n’ ways.

2. Factorial Notation

The product of the first ‘n’ natural numbers is denoted by n! (n factorial).
n! = n × (n – 1) × (n – 2) × … × 3 × 2 × 1
Note: 0! = 1 and 1! = 1.

3. Permutation (Arrangement)

Permutation refers to the different arrangements of a given number of things by taking some or all of them at a time. The order of arrangement is crucial here.

Formula: The number of permutations of ‘n’ different things taken ‘r’ at a time is given by ⁿP_r.
ⁿP_r = n! / (n – r)!

Important Cases:
1. Permutation of n things taken all at a time: ⁿP_n = n!
2. Circular Permutation: The number of circular arrangements of n different things is (n – 1)!
3. Permutations with Repetition: The number of permutations of n things, out of which p are alike of one kind, q are alike of another kind, and r are alike of a third kind, is given by: n! / (p! × q! × r!)

4. Combination (Selection)

Combination refers to the different selections of a given number of things by taking some or all of them at a time. The order of selection does not matter.

<

p class=”wp-block-paragraph”>Formula: The number of combinations of ‘n’ different things taken ‘r’ at a time is given by ⁿC_r.
ⁿC_r = n! / [r! × (n – r)!]

Important Properties:
1. ⁿC_r = ⁿC_n-r
2. ⁿC₀ = 1 and ⁿC_n = 1
3. ⁿC_r + ⁿC_r-1 = ⁿ⁺¹C_r

Tricks and Shortcuts

• Identifying Permutation vs. Combination: Ask yourself: “Does the order matter?” If YES (like passwords, seating arrangements, making words), it’s Permutation. If NO (like forming a committee, selecting a team, drawing cards), it’s Combination.
• The ‘Tie-String’ Method for “Together” problems: When certain items must always be together, consider them as one single unit (tie them with a string). Calculate arrangements, and then multiply by the internal arrangements of the tied items.
• The ‘Gap’ Method for “Never Together” problems: To arrange items where certain items must not be together, first arrange the other items, create ‘gaps’ between them, and place the restricted items in those gaps.

Solved Examples

Example 1: Word Formation (Permutation with repetition)

Question: In how many different ways can the letters of the word ‘ASSASSINATION’ be arranged?

Step-by-step Solution:
1. Count the total number of letters: The word has 13 letters.
2. Identify the repetitions:
– A appears 3 times
– S appears 4 times
– I appears 2 times
– N appears 2 times
– T and O appear 1 time each.
3. Apply the formula for permutations with repetition:
Total ways = n! / (p! × q! × r! …)
Total ways = 13! / (3! × 4! × 2! × 2!)
4. Let’s simplify (though in exams, large calculations are often left in factorial form or simplified options are given):
= (13 × 12 × 11 × 10 × 9 × 8 × 7 × 6 × 5 × 4!) / (6 × 4! × 2 × 2)
= 10,810,800 ways.

Example 2: Committee Formation (Combination)

Question: A committee of 5 members is to be formed out of 6 men and 4 women. In how many ways can the committee be formed so that it has exactly 2 women?

Step-by-step Solution:
1. Understand the requirement: The committee needs 5 members total. We must select exactly 2 women. Therefore, we must select 3 men.
2. Calculate ways to select women: We need 2 women out of 4.
Ways = ⁴C₂ = 4! / (2! × 2!) = (4 × 3) / (2 × 1) = 6 ways.
3. Calculate ways to select men: We need 3 men out of 6.
Ways = ⁶C₃ = 6! / (3! × 3!) = (6 × 5 × 4) / (3 × 2 × 1) = 20 ways.
4. Apply the multiplication principle (since both selections must happen):
Total ways = 6 × 20 = 120 ways.

Example 3: Items “Always Together”

Question: In how many ways can 5 boys and 3 girls be seated in a row such that all the girls always sit together?

Step-by-step Solution:
1. Use the ‘Tie-String’ Method. Since all 3 girls must sit together, treat them as a single unit (G1-G2-G3).
2. Now, we have 5 boys + 1 “girl unit” = 6 entities to arrange.
3. These 6 entities can be arranged in 6! ways = 720 ways.
4. The 3 girls within their single unit can swap places among themselves in 3! ways = 6 ways.
5. Total arrangements = 6! × 3! = 720 × 6 = 4320 ways.

Example 4: Items “Never Together”

Question: In how many ways can 4 boys and 3 girls be seated in a row such that no two girls sit together?

Step-by-step Solution:
1. Use the ‘Gap’ Method. To ensure no two girls are together, first seat the 4 boys.
2. The 4 boys can be seated in 4! ways = 24 ways.
Arrangement: _ B _ B _ B _ B _
3. This creates 5 ‘gaps’ (represented by underscores) where the 3 girls can sit.
4. The 3 girls need to be placed in these 5 gaps. We select 3 gaps and arrange the girls, which is ⁵P₃.
⁵P₃ = 5! / 2! = (5 × 4 × 3) = 60 ways.
5. Total arrangements = 24 × 60 = 1440 ways.

Pro-Tips to Avoid Common Mistakes

• Don’t confuse Permutation and Combination: Read the question carefully. “Arranging books on a shelf” is Permutation. “Selecting books to read” is Combination.
• Remember ‘AND’ vs ‘OR’: In counting, ‘AND’ almost always means MULTIPLY (×), while ‘OR’ means ADD (+). E.g., Selecting a boy AND a girl = multiplication. Selecting a boy OR a girl = addition.
• Factorial of Zero: Never forget that 0! = 1. Many students mistakenly take it as 0, which ruins the calculation for boundary cases like ⁿC_n.
• Check for identical items: In word problems (like ‘APPLE’), always check if letters repeat and divide the total factorial by the factorial of repeated letters.

Practice Questions

1. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed?
2. In a party, every person shakes hands with every other person. If there are a total of 105 handshakes, how many persons were present at the party?
3. How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9, which are divisible by 5 and none of the digits is repeated?
4. A bag contains 2 white shirts, 3 black shirts, and 4 red shirts. In how many ways can 3 shirts be drawn from the bag, if at least one black shirt is to be included in the draw?
5. In how many ways can the letters of the word ‘DIRECTOR’ be arranged so that the vowels are always together?

Answers: 1. 25200; 2. 15; 3. 20; 4. 64; 5. 2160.