Trace it. Derive it. Know it.
Every cluster below maps one schematic path — from first principles to the final equation. Expand a node to follow the full derivation trace.
Binomial Theorem for Positive Integral Indices: Statement, Proof & General Term T(r+1)
3 concepts · 7.1How is (a + b)^n rigorously expanded for positive integers, and why is T_{r+1} the fundamental engine for locating specific terms?
For any positive integer n and any real or complex numbers a and b, the Binomial Theorem states that: (a + b)^n = sum_{r=0}^n C(n, r) a^(n-r) b^r = C(n, 0) a^n + C(n, 1) a^(n-1) b + C(n, 2) a^(n-2) b^2 + ... + C(n, n) b^n. The expansion consists of exactly (n + 1) terms. In each successive term, the power of a decreases monotonically by 1 from n to 0, while the power of b increases monotonically by 1 from 0 to n, ensuring that the sum of exponents in every individual term is strictly invariant and equal to n. The coefficients C(n, r) are identical to the entries in the n-th row of Pascal's Triangle, governed by Pascal's Addition Identity: C(n, r) + C(n, r-1) = C(n+1, r). The General Term is universally designated as T_{r+1} = C(n, r) a^(n-r) b^r. The index r starts at 0 for the first term (T_1 = C(n, 0) a^n) and ends at n for the final (n+1)-th term (T_{n+1} = C(n, n) b^n). Consequently, to evaluate the k-th term from the beginning, one must set r = k - 1. Conversely, the k-th term from the end of (a + b)^n is identical to the (n - k + 2)-th term from the beginning, or alternatively the k-th term from the beginning of (b + a)^n.
Pascal's Triangle & The Binomial Expansion Formula
(a + b)^n = sum_{r=0}^n C(n, r) a^(n-r) b^r. Contains n + 1 terms.
The General Term T_{r+1} & The Off-By-One Index Rule
T_{r+1} = C(n, r) a^(n-r) b^r. To find k-th term, substitute r = k - 1.
Terms from the End & Sum of All Numerical Coefficients
k-th term from end of (a + b)^n is k-th term from start of (b + a)^n. Sum of coeffs: evaluate at variables = 1.
Middle Terms, Term Independent of x & Numerically Greatest Term (NGT)
3 concepts · 7.2How are middle terms categorized by parity of n, how is the term independent of x extracted, and what ratio test isolates the Numerically Greatest Term?
This concept governs three critical positional and extremum inquiries in binomial expansions: (1) Middle Terms: The total number of terms in (a + b)^n is (n + 1). (A) When n is EVEN, (n + 1) is odd, meaning there is exactly ONE middle term located at the (n/2 + 1)-th position (corresponding to r = n/2). Its coefficient C(n, n/2) is the unique maximum binomial coefficient in the expansion. (B) When n is ODD, (n + 1) is even, meaning there are exactly TWO middle terms, located at positions (n + 1)/2 and (n + 3)/2 (corresponding to r = (n - 1)/2 and r = (n + 1)/2). Both middle terms possess identical, maximal coefficients: C(n, (n-1)/2) = C(n, (n+1)/2). (2) Term Independent of x (Constant Term): In expansions containing reciprocal powers of x, say (a x^p + b / x^q)^n, write the general term T_{r+1} and collect all powers of x into a single net exponent: x^(np - (p + q)r). Setting this exponent to 0 yields r = np / (p + q). A term independent of x exists if and only if r is an integer within {0, 1, ..., n}. (3) Numerically Greatest Term (NGT): For given numerical values of a and b, the term with the largest absolute magnitude |T_k| is determined by the ratio test: |T_{r+1} / T_r| >= 1. Expanding the ratio yields [(n - r + 1) / r] |b / a| >= 1, which rearranges to r <= (n + 1) / (1 + |a / b|). Let m = (n + 1) / (1 + |a / b|). Case A: If m is an integer, there are two consecutive greatest terms having equal absolute magnitude: T_m and T_{m+1}. Case B: If m is not an integer, there is a unique greatest term: T_{[m] + 1}, where [m] is the floor of m.
Middle Term Architecture (Even n vs Odd n)
Even n: 1 middle term at position n/2 + 1 (r = n/2). Odd n: 2 middle terms at (n+1)/2 and (n+3)/2.
Term Independent of x (Zero Exponent Extraction)
In (a x^p + b / x^q)^n, general power of x is np - (p+q)r. Set equal to 0: r = np / (p + q).
Numerically Greatest Term (NGT) via Discrete Ratio Test
Compute m = (n + 1) / (1 + |a/b|). If m is integer: T_m and T_{m+1} are greatest. If not: T_{[m]+1}.
Properties of Binomial Coefficients: Sums, Alternating Series & Calculus Identities
3 concepts · 7.3How do variable substitutions and calculus operations systematically evaluate complex summations of binomial coefficients?
Let C_r denote ^n C_r. The expansion (1 + x)^n = C_0 + C_1 x + C_2 x^2 + ... + C_n x^n serves as a generating function for an extensive family of combinatorial identities: (1) Substitution Identities: (A) Set x = 1: C_0 + C_1 + C_2 + ... + C_n = 2^n (Sum of all coefficients). (B) Set x = -1: C_0 - C_1 + C_2 - C_3 + ... + (-1)^n C_n = 0 (Alternating sum). (C) Sum of even/odd coefficients: Adding and subtracting gives C_0 + C_2 + C_4 + ... = C_1 + C_3 + C_5 + ... = 2^(n-1). (D) Complex substitution x = i: Equating real and imaginary parts of (1 + i)^n = [sqrt(2) e^(i pi/4)]^n yields alternating gap sums: C_0 - C_2 + C_4 - ... = 2^(n/2) cos(n pi/4) and C_1 - C_3 + C_5 - ... = 2^(n/2) sin(n pi/4). (2) Differentiation Method (Multiplier r C_r): When the summation index r appears as a linear multiplier in the term (r C_r), differentiate (1 + x)^n with respect to x: n(1 + x)^(n-1) = C_1 + 2 C_2 x + 3 C_3 x^2 + ... + n C_n x^(n-1). Setting x = 1 yields: sum_{r=1}^n r C_r = n 2^(n-1). Higher order terms like sum r^2 C_r are obtained by multiplying by x and differentiating a second time, giving n(n + 1) 2^(n-2). (3) Integration Method (Divisor C_r / (r+1)): When the index appears in the denominator, integrate (1 + x)^n: int_0^1 (1 + x)^n dx = [(1 + x)^(n+1) / (n + 1)]_0^1 = (2^(n+1) - 1) / (n + 1). Term-by-term integration yields: sum_{r=0}^n C_r / (r + 1) = (2^(n+1) - 1) / (n + 1).
Summation Identities via Algebraic Substitution (x = 1, -1, i)
C_0 + C_1 + ... + C_n = 2^n. C_0 + C_2 + ... = C_1 + C_3 + ... = 2^(n-1).
The Differentiation Method for Multiplied Coefficients (r C_r)
sum_{r=1}^n r C_r = n 2^(n-1). Second derivative: sum r^2 C_r = n(n+1) 2^(n-2).
The Integration Method for Divided Coefficients (C_r / (r+1))
sum_{r=0}^n C_r / (r+1) = (2^(n+1) - 1) / (n+1). Alternating: sum (-1)^r C_r / (r+1) = 1 / (n+1).
Products of Binomial Coefficients, Vandermonde's Convolution & Double Summations
3 concepts · 7.4How are sums of coefficient products evaluated by equating polynomial coefficients, and what governs double summations?
When combinatorial summations involve products of two binomial coefficients, standard single-polynomial substitution fails. The master strategy is to multiply two polynomials together and equate coefficients of a designated power of x on both sides: (1) Sum of Squares of Coefficients: Consider the identity (1 + x)^n (x + 1)^n = (1 + x)^(2n). Expanding the LHS: (C_0 + C_1 x + ... + C_n x^n)(C_0 x^n + C_1 x^(n-1) + ... + C_n). The coefficient of x^n in the LHS product is formed by pairing terms whose exponents sum to n: C_0 C_0 + C_1 C_1 + ... + C_n C_n = sum_{r=0}^n C_r^2. On the RHS, the expansion of (1 + x)^(2n) has general term C(2n, r) x^r, so the coefficient of x^n is simply C(2n, n). Hence: C_0^2 + C_1^2 + ... + C_n^2 = C(2n, n) = (2n)! / (n!)^2. (2) Products with a Constant Index Gap k: To evaluate sum_{r=0}^{n-k} C_r C_{r+k}, rewrite C_{r+k} = C_{n - r - k} using symmetry. The sum of lower indices is now r + (n - r - k) = n - k (a constant!). Equating the coefficient of x^(n - k) in (1 + x)^(2n) yields: sum C_r C_{r+k} = C(2n, n - k) = C(2n, n + k). (3) Vandermonde's Convolution: Generalizing to two different upper indices m and n: (1 + x)^m (1 + x)^n = (1 + x)^(m+n). Equating the coefficient of x^r yields: sum_{k=0}^r C(m, k) C(n, r - k) = C(m + n, r). (4) Double Summations: For sums of the form S = sum_{0 <= i < j <= n} C_i C_j, expand the algebraic square: (sum C_i)^2 = sum C_i^2 + 2 sum_{i < j} C_i C_j. Substituting known values (2^n)^2 = C(2n, n) + 2 S gives: sum_{0 <= i < j <= n} C_i C_j = [2^(2n) - C(2n, n)] / 2.
Sum of Squares of Binomial Coefficients: sum C_r^2 = C(2n, n)
C_0^2 + C_1^2 + ... + C_n^2 = C(2n, n) = (2n)! / (n!)^2.
Products with Constant Gap k: sum C_r C_{r+k} = C(2n, n - k)
sum_{r=0}^{n-k} C_r C_{r+k} = C(2n, n - k).
Double Summations: sum_{i < j} C_i C_j and Vandermonde Convolution
sum_{i < j} C_i C_j = [2^(2n) - C(2n, n)] / 2. Vandermonde: sum C(m, k) C(n, r-k) = C(m+n, r).
Binomial Theorem for Any Rational Index, Physics Approximations & Divisibility Remainders
3 concepts · 7.5When can (1 + x)^n be expanded for negative/fractional n, how does it model physics approximations, and how does modular binomial arithmetic find remainders?
This concept covers two high-yield extensions of the Binomial Theorem: (1) Binomial Theorem for Any Rational Index (n in Q): If n is negative or a non-integer fraction, (1 + x)^n can be expanded into an infinite series IF AND ONLY IF |x| < 1 (-1 < x < 1): (1 + x)^n = 1 + n x + [n(n-1)/2!] x^2 + [n(n-1)(n-2)/3!] x^3 + ... + [n(n-1)...(n-r+1)/r!] x^r + ... Unlike positive integers, this expansion contains an INFINITE number of terms and never terminates. If the first term is not 1, say (a + x)^n, one MUST factor out a^n: a^n (1 + x/a)^n, which converges if and only if |x/a| < 1 (|x| < |a|). Four Canonical Expansions: (A) (1 - x)^(-1) = 1 + x + x^2 + x^3 + ... (Infinite GP); (B) (1 + x)^(-1) = 1 - x + x^2 - x^3 + ...; (C) (1 - x)^(-2) = 1 + 2x + 3x^2 + 4x^3 + ...; (D) (1 + x)^(-2) = 1 - 2x + 3x^2 - 4x^3 + ... General term for (1 - x)^(-n) is T_{r+1} = C(n + r - 1, r) x^r. Fast Physics Approximation: When |x| << 1, higher powers x^2, x^3 are negligible, giving (1 + x)^n approx 1 + n x. (2) Divisibility and Remainder Problems: To find the remainder when a^n is divided by m, rewrite the base a as a power close to a multiple of m: a^k = q · m +- 1. Expand (q · m +- 1)^p using the Binomial Theorem: all terms contain m except the final term (+-1)^p. Thus, a^n = m · K + (+-1)^p. If (+-1)^p > 0, the remainder is (+-1)^p; if negative, the remainder is m + (+-1)^p.
Binomial Expansion for Any Rational Index (|x| < 1)
(1 + x)^n = 1 + nx + [n(n-1)/2!]x^2 + ... Valid if and only if |x| < 1. Infinite series.
Fast Physics Approximations: (1 + x)^n approx 1 + nx for |x| << 1
When x is much smaller than 1, ignore terms with x^2, x^3, ...: (1 + x)^n approx 1 + nx.
Divisibility & Remainder Problems via Base Adjustment Modulo m
Express a^k = q · m +- 1. Expand (q · m +- 1)^p = m · K + (+-1)^p to isolate the remainder.