Combinatorics; Chapter 5 ADV. Mathematics Concepts Infographics

← Back to Class List

NCF 2023 Aligned - Visual Learning Series

Chapter 5: Combinatorics

Systematically counting, arranging, and selecting objects to solve complex real-world decision problems.

Core Vocabulary & Definitions

• Fundamental Principle of Counting: A foundational counting strategy that breaks complex multi-stage decisions into individual sequential steps using addition or multiplication rules.
• Factorial (n!): The product of all consecutive descending positive integers from n down to 1 (n! = n × (n - 1) × ... × 1), with 0! = 1 by definition.
• Permutation (ⁿP_r): An ordered arrangement of r distinct objects chosen from a total set of n objects, where the exact sequence or position strictly matters.
• Combination (ⁿC_r): A grouping or selection of r distinct objects chosen from a total set of n objects, where the arrangement sequence is completely irrelevant.
• Tree Diagram: A visual branching diagram used to map out and verify every possible outcome across successive decision steps.

Essential Formulas & Identities

Rule of Multiplication (AND Rule):

Total Outcomes = m × n

Example: 3 processors AND 4 colors = 3 × 4 = 12 configurations.

Rule of Addition (OR Rule):

Total Choices = m + n

Example: 4 sports clubs OR 3 music clubs = 4 + 3 = 7 options.

Permutation Formula (Order Matters):

ⁿP_r = n!(n - r)!

With repetition: n^r

Combination Formula (Order Irrelevant):

ⁿC_r = n!r!(n - r)!

Relation: ⁿP_r = r! × ⁿC_r

Visual: Permutation vs Combination

Permutations care about sequence; combinations only care about the group.

Visual: Multiplication Tree (m × n)

Multiply choices across each stage (m × n).

Algorithm: Permutation vs. Combination Problems

1

Analyze Order

Does swapping items create a distinct outcome? If YES (passcodes, ranks), use Permutation. If NO (committees, teams), use Combination.

2

Check Parameters

Identify total items (n) and selected items (r). Check if repetition is allowed or forbidden in the problem context.

3

Apply Formula

Permutation: ⁿP_r = n! / (n - r)!. Combination: ⁿC_r = n! / [r!(n - r)!]. (Use n^r if repetition allowed).

4

Combine Stages

If independent decisions are connected by AND, multiply them. If mutually exclusive options are connected by OR, add them.

Visual: Pascal's Triangle

_r values.

Each number is the sum of the two directly above it.

Key Properties & Proofs

• Symmetric Combination Property: Selecting r objects from n is identical to leaving n - r objects behind.
  ⁿC_r = ⁿC_n-r

Pascal's Identity: Adding adjacent entries in a row yields the entry directly below in the next row.
ⁿC_r + ⁿC_r-1 = ⁿ⁺¹C_r

Total Subset Sum: The sum of all combinations for a set of size n equals the total number of subsets.
ⁿC₀ + ⁿC₁ + ... + ⁿC_n = 2ⁿ

Circular Permutations: Arranging n objects around a circle yields (n - 1)! arrangements because one position is fixed as a reference.

Common Pitfalls & Exam Traps

Pitfall 1 (Using Permutation instead of Combination): Using ⁿP_r instead of ⁿC_r when picking a 3-person committee from 10 people, leading to overcounting by 3! = 6 times.
Correction: Ask yourself: "Does changing the internal order create a new outcome?" If selecting A, B, C is identical to C, B, A, always use Combination.

Pitfall 2 (Double-Counting Overlapping Options): Adding options using m + n when the two groups of choices are not mutually exclusive (they share common outcomes).
Correction: Apply the Addition Rule only when choices are completely disjoint. If they overlap, subtract the shared intersection: n(A U B) = n(A) + n(B) - n(A n B).

Designed by Akash Srivastva | Mathematics Hub - Visual Learning Series

Loved this? Get more visual study materials at: www.akashmaths.online