Math notesAlgebraBinomial

Independent topic page

Binomial Theorem

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.

Portion AlgebraFocus Matching/MC favourite; coefficient & middle-term drillsTarget 60–90sPortion share 37.2%Trend Falling share
Syllabus: binomial theorem for positive integral index and properties of binomial coefficients. Advanced often hides asks inside coefficient of x^k or relations among C₀…Cₙ. Binomial under the clock is T_{r+1} discipline — expansion is a last resort.

How Advanced asks this

  • Coefficient of x^k in expansion
  • Middle term(s) / term independent of x
  • Relations among binomial coefficients
  • Matching identity ↔ statement
  • Numerically largest term in expansion

Traps that leak marks

  • Off-by-one on T_{r+1} index
  • r outside 0…n
  • Forcing MATCH codes
  • Sign errors with (−x) powers
  • Expanding fully when only one coefficient is needed
  • Off-by-one on r when reading ‘(r+1)th term’
  • Using (1+x)^n coefficient-sum tricks with the wrong substitution

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

Syllabus for this topic

Official syllabus points for Binomial Theorem only — not the full Algebra portion map. Portion hub: Algebra · Algebra analysis.

Syllabus on this page is topic-scoped: Binomial theorem. The parent portion (Algebra) also covers other topics — use the portion hub for the full map.

Must cover (this topic)

  • Binomial theorem (positive integral index) and binomial coefficient properties

Gaps / watch-outs

No topic-specific exclusions flagged — finish the unit points below for Binomial.

Source: https://jeeadv.ac.in/documents/jee-advanced-2026-syllabus.pdf

Unit 01

Binomial theorem

high

Exam focusGeneral term, coefficient extraction, and binomial identities under Advanced formats.

Syllabus points

  • Binomial theorem (positive integral index) and binomial coefficient properties

Full Mathematics syllabus →

Cross-topic stems

Mixed joins for this topic

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.

All mixed joins →

Why methods matter

Common methods that change your score

Binomial looks formula-heavy, but Advanced rewards one habit: general term → power match. These methods keep you from expanding whole binomials under pressure.

01

General term lock

One template ends almost every coefficient question — expand-all is a time tax.

Do thisAlways write T_{r+1} before hunting coefficients.

Why it works

Standardises every coeff problem.

See it once

Coeff of x² in (1+x)⁵ → r=2 → C(5,2)=10.

02

x=±1 identity factory

Gives coefficient sums without proof theatre under exam pressure.

Do thisSubstitute special values to get coefficient sums.

Why it works

Turns expansions into numerical identities fast.

See it once

(1+1)ⁿ=2ⁿ; (1−1)ⁿ=0 for n>0 gives alternating sum 0.

03

Small-n verify

Kills fake MATCH identities before you waste a matching cluster.

Do thisFor MATCH/MC identities, test n=2,3.

Why it works

Fake identities fail immediately.

See it once

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.

04

Ratio for greatest term

Finds the largest term without computing the whole expansion.

Do thisFind largest r with T_{r+1}/T_r ≥ 1.

Why it works

Avoids computing all terms.

See it once

Solve inequality for r; watch if two middle terms when n odd/even patterns.

Processed examples

Sample questions · full working

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.

01

bankFamily · Coefficient of x^k

Sample question

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.

Processed solution

  1. Write general term T_{r+1} = C(5,r) x^r.
  2. Coefficient of x² needs r = 2.
  3. C(5,2) = 10.

Answer10

Takeaway: T_{r+1} before expanding.

02

standardFamily · Term independent of x

Sample question

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.

Processed solution

  1. T_{r+1} = C(6,r) (x²)^{6−r} (1/x)^r = C(6,r) x^{12−3r}.
  2. 12−3r=0 ⇒ r=4.
  3. Term = C(6,4)=15.

Answer15

Takeaway: Same template as coefficient; only the target power changes.

03

twistFamily · Term independent of x

Sample question

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.

Processed solution

  1. In (x² + x⁻¹)¹², T_{r+1} has coefficient C(12, r) and power 24 − 3r.
  2. For ×1, need 24 − 3r = 0 ⇒ r = 8 ⇒ C(12, 8) = 495.
  3. For ×(−x³), need 24 − 3r = −3 ⇒ r = 9 ⇒ contribution −C(12, 9) = −220.
  4. Independent term = 495 − 220 = 275.

Answer275

Takeaway: When a second factor multiplies, power-match every contributing piece.

Reusable models

Common question families

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.

01

Coefficient of x^k

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.

Same solve path

  1. Standardise expansion.
  2. General term.
  3. Equate exponent.
  4. Evaluate coefficient.

Rough skeleton

  • T_{r+1}
  • r=…
  • Coeff

Why faster

One general-term template covers almost all coeff asks.

Refuse this

Do not expand the entire binomial when only one power is needed.

02

Term independent of x

Looks like(ax^p + b/x^q)ⁿ; independent term

Fast modelNet power of x in T_{r+1} = 0 → solve r.

Same solve path

  1. Write general term with powers of x.
  2. Set exponent 0.
  3. Valid integer r in range.
  4. Evaluate term.

Rough skeleton

  • Exponent=0
  • r
  • Term

Why faster

Same path as coefficient — only target power is 0.

Refuse this

Do not list all terms.

03

Coefficient-sum identities / MATCH

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.

Same solve path

  1. Identify which substitution gives the sum.
  2. Write identity.
  3. For MATCH: independent T/F + small-n kill.

Rough skeleton

  • x=±1
  • Identity
  • T/F

Why faster

Substitution beats proving from scratch in the hall.

Refuse this

Do not force a pretty matching code.

04

Greatest term

Looks likeNumerically greatest term in expansion

Fast modelUse T_{r+1}/T_r ≥ 1 inequality to find r — do not compute every term.

Same solve path

  1. Form ratio.
  2. Solve for r.
  3. Check boundary / two middle terms case.
  4. Report term(s).

Rough skeleton

  • Ratio
  • r
  • Term

Why faster

Ratio test is O(1) vs expanding all terms.

Refuse this

Do not compute all T_r numerically.

Hall timing

60–90s process

  1. 0–15s
    Identify (a+b)ⁿ form. Circle ask: coeff / term / identity / largest term.

    Rewrite expression into standard binomial if factored oddly.

  2. 15–35s
    Write T_{r+1}. For coeff, set exponent of x equal to required power.

    Solve for integer r in range 0…n. Watch negative powers from denominators.

  3. 35–75s
    Compute nCr and simplify. For identities, use symmetry or (1+1)ⁿ/(1−1)ⁿ tricks.

    ∑nCr=2ⁿ, ∑(−1)^r nCr=0 (n>0). Ratio of consecutive terms finds greatest term.

  4. 75–90s
    Check r integer in range; for MATCH verify with small n.

    Independent T/F for each list item — never force a pretty code.

After the model is locked

Quick formula bank

Binomial expansion

(a+b)ⁿ = ∑_{r=0}^{n} nCr a^{n−r} b^r

Positive integral n

General term

T_{r+1} = nCr a^{n−r} b^r

Coefficient / particular term

Symmetry

nCr = nC(n−r)

Simplify coefficients

Sum of coefficients

∑ nCr = 2ⁿ; ∑ (−1)^r nCr = 0 (n≥1)

Put x=1 or x=−1 in (1+x)ⁿ

Pascal identity

nCr + nC(r−1) = (n+1)Cr

Coefficient relations

Term independent of x

Set exponent of x in T_{r+1} to 0; solve r

Independent term asks

Greatest term ratio

T_{r+1}/T_r = (n−r+1)/r · (b/a) (for (a+b)ⁿ)

Largest term in expansion

Mental bank

  • T_{r+1}=nCr a^{n−r}b^r
  • nCr=nC(n−r)
  • ∑nCr=2ⁿ
  • ∑(−1)^r nCr=0 (n>0)
  • Pascal: nCr+nC(r−1)=(n+1)Cr
  • T_{r+1}=C(n,r) a^{n−r} b^r
  • (1+x)^n sum of coeffs = 2^n; x=−1 → alternating
  • Greatest term: compare |T_{r+1}/T_r| ≷ 1
  • Middle term(s): n even → one; n odd → two

Make it automatic

Practice · checklist

Daily

  • 2 coefficient extractions.
  • 1 independent-term NUM.
  • 1 identity check with x=±1.

Weekly

  • 1 matching binomial identities (independent T/F).
  • 1 greatest-term drill (5 Q).
  • Error log: r index mistakes.

100% checklist

  • T_{r+1} written every time.
  • r validated in range.
  • Symmetry/sum identities used for MC speed.
  • MATCH solved independently.
  • ≥90% on last timed Binomial set.
  • General term written before any coefficient hunt.
  • Small-n verification used on suspicious identities.
  • Ratio test used for greatest-term stems.