Chapter 8 — Binomial Theorem

The binomial theorem gives a systematic way to expand powers of a sum of two terms, i.e. (a + b)ⁿ for a non-negative integer n. Instead of multiplying (a + b) by itself n times, the theorem expresses the expanded form as a sum of terms with coefficients that depend only on n and the position of the term.

Motivation:

• Manual expansion by repeated multiplication quickly becomes tedious for large n. A pattern in the coefficients (Pascal's triangle) lets us write the expansion directly.
• Coefficients in the expansion are combinatorial: they count the number of ways to choose how many times b appears when multiplying n factors (a + b), so algebra and counting are linked.
• Knowing the expansion simplifies computation in algebra, calculus (series approximations), probability (distributions of successes in independent trials), and other applied areas.

Basic examples show the pattern of coefficients:

• (a + b)¹ = a + b
• (a + b)² = a² + 2ab + b²
• (a + b)³ = a³ + 3a²b + 3ab² + b³
• (a + b)⁴ = a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴

These coefficients (1, 2, 1), (1, 3, 3, 1), (1, 4, 6, 4, 1) form rows of Pascal's triangle and are binomial coefficients C(n, k). The triangle provides a fast way to read coefficients and demonstrates recursive relations.

Combinatorial interpretation: In (a + b)ⁿ, each expanded term corresponds to choosing b from some of the n factors and a from the rest. Choosing exactly k factors to contribute b produces the term C(n, k) a^n-kb^k, because there are C(n, k) ways to choose which k factors supply b.

Class 11 focuses on positive integer exponents and introduces these ideas so students can expand powers quickly, understand the link with combinations, and apply the result to problems in algebra and probability.

Definition: Pascal's Triangle is a triangular array of numbers in which each entry is the sum of the two entries directly above it. The top row (row 0) is 1. Row n (starting from 0) contains the binomial coefficients C(n,0), C(n,1), ..., C(n,n).

Construction (recursive rule):

• Start with row 0: 1.
• Each new row begins and ends with 1.
• Each interior entry = sum of the two entries above it: entry(n,k) = entry(n-1,k-1) + entry(n-1,k).

Connection to binomial coefficients and Binomial Theorem: The entry in row n and position k equals the binomial coefficient C(n,k) = n!/(k!(n-k)!). These are the coefficients in the expansion of (a + b)ⁿ:

(a + b)^n = Σ_{k=0}^n C(n,k) a^{n-k} b^k

So the nth row of Pascal's Triangle gives the coefficients of (a + b)ⁿ.

Key properties and patterns:

• Symmetry: C(n,k) = C(n,n-k). Each row is symmetric about its center.
• Row sum: Sum of entries in row n = 2ⁿ.
• Recursive identity: C(n,k) = C(n-1,k-1) + C(n-1,k).
• Hockey-stick identity: For fixed r, Σ_{i=r}^n C(i,r) = C(n+1,r+1).
• Diagonals: First diagonal: all 1s; second diagonal: natural numbers; third diagonal: triangular numbers; fourth diagonal: tetrahedral numbers, etc.
• Mod patterns: Taking entries mod 2 produces the Sierpiński triangle fractal.
• Alternating sum: Σ_{k=0}^n (-1)^k C(n,k) = 0 for n ≥ 1.

How it helps in problem solving (Class 11 context): Use Pascal's Triangle to read off binomial coefficients quickly when expanding (a + b)ⁿ, to compute combinations C(n,k) for counting problems, and to recognize patterns (sums, identities) useful in algebraic simplification and proofs.

Factorial (n!)
For a nonnegative integer n, the factorial n! is the product of all positive integers up to n:

n! = n × (n - 1) × (n - 2) × ... × 2 × 1, with 0! = 1.

Key recurrence: n! = n × (n - 1)!. Negative integers do not have factorials in the usual sense.

Combinations (Binomial Coefficients)
Combinations count the number of ways to choose r objects from n distinct objects when order does not matter. Denoted by C(n, r) or \(\binom{n}{r}\), the formula is

\(\displaystyle \binom{n}{r} = \frac{n!}{r!(n-r)!}\), for integers 0 ≤ r ≤ n.

Derivation (idea)
First count ordered selections (permutations): number of ways to pick r ordered items from n is P(n, r) = n!/(n - r)!. Each unordered selection of r items corresponds to r! orderings, so divide by r! to get combinations.

Important properties

• Symmetry: \(\binom{n}{r} = \binom{n}{n-r}\).
• Boundary values: \(\binom{n}{0} = \binom{n}{n} = 1\).
• Recurrence (Pascal's rule): \(\binom{n}{r} = \binom{n-1}{r} + \binom{n-1}{r-1}\).
• Sum of row: \(\sum_{r=0}^{n}\binom{n}{r} = 2^{n}\).
• Relation to binomial theorem: coefficients of (a + b)^{n} are \(\binom{n}{r}\): \((a+b)^{n} = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^{r}.\)

When to use combinations vs permutations
If order matters (arrangements, sequences) use permutations P(n,r). If order does not matter (committees, selections) use combinations C(n,r).

Computation notes
For large n compute with cancellation in numerator/denominator or use logarithms/Stirling approximation: n! ~ sqrt(2πn) (n/e)^{n} for large n.

Definition. For a nonnegative integer n, the binomial expansion of (a + b)ⁿ is

(a + b)ⁿ = Σ_r=0ⁿ  {ⁿC_r} a^n−r b^r

The general term (also called the (r+1)-th term) is

T_r+1 = {ⁿC_r} a^n−r b^r,  for r = 0, 1, 2, ..., n.

Notation. The binomial coefficient {ⁿC_r} (read 'n choose r') is

{ⁿC_r} = n! / (r! (n−r)!),

where n! = n·(n−1)·...·1 and 0! = 1. It counts the number of ways to choose r items from n without order.

Properties often used with the general term:

• Symmetry: {ⁿC_r} = {ⁿC_n−r}.
• Recurrence (Pascal): {ⁿC_r} = {ⁿ⁻¹C_r−1} + {ⁿ⁻¹C_r}.
• Sum of coefficients: Σ_r=0ⁿ {ⁿC_r} = 2ⁿ.

Middle term(s). If n is even, there is one middle term at r = n/2 (term number n/2 + 1). If n is odd, there are two middle terms at r = (n−1)/2 and r = (n+1)/2.

Term independent of a variable. For expansions like (x + 1/x)ⁿ, the general term is {ⁿC_r} x^n−2r. A term independent of x occurs when n − 2r = 0 (i.e. r = n/2).

General (infinite) binomial series for noninteger exponent. For real or complex α and |x| < 1,

(1 + x)^α = Σ_r=0^∞ {α choose r} x^r,

where {α choose r} = α(α−1)(α−2)...(α−r+1)/r! (and {α choose 0} = 1). In this series the general term is T_r+1 = {α choose r} x^r.

How to use the general term: Identify a and b in (a + b)ⁿ (or write the expression so one factor is 1+something for the infinite series), substitute r, compute the coefficient {ⁿC_r}, and evaluate a^n−r b^r. This gives any specific term without expanding all previous terms.

Definition. For the binomial expansion (a + b)ⁿ = Σ_r=0ⁿ C(n,r) a^n−r b^r, the general (r+1)-th term is

Tr+1 = C(n,r) an−r br,   r = 0,1,...,n.

The number of terms is n+1. The middle term(s) depend on whether n is even or odd:

• n even (n = 2m): there is one middle term at r = m. The unique middle term is

Tm+1 = C(2m,m) am bm.

• n odd (n = 2m+1): there are two middle terms at r = m and r = m+1. They are

Tm+1 = C(2m+1,m) am+1 bm,   Tm+2 = C(2m+1,m+1) am bm+1.

Notes and properties:

• Binomial coefficients are symmetric: C(n,r) = C(n,n−r). This symmetry produces the central peak(s) in the coefficients.
• When a = b, the central term(s) give the largest contribution (for a,b positive and equal) because coefficients peak at the center.
• To find the middle term(s) quickly: compute m = floor(n/2). If n even, take r = n/2. If n odd, take r = (n−1)/2 and r = (n+1)/2.

Definition and combinatorial meaning
The binomial coefficient C(n, k) (also written as nCk or \(\binom{n}{k}\)) is the number of ways to choose k objects from n distinct objects, without order: C(n,k) = n! / (k!(n-k)!). It appears as the coefficient of x^k in the binomial expansion (1 + x)^n = \sum_{k=0}^n C(n,k) x^k.

Basic properties (with short explanations)

• Boundary values: C(n,0) = C(n,n) = 1 (choose none or all).
• Symmetry: C(n,k) = C(n,n-k). Combinatorial reason: choosing k to include is same as choosing n−k to exclude.
• Pascal's identity (recurrence): C(n,k) = C(n-1,k) + C(n-1,k-1). Proof: consider a particular element — either it is not chosen (C(n-1,k) ways) or it is chosen (C(n-1,k-1) ways).
• Pascal's triangle: Coefficients for successive n form rows of Pascal's triangle; each entry is the sum of the two above it (direct consequence of Pascal's identity).
• Monotonicity: For fixed n, C(n,k) increases with k for k ≤ floor(n/2) and then decreases symmetrically.

Important sum identities and moments

• Sum of all coefficients: \sum_{k=0}^n C(n,k) = 2^n. This follows from (1+1)^n.
• Alternating sum: \sum_{k=0}^n (-1)^k C(n,k) = 0 for n ≥ 1, from (1-1)^n.
• First moment (weighted sum): \sum_{k=0}^n k C(n,k) = n 2^{n-1}. Derivation: differentiate (1+x)^n and set x=1, or use k C(n,k) = n C(n-1,k-1).
• Second moment: \sum_{k=0}^n k^2 C(n,k) = n(n+1)2^{n-2}. (Use differentiation twice or derive from identities for k and k(k-1).)
• Hockey-stick identity (Christmas stocking): For integers r ≥ 0 and n ≥ r, \sum_{i=r}^n C(i,r) = C(n+1,r+1). Combinatorial view: choose r+1 people with the largest chosen person's index varying.

Convolution identity (Vandermonde's identity)
For nonnegative integers r, s and n, \sum_{k=0}^n C(r,k) C(s,n-k) = C(r+s,n). Combinatorial proof: choosing n from two disjoint groups of sizes r and s; k chosen from the first group and n−k from the second.

Other useful relations

• k C(n,k) = n C(n-1,k-1).
• C(n,k) = 0 if k < 0 or k > n (convention used in many combinatorial proofs).
• Generalised binomial coefficient for real α: C(α,k) = α(α-1)…(α-k+1)/k! (used for series expansion of (1+x)^α), usually beyond Class 11 scope but useful to know.

Proof techniques and tips
Many identities admit both algebraic proofs (using factorial formula or generating functions and differentiation) and combinatorial proofs (count the same set in two ways). For Class 11, focus on combinatorial reasoning and Pascal-based algebraic derivations.

Connections and applications
Binomial coefficients appear in counting problems (committee formation, lottery probabilities), binomial probability distribution (coin tosses), coefficients in polynomial expansions, Pascal's triangle patterns in physics/architecture, and many identities used in algebra and problem-solving.

Idea: For a binomial expansion (a + b)^n with integer n ≥ 0, every term arises from choosing how many times we pick b vs a. The general (r+1)-th term is given by the binomial coefficient times appropriate powers of a and b. To find a specific term (for example the term containing a certain power of x) we write the general term, equate the required power, solve for r, and evaluate the coefficient.

General term (finite integer n):

T_{r+1} = C(n,r) a^{n-r} b^{r} where C(n,r)=n!/(r!(n-r)!) and r = 0,1,2,...,n.

Finding coefficient of x^k in (ax + b)^n: write the general term as C(n,r) a^{n-r} b^{r} x^{n-r}. For x^k we need n - r = k so r = n - k. Then coefficient = C(n,n-k) a^{k} b^{n-k} (or equivalently C(n,k) a^{k} b^{n-k}).

Constant (term independent of x) in expansions like (x + c/x)^n: write general term C(n,r) x^{n-r} (c x^{-1})^{r} = C(n,r) c^{r} x^{n-2r}. For constant term require n - 2r = 0, so r = n/2 (n must be even).

Key observations: coefficients are symmetric: C(n,r)=C(n,n-r). Middle term(s): if n is even there is one middle term T_{(n/2)+1}; if n is odd there are two middle terms T_{(n+1)/2} and T_{(n+3)/2}.

Note: For non-integer or negative exponents one uses the generalized binomial series with coefficients C(α,r)=α(α-1)...(α-r+1)/r!, but that belongs to advanced topics.

Overview: The Binomial Theorem for a non-negative integer n gives the expansion of (a + b)^n as a finite sum of terms involving binomial coefficients. Applications and problem solving use the theorem to extract specific terms (coefficients, middle terms, term independent of a variable), prove combinatorial identities, approximate expressions for small variables and solve counting problems.

Key ideas and strategies:

• General term (use to find any specific term): if (a + b)^n, the (r+1)-th term is T_{r+1} = C(n,r) a^{n-r} b^r, where C(n,r) = n!/(r!(n-r)!).
• To find the coefficient of a particular power of x, express each base (a or b) as a power of x and equate exponents to solve for r.
• Term independent of x (constant term): set the net exponent of x to zero and solve for r. If no integer r satisfies the equation, there is no constant term.
• Middle term(s): if n = 2m (even) there is one middle term T_{m+1}; if n = 2m+1 (odd) there are two middle terms T_{m+1} and T_{m+2}.
• Use algebraic manipulations (factor out constants, change variable signs) to match the binomial form and simplify extraction of coefficients.
• Proving identities: differentiate the binomial expansion or use combinatorial arguments (counting subsets) to derive identities involving binomial coefficients.
• Approximation: for small |x|, (1 + x)^n ≈ 1 + nx + n(n-1)/2 x^2 + ... (truncation gives a polynomial approximation; compare with exact expansion for error).

Common applications: finding specific coefficients in polynomial expansions, determining the term independent of a variable, proving sums and weighted sums of binomial coefficients (like Σ C(n,r) = 2^n and Σ r C(n,r) = n2^{n-1}), and simple approximations for small perturbations.

Problem-solving tips:

1. Write the expression in the form (A + B)^n with A and B simplified (factor constants or powers of x).
2. Use the general term to express the power of x and equate exponents to find r.
3. Compute the coefficient by evaluating C(n,r) and any numeric factors from A^{n-r} and B^r.
4. For identities, consider algebraic methods (differentiate or integrate known expansions) or combinatorial interpretations.