Back to Unit
Foundational Topic

Basic Counting Techniques & Binomial Theorem

Mathematics Unit 1
25 min read
IAT Foundation
Essential

1. Core Concept

Permutations & Combinations (P&C) is the mathematics of counting without actually listing every possibility. Permutations deal with arrangements (Order matters!), while Combinations deal with selections (Order does not matter!). The Binomial Theorem provides a fast algebraic method to expand (x+y)n using combination formulas as coefficients.

2. Key Formulas

Fundamental Principles:

  • AND (Multiplication): If task A can be done in m ways and task B in n ways, both occur in m × n ways.
  • OR (Addition): If task A or task B can be done (mutually exclusive), they occur in m + n ways.
n! = n × (n-1) × ... × 1  |  0! = 1
nPr = n! / (n-r)!
Permutations: Arrangements.
nCr = n! / (r!(n-r)!)
Combinations: Selections (Order does not matter).

Why nCr Formula Works

We first arrange r objects from n (nPr ways), but since order does not matter in combinations, each selection of r objects is overcounted r! times. Hence:

nCr = nPr / r!

nPr = r! × nCr
The Bridge: First select r, then arrange in r! ways.

Binomial Theorem:

(x + y)n = ∑r=0n nCr xn−r yr
Full Binomial Expansion for positive integer n.
Tr+1 = nCr xn-r yr
General Term: Used to find specific coefficients (Index r starts from 0).

Middle Term Concept

Total number of terms in (x+y)n is (n + 1).

  • If n is even → One middle term = T(n/2)+1
  • If n is odd → Two middle terms = T(n+1)/2 and T(n+3)/2

3. Important Results

  • Symmetry: nCr = nCn-r
  • Pascal’s Identity: nCr + nCr-1 = n+1Cr
  • Sum of Binomial Coefficients: nC0 + nC1 + ... + nCn = 2n
  • Circular Permutations: Arrange n objects in a circle = (n-1)!. (If necklace: (n-1)! / 2).
  • Beggar's Method (Stars and Bars): Distributing n identical items among r distinct people = n+r-1Cr-1.

4. Conceptual Insights

Grouping/Division:

Dividing m+n+p objects into three unequal groups: (m+n+p)! / (m!n!p!). If group sizes are equal (e.g., three groups of size m), divide by 3! to account for identical groups: (3m)! / ((m!)3 × 3!).

Pascal's Triangle:

Each coefficient in an expansion (x+y)n is simply the sum of the two directly above it in the previous row.

5. Common Mistakes

  • P vs C Confusion: Use Combinations (C) for committees, teams, or hands of cards. Use Permutations (P) for passwords, seating arrangements, or words.
  • Index Trap: The General Term formula Tr+1 gives the (r+1)th term, not the rth term. To find the 5th term, plug in r=4.
  • Middle Term Trap: If n is odd, there are 2 middle terms: T(n+1)/2 and T(n+3)/2.

6. Example Applications

Term Independent of x:

Find the term without x in (x2 + 1/x)9.

Method: Write Tr+1 = 9Cr(x2)9-r(x-1)r. The power of x is 18 - 2r - r = 18 - 3r. Set to 0 &implies; r=6. The term is T7 = 9C6.

Dictionary Rank:

Find rank of "MATH" (A, H, M, T).
Words starting with A: 3! = 6
Words starting with H: 3! = 6
Words starting with M: Next letter must be A. Then H, T (MATH) = 1st word.
Rank = 6 + 6 + 1 = 13.

7. IAT Exam Focus Points

Key Exam Focus:

  • Beggar's Method: Be ready for x + y + z = 10 with constraints like x≥1, y≥2. Distribute minimums first!
  • Repeated Letters: Rank of "INDIA" or "BANANA". Don't forget to divide by factorials of repeating letters.
  • Coefficient Extraction: Finding coefficient of xk in (1+x)m(1-x)n.
  • Binomial Series: Practice using x=1, x=-1, x=i or calculus techniques on (1+x)n to evaluate summation series.
  • Derangement (Dn): Number of ways objects can none occupy their original spot. Dn = n![1 - 1/1! + 1/2! - 1/3! + ... + (-1)n/n!].

8. Practice Mock Test

Ready to test your knowledge?

Take a quick 15-question assessment specifically designed for P&C and Binomial Theorem. Challenge yourself with IAT-level questions.

Start Practice Mock

End of Chapter

Basic Counting Techniques & Binomial Theorem

Contents