Imagine you have to expand (x+y)2. You know it's x2+2xy+y2. What about (x+y)3? That's x3+3x2y+3xy2+y3. Now try (x+y)4 — you could multiply (x+y)3 by (x+y) again, but it gets messy fast.
The Binomial Theorem is the shortcut. It tells you exactly what (x+y)n expands to, for any positive integer n, without doing the multiplication step by step.
The Pattern You Already Know
Look at the expansions we have:
Power
Expansion
(x+y)0
1
(x+y)1
x+y
(x+y)2
x2+2xy+y2
(x+y)3
x3+3x2y+3xy2+y3
(x+y)4
x4+4x3y+6x2y2+4xy3+y4
Three things stand out:
The powers of x decrease from n down to 0, while the powers of y increase from 0 up to n. In each term, the exponents add to n.
The coefficients — 1, 2, 1 for n=2; 1, 3, 3, 1 for n=3; 1, 4, 6, 4, 1 for n=4 — follow a famous pattern called Pascal's triangle.
The number of terms is always n+1.
Note
Pascal's triangle: each number is the sum of the two numbers directly above it.
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
Why Do These Coefficients Appear?
Think about what (x+y)n really means. It's (x+y) multiplied by itself n times:
(x+y)n=n factors(x+y)(x+y)⋯(x+y)
When you expand, you pick either x or y from each factor. A term like xn−kyk comes from choosing y from exactly k of the n factors and x from the rest.
How many ways can you choose which k factors give you y? That's exactly the number of combinations: (kn) (read "n choose k").
(kn)=k!(n−k)!n!
So the coefficient of xn−kyk is (kn). That's the heart of the theorem.
Notice (0n)=1 and (nn)=1, which matches the first and last coefficients always being 1.
A Quick Example
Expand (2a−b)5 using the theorem.
Here x=2a, y=−b, and n=5.
(2a−b)5=∑k=05(k5)(2a)5−k(−b)k
Compute term by term:
k=0: (05)(2a)5(−b)0=1⋅32a5=32a5
k=1: (15)(2a)4(−b)1=5⋅16a4⋅(−b)=−80a4b
k=2: (25)(2a)3(−b)2=10⋅8a3⋅b2=80a3b2
k=3: (35)(2a)2(−b)3=10⋅4a2⋅(−b3)=−40a2b3
k=4: (45)(2a)1(−b)4=5⋅2a⋅b4=10ab4
k=5: (55)(2a)0(−b)5=1⋅1⋅(−b5)=−b5
So:
(2a−b)5=32a5−80a4b+80a3b2−40a2b3+10ab4−b5
Watch out
A common mistake: forgetting the sign when y is negative. Here (−b)k alternates signs — even k gives positive, odd k gives negative.
Why This Matters
The Binomial Theorem isn't just for expanding brackets. It appears in probability (binomial distribution), calculus (binomial series for non-integer exponents), and even in estimating powers without a calculator. Once you see the pattern, you'll spot it everywhere.
The key takeaway: every term in (x+y)n is of the form (kn)xn−kyk. The theorem gives you all n+1 terms in one clean formula.
The Binomial Theorem itself, along with Pascal's triangle and the general term formula, is one of the most heavily tested chapters in NCERT Class 11 Mathematics, and "binomial theorem class 11 formula, definition and examples" is a frequently searched revision query for CBSE boards and JEE Main. Because the theorem also underlies probability and approximation problems, it consistently appears in "binomial theorem important questions" compiled for competitive-exam practice.
Bound (1+0.01)1000000 below using only the first two binomial terms — every other term is positive and only adds more.
✓Final answer
(1.01)1000000>10000.
Expanding (1+0.01)1000000 by the binomial theorem and keeping just the first two (positive) terms already exceeds 10000; every dropped term is positive, so the true value is even larger.
Step 1. Write (1.01)1000000=(1+0.01)1000000 and expand.
(1+0.01)1000000=1000000C0+1000000C1(0.01)+1000000C2(0.01)2+⋯, and every term here is positive (since 0.01>0).
Step 2. Keep just the first two terms as a lower bound.
(1+0.01)1000000≥1+1000000(0.01)=1+10000=10001
(dropping the remaining, strictly positive, terms can only make the true sum bigger, never smaller).
Step 3. Compare.10001>10000, so
(1.01)1000000≥10001>10000.
✓Final answer
(1.01)1000000>10000 — it is the larger of the two numbers.
Trying to compute (1.01)1000000 numerically instead of bounding it
Forgetting that ALL the dropped higher-order terms are positive, so the two-term bound is a valid (not just approximate) lower bound