Concept understanding — Binomial Theorem for Positive Integral Index
The Binomial Theorem for a positive integral index gives a single formula for expanding (a+b)n for any natural number n, without multiplying the bracket out by hand n times: (a+b)n=nC0anb0+nC1an−1b1+nC2an−2b2+⋯+nCna0bn, where the coefficients nC0,nC1,…,nCn are exactly the numbers that appear in Pascal's triangle. The theorem itself is proved using the Principle of Mathematical Induction, with Pascal's rule (kCr+kCr−1=k+1Cr) doing the work of the inductive step. A few structural facts follow immediately from the formula and are worth remembering as a checklist: the expansion always has exactly n+1 terms; the first term is an and the last is bn; in every term the exponents of a and b add up to n; moving along the expansion, the exponent of a steadily falls by one while that of b steadily rises by one; and the coefficients read the same from either end (they are symmetric), which mirrors the left-right symmetry of Pascal's triangle. For the subtraction case, (a−b)n has the same coefficients but with alternating signs, starting positive. This theorem underlies a large family of exam techniques: expanding an explicit power like (x2+3y)5; evaluating expressions like (3+2)4 where the surds partly cancel between a + and a − version; approximating a number like (2.02)5 or (9.9)3 by writing it as (a+b)n with a small b and truncating the series after a few decimal-significant terms; and instantly evaluating an expression that is secretly a full binomial expansion in disguise, such as (2x−1)4+4(2x−1)3(3−2x)+⋯+(3−2x)4, which collapses to [(2x−1)+(3−2x)]4.
Expand with n=5, a=5,b=−2; collect 5 terms and 2 terms separately.