Permutation and Combination – Logical Reasoning Study Notes

The Fundamental Counting Principle

At the heart of all counting problems lies the Fundamental Counting Principle. If one task can be performed in ‘m’ ways and a second task can be performed in ‘n’ ways, then the two tasks together can be performed in ‘m × n’ ways. This is often referred to as the Multiplication Rule.

For example, if you have 3 shirts and 4 trousers, you have 3 × 4 = 12 possible outfits. This rule extends to any number of tasks. The Addition Rule, conversely, applies when tasks are mutually exclusive; if you can choose from ‘m’ items of one type or ‘n’ items of another, you have ‘m + n’ ways to make a single selection.

Understanding Permutations (Arrangements)

A Permutation is an ordered arrangement of objects. When we talk about “arranging” books on a shelf, seating people in a row, or forming numbers from digits, the order is critical. The formula for the number of permutations of ‘n’ distinct objects taken ‘r’ at a time is denoted by nPr.

Formula: P(n, r) = n! / (n – r)!
Where n! (n factorial) is the product of all positive integers up to n. Note that 0! = 1.

When all objects are distinct, the number of ways to arrange ‘n’ objects is simply n!. If some objects are identical, we must divide by the factorial of the frequency of those repeating items to avoid overcounting. For instance, the number of ways to arrange the letters in the word “APPLE” is 5! / 2! because the letter ‘P’ repeats twice.

Mastering Combinations (Selections)

A Combination is a selection where the order of elements does not matter. If you are picking a committee of 3 people from a group of 10, it does not matter who is picked first; the group remains the same. This is denoted by nCr.

Because the order is irrelevant in combinations, we divide the permutation formula by the number of ways the selected items can be rearranged among themselves (r!). This gives us the standard combination formula:

• nCr = n! / [r! * (n – r)!]
• This can also be written as nCr = nPr / r!

A vital property to remember for exams is nCr = nC(n-r). This symmetry property significantly reduces calculation time. For example, calculating 10C8 is identical to calculating 10C2, which is much simpler.

Circular Permutations and Special Cases

Arranging items in a circle changes the dynamics because there is no fixed “starting” position. In a linear arrangement, 5 people can be seated in 5! ways. However, in a Circular Permutation, we fix one person to break the symmetry, meaning 5 people can be arranged in (n – 1)! ways.

Another common exam scenario involves seating arrangements where certain people must sit together. In such cases, we “bundle” the required individuals into a single unit and treat them as one object, then multiply by the internal arrangements of that bundle.

Important Facts and Formulas

Previous Year Question Hints

• Committee Selection: UPSC often tests committee formation. Remember: “At least one man/woman” problems are best solved using the Total – Complement method (Total ways – ways with no men).
• Number Formation: When forming digits, check if repetition is allowed. If “repetition is allowed,” use powers (e.g., n^r); if “repetition is not allowed,” use factorials or the slot method.

Quick Revision Summary

• Factorial Basics: Remember that n! = n × (n-1) × … × 1.
• Order matters? Use Permutations (P).
• Order irrelevant? Use Combinations (C).
• Circular Symmetry: Always use (n-1)! for circular arrangements.
• Symmetry Rule: nCr = nC(n-r) is your best friend for large ‘r’ values.
• Complementary Counting: Use 1 – P(event does not happen) for “at least one” scenarios.
• Identical Items: Divide by the factorial of the count of repeating items.
• Fundamental Principle: Multiply for “AND” conditions, add for “OR” conditions.