General term and binomial coefficients

Expanding (a+b)10(a+b)^{10} term by term to find just one coefficient is slow and error-prone. The general term formula skips straight to any single term of a binomial expansion — the 4th term, the term containing x5x^5, or the middle term — without writing out the rest. It sits inside the Binomial Theorem chapter of Unit II (Algebra) in CBSE Class 11, built directly on the expansion (a+b)n=∑nCk an−kbk(a+b)^n = \sum {}^nC_k\,a^{n-k}b^k. The idea is compact but powerful: one formula, correctly indexed, answers "which term?", "what coefficient?" and "which term is in the middle?" questions that would otherwise need a full expansion. This article restates the formula, derives it from the binomial theorem, works a fresh middle-term example beyond the Pass-1 basics, and flags the indexing slip that costs the most marks.

The core insight

The (r+1)(r+1)-th term of (a+b)n(a+b)^n is Tr+1=nCr an−rbrT_{r+1} = {}^nC_r\,a^{n-r}b^r, so any specified term or coefficient can be picked out directly by choosing the right value of rr.

The core idea

The binomial theorem expands (a+b)n(a+b)^n as a sum of n+1n+1 terms, each built from a binomial coefficient and falling/rising powers of aa and bb:

(a+b)n=∑k=0nnCk an−kbk(a+b)^n = \sum_{k=0}^{n} {}^nC_k\, a^{n-k}b^k

where: nn is the (positive integer) index of the expansion, and kk runs from 00 to nn, giving one term per value of kk. Pulling out the term for a single value of k=rk = r gives the general term, conventionally labelled as the (r+1)(r+1)-th term of the expansion:

Tr+1=nCr an−r brT_{r+1} = {}^nC_r\, a^{n-r}\,b^r

where: r=0,1,2,…,nr = 0, 1, 2, \dots, n; T1T_1 is the first term (r=0r=0), T2T_2 is the second (r=1r=1), and so on — the subscript is always one more than rr.

Binomial coefficients. The numbers nCr=n!r!(n−r)!{}^nC_r = \dfrac{n!}{r!(n-r)!} that multiply each term carry three properties worth knowing cold:

  • Symmetry: nCr=nCn−r{}^nC_r = {}^nC_{n-r} — the coefficients read the same from either end of the row.
  • End values: nC0=nCn=1{}^nC_0 = {}^nC_n = 1 — the first and last terms are always just ana^n and bnb^n.
  • Pascal's rule: nCr+nCr−1=n+1Cr{}^nC_r + {}^nC_{r-1} = {}^{n+1}C_r — each coefficient is the sum of the two above it in the next row down, which is exactly how Pascal's triangle is built.
  • Row sum: nC0+nC1+⋯+nCn=2n{}^nC_0 + {}^nC_1 + \cdots + {}^nC_n = 2^n, obtained by setting a=b=1a=b=1 in the theorem.
Figure
Pascals triangle rows zero through five with each entry the sum of the two numbers above it
Pascal's triangle — each entry is the sum of the two above it 1 11 121 1331 14641 15101051 row n = 0 row n = 1 row n = 2 row n = 5 Row n lists the coefficients nC0, nC1, ... , nCn used in the general term

Why bother with the general term. To find the 6th term of (2x−3)9(2x-3)^9, substitute r=5r=5 directly into Tr+1=9Cr(2x)9−r(−3)rT_{r+1} = {}^9C_r(2x)^{9-r}(-3)^r — no need to expand all ten terms. To find a coefficient, set up the general term, solve for the value of rr that produces the required power of xx, then substitute back.

Middle term(s). This refinement builds directly on the general term and is formative-only this year, but it is worth understanding: when nn is even, (a+b)n(a+b)^n has exactly one middle term, Tn2+1T_{\frac{n}{2}+1}, since there are n+1n+1 (odd) terms total. When nn is odd, there are two middle terms, Tn+12T_{\frac{n+1}{2}} and Tn+32T_{\frac{n+3}{2}}, because n+1n+1 is even and splits evenly around the centre.

Derivation ADeriving the general term from the binomial theorem

The goal is to show precisely how the single formula Tr+1=nCr an−rbrT_{r+1} = {}^nC_r\,a^{n-r}b^r falls straight out of the summation form of the binomial theorem, so that the indexing convention — why it is called the (r+1)(r+1)-th term and not the rr-th — is understood rather than memorised.

Step 1. Start from the binomial theorem in summation form, (a+b)n=∑k=0nnCk an−kbk(a+b)^n = \sum_{k=0}^{n} {}^nC_k\,a^{n-k}b^k. This says the full expansion is built by letting kk run through every integer from 00 to nn and adding up the corresponding term nCk an−kbk{}^nC_k\,a^{n-k}b^k each time.

Step 2. Count how the terms line up with kk. When k=0k=0, the term is nC0 anb0=an{}^nC_0\,a^n b^0 = a^n, which is the first term of the expansion, T1T_1. When k=1k=1, the term is nC1 an−1b1{}^nC_1\,a^{n-1}b^1, the second term, T2T_2. In general, the term for a given value of kk occupies position k+1k+1 in the listed expansion, because the count starts at T1T_1 (position 1) while kk starts at 00.

Step 3. Rename the running index kk as rr to match the term we want, and write the position explicitly: the term at k=rk=r is the (r+1)(r+1)-th term of the expansion, so it is labelled Tr+1T_{r+1}. Substituting k=rk=r into the summand from Step 1 gives Tr+1=nCr an−rbrT_{r+1} = {}^nC_r\,a^{n-r}b^r, exactly the general term formula.

Step 4. Read off the indexing rule that follows immediately: to get the pp-th term of the expansion, set r+1=pr+1=p, i.e. use r=p−1r = p-1 in the formula, not r=pr=p. This single substitution rule is the entire content of the "general term," and every worked problem below is just this formula with specific aa, bb, nn and rr plugged in.

Worked example

Find the middle term(s) in the expansion of (x+1x)8\left(x + \dfrac{1}{x}\right)^{8}, and also state the coefficient of x0x^0 in this expansion.

Step 1. Identify nn and the number of terms. Here n=8n=8 is even, so the expansion has n+1=9n+1=9 terms, and there is exactly one middle term, the 5th term, Tn2+1=T5T_{\frac{n}{2}+1} = T_5. In the general term formula this corresponds to r=4r = 4 (since T5=Tr+1T_5 = T_{r+1} needs r=4r=4).

Step 2. Write the general term with a=xa=x, b=1xb=\dfrac{1}{x}, n=8n=8: Tr+1=8Cr x8−r(1x)r=8Cr x8−2rT_{r+1} = {}^8C_r\,x^{8-r}\left(\dfrac{1}{x}\right)^r = {}^8C_r\,x^{8-2r}.

Step 3. Substitute r=4r=4 to get the middle term: T5=8C4 x8−8=8C4 x0=8C4T_5 = {}^8C_4\,x^{8-8} = {}^8C_4\,x^0 = {}^8C_4. Compute 8C4=8!4! 4!=8×7×6×54×3×2×1=70{}^8C_4 = \dfrac{8!}{4!\,4!} = \dfrac{8\times7\times6\times5}{4\times3\times2\times1} = 70.

Step 4. Read off both answers together: since the middle term T5T_5 came out as 70 x070\,x^0, it is simultaneously the term with zero power of xx. The middle term is T5=70T_5 = 70, and the coefficient of x0x^0 in the expansion is also 7070 — here the two questions coincide because the exponent 8−2r8-2r vanishes exactly at the middle value r=4r=4.

Competitive stretch

If instead n=9n=9 (odd) in (x+1x)9\left(x+\frac{1}{x}\right)^9, there are two middle terms, T5T_5 and T6T_6, corresponding to r=4r=4 and r=5r=5: T5=9C4 x9−2(4)=9C4 x1=126xT_5 = {}^9C_4\,x^{9-2(4)} = {}^9C_4\,x^{1} = 126x, and T6=9C5 x9−2(5)=9C5 x−1=126xT_6 = {}^9C_5\,x^{9-2(5)} = {}^9C_5\,x^{-1} = \dfrac{126}{x} (using 9C4=9C5=126{}^9C_4={}^9C_5=126 by symmetry). Both middle terms come out with equal coefficients, as symmetry guarantees.

Common traps

  • Off-by-one indexing. For the pp-th term, use r=p−1r=p-1, not r=pr=p, in Tr+1T_{r+1} — this is the single most common slip in the whole topic.
  • Losing exponent signs with negative or fractional bb. Terms like (1x)r=x−r\left(\dfrac{1}{x}\right)^r = x^{-r} or (−3)r(-3)^r are easy to mishandle; write the exponent arithmetic out fully before simplifying.
  • Confusing a coefficient with the whole term. "The coefficient of x5x^5" means the numerical factor alone, not the full term with x5x^5 attached.
  • Forcing an answer when no valid rr exists. Solving for the power of xx must give an integer rr with 0≤r≤n0 \le r \le n; if it doesn't, that power simply is not present in the expansion.

Ask the tutor: Not sure whether to use r=p−1r=p-1 or r=pr=p for a specific term, or want another middle-term problem worked through? Ask the AI tutor to walk through one with you.

Why is the general term called T sub r plus 1 and not T sub r

Because the summation in the binomial theorem starts its counting index kk (or rr) at 00, while the terms of the expansion are conventionally numbered starting at 11. The term corresponding to r=0r=0 is the first term T1T_1, so a shift of one is built in: the term at index rr is always the (r+1)(r+1)-th term. Keeping this offset straight is exactly what the derivation in this article works through step by step, and it is the source of almost every indexing mistake students make.

How do I quickly tell which r gives a specific power of x without long algebra

Write the general term for your specific expansion first, simplify the power of xx into a single expression in rr (as in x8−2rx^{8-2r} or x20−3rx^{20-3r} in the worked examples), then set that expression equal to the target power and solve the resulting linear equation for rr. If rr comes out as a non-integer or outside 00 to nn, the power you want simply is not present — that is a valid, expected outcome, not a mistake to fix.

Do I need to memorise Pascal's triangle or can I always compute nCr directly

Either works, and both are worth having. Pascal's triangle is fast for small nn (up to about n=8n=8 or so) and builds intuition for the symmetry and Pascal's-rule properties, since each row is generated by adding adjacent entries from the row above. For larger nn, or when you only need one or two specific coefficients rather than the whole row, computing nCr=n!r!(n−r)!{}^nC_r = \dfrac{n!}{r!(n-r)!} directly is quicker and less error-prone than building out several rows of the triangle just to reach one number.

Before this