Binomial theorem
Exam focusGeneral term, coefficient extraction, and binomial identities under Advanced formats.
Syllabus points
- Binomial theorem (positive integral index) and binomial coefficient properties
Math notesAlgebraBinomial
Independent topic page
Binomial full marks come from coefficient extraction and identities: write general term T_{r+1}, apply nCr symmetries, and verify small-n when matching looks heavy.
01. General term is the workhorse: T_{r+1}=nCr a^{n−r} b^r in (a+b)ⁿ.
02. Symmetry nCr=nC(n−r) and identities like ∑nCr=2ⁿ kill many MC options quickly.
03. For coefficient problems: equate power of x in T_{r+1}, solve for r, then compute nCr factor.
04. When stuck on an identity, test n=2 or n=3 — false MATCH codes die immediately.
05. Advanced lane: coefficient questions live in the general term T_{r+1}. Lock r from the power of x (or constant term) before writing a single full expansion.
06. Identities / MATCH lists often fail a 30-second n=2 or n=3 plug — use that kill test before proving anything fancy.
Official · 2026
Official syllabus points for Binomial Theorem only — not the full Algebra portion map. Portion hub: Algebra · Algebra analysis.
No topic-specific exclusions flagged — finish the unit points below for Binomial.
Source: https://jeeadv.ac.in/documents/jee-advanced-2026-syllabus.pdf
Exam focusGeneral term, coefficient extraction, and binomial identities under Advanced formats.
Syllabus points
2020–2026 paper weight
Topic match inside parent portion Algebra (37.2% of Math tags). Stats below are portion backdrop; matched subtopics show where Binomial Theorem sits.
Portion-wide type/difficulty mix lives on the Algebra analysis — not repeated here so this page stays on Binomial.
Cross-topic stems
Advanced rarely asks a chapter in isolation. These are tagged multi-idea Math stems that touch Binomial Theorem — practise the knowledge bridge, not only the single-chapter drill.
No tagged mixed stem matched this topic’s keywords yet. Still revise the joins listed under Trends, and scan the mixed joins board for Calculus / Coordinate / Algebra bridges.
Why methods matter
Binomial looks formula-heavy, but Advanced rewards one habit: general term → power match. These methods keep you from expanding whole binomials under pressure.
One template ends almost every coefficient question — expand-all is a time tax.
Do thisAlways write T_{r+1} before hunting coefficients.
Standardises every coeff problem.
Coeff of x² in (1+x)⁵ → r=2 → C(5,2)=10.
Gives coefficient sums without proof theatre under exam pressure.
Do thisSubstitute special values to get coefficient sums.
Turns expansions into numerical identities fast.
(1+1)ⁿ=2ⁿ; (1−1)ⁿ=0 for n>0 gives alternating sum 0.
Kills fake MATCH identities before you waste a matching cluster.
Do thisFor MATCH/MC identities, test n=2,3.
Fake identities fail immediately.
If an option claims ∑ r nCr = n2^{n−1}, check n=2: left 0·1+1·2+2·1=4, right 2·2=4 — holds; still prove or recall properly for certainty.
Finds the largest term without computing the whole expansion.
Do thisFind largest r with T_{r+1}/T_r ≥ 1.
Avoids computing all terms.
Solve inequality for r; watch if two middle terms when n odd/even patterns.
Processed examples
Read the impact line first. Then notice which family/model was chosen. The solution is written the way your rough sheet should look in the hall.
Find the coefficient of x² in (1+x)⁵.
General term is the whole method — expanding all terms is a time tax.
Model chosenT_{r+1} with r=2.
Answer10
Takeaway: T_{r+1} before expanding.
Find the term independent of x in (x² + 1/x)⁶.
Independent-term stems are the same family as coefficient — target power 0.
Model chosenSet net power of x in T_{r+1} to 0.
Answer15
Takeaway: Same template as coefficient; only the target power changes.
Find the term independent of x in (x² + x⁻¹)¹²(1 − x³) without expanding either factor fully.
An extra polynomial means two contributing powers — Advanced expects both matches.
Model chosenPower-match for ×1 and for ×(−x³) separately, then add.
Answer275
Takeaway: When a second factor multiplies, power-match every contributing piece.
Reusable models
Advanced stems cluster. Name the family in 10–15s, write the fast model, then run the same path. Do not invent a new plan each time.
Looks likeFind coefficient in (a+b)ⁿ or product of binomials
Fast modelWrite T_{r+1}; set power of x = k; solve r; compute nCr×constants.
One general-term template covers almost all coeff asks.
Do not expand the entire binomial when only one power is needed.
Looks like(ax^p + b/x^q)ⁿ; independent term
Fast modelNet power of x in T_{r+1} = 0 → solve r.
Same path as coefficient — only target power is 0.
Do not list all terms.
Looks like∑nCr, alternating sums, relations among Cᵣ
Fast modelSpecialise (1+x)ⁿ at x=1 or x=−1; verify fake MATCH with n=2,3.
Substitution beats proving from scratch in the hall.
Do not force a pretty matching code.
Looks likeNumerically greatest term in expansion
Fast modelUse T_{r+1}/T_r ≥ 1 inequality to find r — do not compute every term.
Ratio test is O(1) vs expanding all terms.
Do not compute all T_r numerically.
Hall timing
Rewrite expression into standard binomial if factored oddly.
Solve for integer r in range 0…n. Watch negative powers from denominators.
∑nCr=2ⁿ, ∑(−1)^r nCr=0 (n>0). Ratio of consecutive terms finds greatest term.
Independent T/F for each list item — never force a pretty code.
After the model is locked
(a+b)ⁿ = ∑_{r=0}^{n} nCr a^{n−r} b^r
Positive integral n
T_{r+1} = nCr a^{n−r} b^r
Coefficient / particular term
nCr = nC(n−r)
Simplify coefficients
∑ nCr = 2ⁿ; ∑ (−1)^r nCr = 0 (n≥1)
Put x=1 or x=−1 in (1+x)ⁿ
nCr + nC(r−1) = (n+1)Cr
Coefficient relations
Set exponent of x in T_{r+1} to 0; solve r
Independent term asks
T_{r+1}/T_r = (n−r+1)/r · (b/a) (for (a+b)ⁿ)
Largest term in expansion
Make it automatic