Probability and Permutation-Combination: Complete Guide for Competitive Exams

Probability permutation and combination complete guide for Banking SSC CGL and CAT
Advertisement

Probability and permutation–combination (P&C) is the one topic in competitive exam mathematics where candidates either score full marks or lose every question. There is rarely a middle ground — and the reason is simple. Most candidates either understand the underlying counting logic or they do not. Those who rely purely on formula memorization without understanding when to apply each formula consistently make wrong choices under exam pressure.

This guide fixes that. Every formula here comes with the trigger — the exact condition in the question that tells you which formula to use. Every worked example shows not just the calculation, but the decision-making process: why this formula and not that one.

In SSC CGL Tier 2, P&C and probability contribute $4\text{–}6$ questions. In CAT, modern math accounts for $2\text{–}3$ questions. In IBPS PO Mains, probability appears in $2\text{–}3$ questions (with occasional single questions in Prelims).

Part 1: The Counting Foundation — Before Any Formula

Every P&C problem is a counting problem. Before applying any formula, answer two questions:

Question 1 — Does order matter?

  • If YES $\rightarrow$ use Permutation (arrangement: e.g., $AB \neq BA$)

  • If NO $\rightarrow$ use Combination (selection: e.g., $\{A, B\} = \{B, A\}$)

Question 2 — Are repetitions allowed?

  • If YES $\rightarrow$ use the $n^r$ formula

  • If NO $\rightarrow$ use standard P&C formulas ($^nP_r$ or $^nC_r$)

The Fundamental Counting Principle

If Task 1 can be done in $m$ ways and Task 2 can be done in $n$ ways, then both tasks together can be done in $m \times n$ ways.

Worked Example 1:

A person has $4$ shirts and $3$ trousers. How many outfits can he make?

$$\text{Outfits} = 4 \times 3 = 12$$

Addition vs. Multiplication Rule

  • Multiply ($\times$) when tasks are done together (AND condition — both must happen).

  • Add ($+$) when tasks are alternatives (OR condition — either one happens).

Worked Example 2:

A student can travel from A to B by $3$ buses or $2$ trains. How many ways?

$$\text{Ways} = 3 + 2 = 5 \quad (\text{OR condition})$$

Worked Example 3:

From A to B there are $3$ buses, and from B to C there are $4$ trains. Total ways to go from A to C?

$$\text{Ways} = 3 \times 4 = 12 \quad (\text{AND condition})$$

Part 2: Permutations — Arrangements Where Order Matters

The Core Formula

$$^nP_r = \frac{n!}{(n - r)!}$$

Factorial values to memorize:

  • $0! = 1$

  • $1! = 1$

  • $2! = 2$

  • $3! = 6$

  • $4! = 24$

  • $5! = 120$

  • $6! = 720$

  • $7! = 5,040$

  • $8! = 40,320$ (useful bonus for CAT & SSC Tier 2)

Worked Example 4 — Basic Permutation:

In how many ways can $4$ students be arranged from a group of $7$?

$$^7P_4 = 7 \times 6 \times 5 \times 4 = 840$$

Shortcut: $^nP_r = n \times (n - 1) \times (n - 2) \times \cdots \text{ (up to } r \text{ terms)}$

Worked Example 5 — All Items Arranged:

In how many ways can $5$ people sit in $5$ chairs?

$$^5P_5 = 5! = 120$$

Permutation with Restrictions

Rule 1 — Fixed Position

Fix the restricted items in their required spots first, then arrange the rest.

Worked Example 6:

$6$ people in a row, $2$ specific people must sit at the ends.

  • Step 1: Fix $2$ people at the two ends $= 2! = 2\text{ ways}$

  • Step 2: Arrange the remaining $4$ people in the middle $= 4! = 24\text{ ways}$

  • Total:

    $$2 \times 24 = 48$$

Rule 2 — Items That Must Stay Together (String / Bundle Method)

Tie the restricted items together and treat them as one single unit.

Worked Example 7:

$5$ people in a row, $2$ specific people must always sit together.

  • Step 1: Treat the $2$ people as $1$ unit $\rightarrow$ arrange $(5 - 2 + 1) = 4$ units $= 4! = 24\text{ ways}$

  • Step 2: Those $2$ people arrange among themselves $= 2! = 2\text{ ways}$

  • Total:

    $$24 \times 2 = 48$$

Rule 3 — Items That Must Never Be Together

  • When $2$ specific items must never be together: Use $\text{Total} - (\text{Together arrangements})$.

Worked Example 8:

$5$ people in a row, $2$ specific people must never sit together.

$$\text{Total} = 5! = 120$$

$$\text{Together} = 4! \times 2! = 48$$

$$\text{Answer} = 120 - 48 = 72$$

  • Exam Extension — The Gap Method (When $3$ or more items must never be together): If $5$ boys and $3$ girls sit in a row such that no two girls sit together, arrange the $5$ boys first ($5!$ ways). This creates $6$ gaps ($\_ B \_ B \_ B \_ B \_ B \_$). Choose $3$ gaps for the girls and arrange them:

    $$5! \times {^6P_3} = 120 \times 120 = 14,400$$

Part 3: Combinations — Selections Where Order Does Not Matter

The Core Formula

$$^nC_r = \frac{n!}{r! \times (n - r)!}$$

Key Properties:

  • $^nC_0 = 1$

  • $^nC_1 = n$

  • $^nC_n = 1$

  • $^nC_r = {^nC_{n-r}}$ (symmetry property — saves massive calculation time)

  • $^nC_r + {^nC_{r+1}} = {^{n+1}C_{r+1}}$ (Pascal's Identity)

Worked Example 9 — Basic Combination:

In how many ways can a committee of $3$ be formed from $8$ people?

$$^8C_3 = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = \frac{336}{6} = 56$$

Worked Example 10 — Combination with Condition ("At Least"):

Form a committee of $5$ from $6$ men and $4$ women such that there are at least $2$ women.

  • Exactly $2$ women: $^4C_2 \times {^6C_3} = 6 \times 20 = 120$

  • Exactly $3$ women: $^4C_3 \times {^6C_2} = 4 \times 15 = 60$

  • Exactly $4$ women: $^4C_4 \times {^6C_1} = 1 \times 6 = 6$

  • Total:

    $$120 + 60 + 6 = 186$$

Complement Method (Faster Check):

$$\text{Total} - (\text{0 women}) - (\text{1 woman}) = {^{10}C_5} - {^6C_5} - ({^4C_1} \times {^6C_4}) = 252 - 6 - 60 = 186 \;\checkmark$$

Worked Example 11 — Handshake & Geometry Problems:

$10$ people are in a room, and every person shakes hands with every other person once. Total handshakes?

$$\text{Handshakes} = {^{10}C_2} = \frac{10 \times 9}{2} = 45$$

Geometry Counting Shortcuts ($n$ points, no $3$ collinear):

  • Straight lines formed: $^nC_2$

  • Triangles formed: $^nC_3$

  • Diagonals in an $n$-sided polygon:

    $$\text{Diagonals} = {^nC_2} - n = \frac{n(n - 3)}{2}$$

    Example: Hexagon ($n = 6$): $\dfrac{6 \times (6 - 3)}{2} = \dfrac{6 \times 3}{2} = 9$

Part 4: Special Arrangements

1. Circular Permutations

  • Circular arrangements of $n$ distinct items (clockwise $\neq$ anticlockwise):

    $$\text{Arrangements} = (n - 1)!$$

Worked Example 12:

In how many ways can $6$ people sit around a circular table?

$$\text{Ways} = (6 - 1)! = 5! = 120$$

  • Necklace / Garland (clockwise $=$ anticlockwise, can be flipped):

    $$\text{Arrangements} = \frac{(n - 1)!}{2}$$

Worked Example 13:

In how many ways can $6$ distinct beads be strung into a necklace?

$$\text{Ways} = \frac{5!}{2} = \frac{120}{2} = 60$$

2. Arrangements with Identical Items

If there are $n$ total items where $p$ are identical of one kind, $q$ of a second kind, and $r$ of a third kind:

$$\text{Arrangements} = \frac{n!}{p! \times q! \times r! \cdots}$$

Worked Example 14:

Find the total distinct arrangements of the letters in MISSISSIPPI.

Total letters $n = 11$ ($\text{M} = 1$, $\text{I} = 4$, $\text{S} = 4$, $\text{P} = 2$):

$$\text{Arrangements} = \frac{11!}{1! \times 4! \times 4! \times 2!} = \frac{39,916,800}{1,152} = 34,650$$

3. Arrangements with Repetition Allowed

$$\text{Total} = n^r \quad (n \text{ choices available for each of } r \text{ positions})$$

Worked Example 15:

How many $3$-digit numbers can be formed from digits $1\text{–}5$ if repetition is allowed?

$$\text{Total Numbers} = 5^3 = 125$$

Part 5: Probability — From Counting to Likelihood

Core Definition

$$P(\text{Event}) = \frac{\text{Number of Favorable Outcomes}}{\text{Total Number of Possible Outcomes}}$$

Basic Properties:

  • $0 \le P(A) \le 1$ always

  • $P(\text{certain event}) = 1$

  • $P(\text{impossible event}) = 0$

  • $P(\text{not } A) = P(\overline{A}) = 1 - P(A)$

Sample Spaces to Memorize

Experiment

Total Outcomes

Quick Exam Notes

$1$ coin

$2$$\{H, T\}$

$2$ coins

$4$$\{HH, HT, TH, TT\}$

$3$ coins

$8$$2^3 = 8$

$n$ coins

$2^n$Each toss doubles outcomes

$1$ die

$6$$\{1, 2, 3, 4, 5, 6\}$

$2$ dice

$36$Sums range from $2$ to $12$ (Sum $7$ is most frequent: $6$ ways)

Standard deck

$52$ cards$26$ Red ($13$ Hearts, $13$ Diamonds) $+$ $26$ Black ($13$ Spades, $13$ Clubs)

$1$ suit

$13$ cards$\text{A}, 2, 3, 4, 5, 6, 7, 8, 9, 10, \text{J}, \text{Q}, \text{K}$

Face cards

$12$ cards$\text{J}, \text{Q}, \text{K} \times 4\text{ suits}$ (Note: Honor cards $= 16$, which includes Aces)

Aces

$4$ cards$1$ Ace per suit

Worked Example 16 — Basic Probability:

A fair die is rolled once. Find the probability of getting a number greater than $4$.

  • $\text{Favorable outcomes} = \{5, 6\} \rightarrow 2$

  • $P(\text{number} > 4) = \dfrac{2}{6} = \dfrac{1}{3}$

Worked Example 17 — Cards:

One card is drawn at random from a standard $52$-card deck. Find the probability that it is a King or a Heart.

$$P(\text{King}) = \frac{4}{52}, \qquad P(\text{Heart}) = \frac{13}{52}, \qquad P(\text{King AND Heart}) = \frac{1}{52}$$

$$P(\text{King OR Heart}) = \frac{4}{52} + \frac{13}{52} - \frac{1}{52} = \frac{16}{52} = \frac{4}{13}$$

Part 6: Probability Rules

1. Addition Rule

  • General Events (with overlap):

    $$P(A \text{ or } B) = P(A \cup B) = P(A) + P(B) - P(A \cap B)$$

  • Mutually Exclusive Events (no overlap, $P(A \cap B) = 0$):

    $$P(A \text{ or } B) = P(A) + P(B)$$

Worked Example 18:

Two dice are rolled simultaneously. Find $P(\text{sum} = 7 \text{ or } 11)$.

  • $\text{Sum } 7$: $\{(1,6), (2,5), (3,4), (4,3), (5,2), (6,1)\} \rightarrow 6\text{ outcomes}$

  • $\text{Sum } 11$: $\{(5,6), (6,5)\} \rightarrow 2\text{ outcomes}$

  • $P(\text{sum} = 7 \text{ or } 11) = \dfrac{6 + 2}{36} = \dfrac{8}{36} = \dfrac{2}{9}$

2. Multiplication Rule

  • Independent Events (outcome of $A$ does not affect $B$):

    $$P(A \text{ and } B) = P(A \cap B) = P(A) \times P(B)$$

  • Dependent Events (outcome of $A$ changes the pool for $B$):

    $$P(A \text{ and } B) = P(A \cap B) = P(A) \times P(B \mid A)$$

Worked Example 19 (Without Replacement — Dependent):

Two cards are drawn sequentially without replacement from a $52$-card deck. Find $P(\text{both are Aces})$.

$$P(\text{1st Ace}) = \frac{4}{52}, \qquad P(\text{2nd Ace} \mid \text{1st Ace}) = \frac{3}{51}$$

$$P(\text{both Aces}) = \frac{4}{52} \times \frac{3}{51} = \frac{1}{13} \times \frac{1}{17} = \frac{1}{221}$$

Worked Example 20 (With Replacement — Independent):

A bag contains $5$ red and $3$ blue balls. Two balls are drawn one after another with replacement. Find $P(\text{both red})$.

$$P(\text{both red}) = \frac{5}{8} \times \frac{5}{8} = \frac{25}{64}$$

Part 7: Conditional Probability

Conditional probability measures the likelihood of event $B$ occurring given that event $A$ has already occurred (which shrinks the sample space to $A$):

$$P(B \mid A) = \frac{P(A \cap B)}{P(A)}$$

Worked Example 21:

A bag contains $4$ red, $3$ blue, and $2$ green balls ($9$ total). One ball is drawn and it is known to be not green. Find $P(\text{red})$.

$$P(\text{red} \mid \text{not green}) = \frac{P(\text{red and not green})}{P(\text{not green})} = \frac{4/9}{7/9} = \frac{4}{7}$$

Part 8: Exam-Specific Patterns

SSC CGL Pattern

Most common types:

  • Arrangements with conditions (vowels together / never together)

  • Committees with gender constraints

  • Probability from a standard deck of cards

  • Probability with single or double dice

Speed Tip: Always check if $^nC_r = {^nC_{n-r}}$ applies. Computing $^8C_6 = {^8C_2} = \dfrac{8 \times 7}{2} = 28$ is far faster than expanding $6!$ terms.

CAT Pattern

Advanced types:

  • Distribution of $n$ identical items into $r$ distinct boxes (Stars & Bars):

    • Empty boxes allowed: $^{n + r - 1}C_{r - 1}$

    • Every box gets at least $1$ item: $^{n - 1}C_{r - 1}$

  • Derangements (no item ends up in its original position):

    $$D(n) = n! \times \left(1 - \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \cdots + \frac{(-1)^n}{n!}\right)$$

    Memorize key values: $D(2) = 1$, $\quad D(3) = 2$, $\quad D(4) = 9$, $\quad D(5) = 44$

IBPS PO Pattern

Most common types:

  • Bags with colored balls (with and without replacement)

  • Standard card deck selection problems

  • Two events combined (addition rule & complement "at least one" rule)

  • Time budget: $60\text{–}90\text{ seconds}$ per question in Prelims, $90\text{–}120\text{ seconds}$ in Mains.

Quick Reference — All Formulas

Concept

Formula

Permutation (order matters)

$^nP_r = \dfrac{n!}{(n - r)!}$

Combination (order does not matter)

$^nC_r = \dfrac{n!}{r! \times (n - r)!}$

Circular arrangement

$(n - 1)!$

Necklace / Garland arrangement

$\dfrac{(n - 1)!}{2}$

Identical items arrangement

$\dfrac{n!}{p! \times q! \times r! \cdots}$

Arrangement with repetition

$n^r$

Distribution of $n$ identical items into $r$ boxes

$^{n + r - 1}C_{r - 1}$ (empty allowed) $\;\mid\;$ $^{n - 1}C_{r - 1}$ (at least $1$ each)

Diagonals in an $n$-sided polygon

$\dfrac{n(n - 3)}{2}$

Handshakes / Round-robin matches

$^nC_2 = \dfrac{n(n - 1)}{2}$

Addition Rule $P(A \text{ or } B)$

$P(A) + P(B) - P(A \cap B)$

Multiplication Rule — Independent

$P(A \cap B) = P(A) \times P(B)$

Multiplication Rule — Dependent

$P(A \cap B) = P(A) \times P(B \mid A)$

Complement Rule $P(\text{not } A)$

$1 - P(A)$

Conditional Probability $P(B \mid A)$

$\dfrac{P(A \cap B)}{P(A)}$

3-Week Practice Plan

Week

Focus Area

Daily Target

Week 1

Counting principle $+$ basic P&C formulas$15\text{ questions}$, $20\text{ minutes}$

Week 2

Arrangements with conditions $+$ combination types$15\text{ questions}$, $20\text{ minutes}$

Week 3

Probability rules $+$ exam-style mixed sets$15\text{ mixed questions}$, $25\text{ minutes}$

Frequently Asked Questions

Ask one question: Does the order of selection matter? Arranging $3$ people in seats — yes, order matters ($ABC$ and $BAC$ are different) — use permutation ($^nP_r$). Selecting $3$ people for a team — no, order does not matter — use combination ($^nC_r$). This single question resolves $95\%$ of all P&C decision points.

The complement method calculates $P(\text{event}) = 1 - P(\text{opposite event})$. Use it whenever phrases like "at least one", "at least two", or "at most" appear. Finding "at least one head in $5$ coin tosses" directly requires $5$ separate cases; its complement "no heads" $= \left(\frac{1}{2}\right)^5 = \frac{1}{32}$, so the answer is $1 - \frac{1}{32} = \frac{31}{32}$ — solved in one step.

With replacement — each draw is independent, the sample space stays the same, and you use $P(A) \times P(B)$ directly. Without replacement — each draw changes the remaining pool, events become dependent, and you use $P(A) \times P(B \mid A)$ with an adjusted numerator and denominator. For example, drawing $2$ Aces without replacement $= \frac{4}{52} \times \frac{3}{51} = \frac{1}{221}$.

In a circle, all rotations of the same seating order are identical. For $5$ people around a round table, shifting everyone one seat to the right produces the exact same relative arrangement. Fixing one person as an anchor eliminates these rotational duplicates — leaving $(n - 1)! = 4! = 24$ distinct arrangements instead of $5! = 120$.

P&C calculations involve factorial arithmetic, large multiplications, and fraction simplification. The faster you compute $\frac{8 \times 7 \times 6}{6} = 56$, simplify $\frac{12}{2,652} = \frac{1}{221}$, or evaluate $\left(\frac{3}{4}\right)^3 = \frac{27}{64}$, the more time you have for logical problem setup. SpeedMath.in's multiplication and fraction modules directly build these reflexes.

Advertisement

Have You Learned Something New? Spread It!

Copied!

Ready to put it into practice?

Apply what you've learned — sharpen your speed, test your knowledge, and challenge yourself.