Skip to content
My Docs

14_Permutations___Combinations

Permutations & Combinations - Aptitude Mastery Guide

Section titled “Permutations & Combinations - Aptitude Mastery Guide”

Category: Quantitative Aptitude
Generated on: 2025-07-15 09:19:53
Source: Aptitude Mastery Guide Generator

Permutations & Combinations: A Master Guide

Section titled “Permutations & Combinations: A Master Guide”

This guide provides a comprehensive overview of Permutations and Combinations, a fundamental topic in quantitative aptitude. We’ll delve into the core concepts, equip you with powerful tricks and shortcuts, and provide ample examples and practice problems to solidify your understanding. This guide is designed to be your go-to resource for tackling permutation and combination problems in competitive exams and placement tests.

1. Foundational Concepts

Section titled “1. Foundational Concepts”

Permutations: A permutation refers to the arrangement of objects in a specific order. The order is crucial. Changing the order creates a different permutation. Think of arranging letters in a word, or the order in which people finish a race.

Combinations: A combination refers to the selection of objects, where the order does not matter. Think of choosing a team of people from a larger group, or selecting ingredients for a salad. The same ingredients in a different order still result in the same salad.

The Fundamental Counting Principle: This principle is the bedrock of both permutations and combinations. It states that if there are ‘m’ ways to do one thing and ‘n’ ways to do another, then there are m * n ways to do both. This can be extended to any number of events.

Why the Formulas Work:

  • Permutation (nPr): When arranging ‘r’ objects from a set of ‘n’ distinct objects, we have ‘n’ choices for the first position, ‘n-1’ choices for the second, ‘n-2’ for the third, and so on, until we have ‘n-r+1’ choices for the ‘r’th position. This gives us n * (n-1) * (n-2) * … * (n-r+1), which can be expressed as n! / (n-r)!. The (n-r)! in the denominator removes the arrangements of the remaining (n-r) objects that we didn’t select.
  • Combination (nCr): When selecting ‘r’ objects from a set of ‘n’ distinct objects, we first calculate the number of permutations (nPr) as if order mattered. However, since order doesn’t matter, we need to divide by the number of ways to arrange the ‘r’ selected objects, which is r!. This removes the redundancy caused by different orderings of the same selection. Hence, nCr = nPr / r! = n! / (r! * (n-r)!).

2. Key Tricks & Shortcuts

Section titled “2. Key Tricks & Shortcuts”

  • Trick 1: “Gaps” or “Spacing” Method (For arranging objects with restrictions)

    • How it works: If you need to arrange objects where certain objects must be separated, first arrange the other objects. Then, create “gaps” between these arranged objects (including the ends). The restricted objects can then be placed in these gaps.
    • When to use: Problems where you need to keep certain objects apart (e.g., “No two girls should sit together”).
    • Example: Arrange 4 boys and 3 girls such that no two girls sit together. Arrange the 4 boys (4! ways). This creates 5 gaps (before, between, and after the boys). Choose 3 of these 5 gaps for the girls to sit in (5C3 ways). Arrange the girls in those gaps (3! ways). Total arrangements: 4! * 5C3 * 3!

  • Trick 2: “Tie Together” Method (For arranging objects that must be together)

    • How it works: If certain objects must always be together, treat them as a single unit. Arrange this unit along with the other objects. Then, arrange the objects within the unit.
    • When to use: Problems where you need to keep certain objects grouped (e.g., “Two particular books must always be next to each other”).
    • Example: Arrange 5 books, where 2 specific books must be together. Treat the 2 books as one unit. Now you have 4 units to arrange (3 individual books + 1 unit). This can be done in 4! ways. The 2 books within the unit can be arranged in 2! ways. Total arrangements: 4! * 2!

  • Trick 3: Complementary Counting (Indirect Method)

    • How it works: Sometimes, it’s easier to calculate the number of ways something cannot happen and subtract that from the total number of possibilities.
    • When to use: Problems where direct calculation is complex, but calculating the opposite scenario is simpler (e.g., “At least one girl is selected”).
    • Formula: Total Possibilities - Unfavorable Possibilities = Favorable Possibilities
    • Example: Find the number of ways to select a team of 5 people from 7 boys and 4 girls, such that at least one girl is selected. Total ways to select 5 people: 11C5. Ways to select 5 people with no girls: 7C5. Ways to select 5 people with at least one girl: 11C5 - 7C5.

  • Trick 4: Dividing by Identical Objects (Dealing with Repetition)

    • How it works: If you have ‘n’ objects, where ‘p’ are of one kind, ‘q’ are of another kind, and so on, the number of distinct arrangements is n! / (p! * q! * …).
    • When to use: Problems involving arranging letters in a word where some letters are repeated (e.g., “How many different arrangements are possible with the letters of the word ‘MISSISSIPPI’?”).
    • Example: The word “MISSISSIPPI” has 11 letters: M (1), I (4), S (4), P (2). Number of arrangements: 11! / (1! * 4! * 4! * 2!).

  • Trick 5: Handshake Lemma

    • How it works: If ‘n’ people shake hands with each other, the total number of handshakes is nC2 = n(n-1)/2.
    • When to use: Problems directly involving handshakes or situations analogous to handshakes (e.g., connecting points with lines).

  • Trick 6: Vedic Maths - Base Method (For Multiplication - useful in factorial calculations)

    • How it works: Choose a base close to the numbers you’re multiplying. Calculate the difference between each number and the base. Multiply the differences. Add one of the differences to the other number. Combine the results. Adjust for the base if needed.
    • When to use: Multiplication of numbers close to each other (e.g., 11 * 12, 19 * 21). Can speed up factorial calculations when breaking down the product.
    • Example: 12 * 13 (Base = 10)
      • 12 is 2 more than 10 (+2)
      • 13 is 3 more than 10 (+3)
      • 2 * 3 = 6
      • 12 + 3 = 15 (or 13 + 2 = 15)
      • Result: 156

  • Trick 7: Percentage to Fraction Conversion

    • How it works: Convert percentages to fractions for easier calculation, especially when dealing with combinations involving probabilities (which often involve division).
    • When to use: Problems that involve probabilities and combinations.
    • Example: Instead of calculating 25% of 8C2, convert 25% to 1/4 and then calculate (1/4) * 8C2.

3. Essential Formulas & Rules

Section titled “3. Essential Formulas & Rules”
Formula/RuleDescription
n! (n Factorial)n! = n * (n-1) * (n-2) * … * 2 * 1 (0! = 1)
nPr (Permutation)Number of ways to arrange ‘r’ objects from a set of ‘n’ distinct objects, where order matters: nPr = n! / (n-r)!
nCr (Combination)Number of ways to select ‘r’ objects from a set of ‘n’ distinct objects, where order doesn’t matter: nCr = n! / (r! * (n-r)!)
nCn = 1There’s only one way to choose all ‘n’ objects from a set of ‘n’ objects.
nC0 = 1There’s only one way to choose zero objects (choosing nothing).
nCr = nC(n-r)Selecting ‘r’ objects is the same as rejecting (n-r) objects. This can simplify calculations when ‘r’ is close to ‘n’.
nCr + nC(r+1) = (n+1)C(r+1)Pascal’s Identity: Used to build Pascal’s Triangle and can simplify combination calculations in certain scenarios.
Permutation of n objects where p are alike and q are aliken! / (p! * q!)
Circular Permutation (n distinct objects)(n-1)!
Circular Permutation (n distinct objects, clockwise and counterclockwise considered same)(n-1)!/2

4. Detailed Solved Examples

Section titled “4. Detailed Solved Examples”

Example 1: Basic Permutation (Arrangement of Letters)

  • Problem: How many different arrangements are possible with the letters of the word “MATH”?
  • Solution:
    • There are 4 distinct letters.
    • We need to arrange all 4 letters.
    • This is a permutation problem because the order matters.
    • Using the formula nPr = n! / (n-r)!, where n = 4 and r = 4, we get: 4P4 = 4! / (4-4)! = 4! / 0! = 4 * 3 * 2 * 1 / 1 = 24
    • Answer: There are 24 different arrangements.

Example 2: Combination with Restriction (Team Selection)

  • Problem: A committee of 5 people needs to be formed from a group of 6 men and 4 women. What is the probability that the committee contains exactly 3 men and 2 women?
  • Solution:
    • Total number of ways to choose 5 people from 10: 10C5 = 10! / (5! * 5!) = 252
    • Number of ways to choose 3 men from 6: 6C3 = 6! / (3! * 3!) = 20
    • Number of ways to choose 2 women from 4: 4C2 = 4! / (2! * 2!) = 6
    • Number of ways to choose 3 men and 2 women: 6C3 * 4C2 = 20 * 6 = 120
    • Probability = (Favorable Outcomes) / (Total Possible Outcomes) = 120 / 252 = 10/21
    • Answer: The probability is 10/21.

Example 3: “Tie Together” Method (Arranging Books)

  • Problem: In how many ways can 6 books be arranged on a shelf if 3 particular books must always be together?
  • Solution:
    • Treat the 3 particular books as a single unit.
    • Now we have 4 units to arrange (3 individual books + 1 unit of 3 books). This can be done in 4! = 24 ways.
    • The 3 books within the unit can be arranged in 3! = 6 ways.
    • Total arrangements: 4! * 3! = 24 * 6 = 144
    • Answer: There are 144 possible arrangements.

Example 4: Complementary Counting (At Least One)

  • Problem: A bag contains 5 red balls and 4 blue balls. In how many ways can 3 balls be drawn such that at least one ball is red?
  • Solution:
    • Total number of ways to draw 3 balls from 9: 9C3 = 9! / (3! * 6!) = 84
    • Number of ways to draw 3 balls with no red balls (i.e., all 3 are blue): 4C3 = 4! / (3! * 1!) = 4
    • Number of ways to draw 3 balls with at least one red ball: 9C3 - 4C3 = 84 - 4 = 80
    • Answer: There are 80 ways.

5. Practice Problems (Graded Difficulty)

Section titled “5. Practice Problems (Graded Difficulty)”

[Easy] How many different committees of 3 people can be formed from a group of 8 people?

[Easy] In how many ways can the letters of the word “SIMPLE” be arranged?

[Medium] A box contains 6 red balls and 4 white balls. In how many ways can 4 balls be chosen such that there are 2 balls of each color?

[Medium] In how many ways can 5 men and 4 women be seated in a row so that the women occupy the even places?

[Hard] How many different 4-digit numbers can be formed using the digits 1, 2, 3, 4, 5, 6, 7, 8, and 9 if no digit is repeated and the number must be divisible by 5?

[Hard] A group of 6 students wants to sit around a circular table. Two particular students refuse to sit next to each other. In how many ways can they be seated?

[Medium-Hard] There are 10 points in a plane, no three of which are collinear. How many straight lines can be formed by joining these points? How many triangles can be formed by joining these points?

6. Advanced/Case-Based Question

Section titled “6. Advanced/Case-Based Question”

A company has 7 software engineers, 5 data scientists, and 3 project managers. They need to form a team of 6 people for a new project with the following constraints:

  • The team must have at least 2 software engineers.
  • The team must have at least 1 data scientist.
  • The team must have at least 1 project manager.
  • No more than 3 software engineers can be on the team.

How many different team compositions are possible?