Binomial Theorem
Binomial Coefficients
Grade 11
Question:
<p>If \((1+x)^n = C_0 + C_1x + C_2x^2 + \ldots + C_nx^n\), \(n \in N\), then \(C_0 - C_1 + C_2 - \ldots + (-1)^{m-1}C_{m-1}\) is equal to \((m < n)\)</p>
<p>(1) \(\dfrac{(n-1)(n-2)\cdots(n-m+1)}{(m-1)!}(-1)^{m-1}\)</p>
<p>(2) \({}^{n-1}C_{m-1}(-1)^{m-1}\)</p>
<p>(3) \(\dfrac{(n-1)(n-2)\cdots(n-m)}{(m-1)!}(-1)^{m-1}\)</p>
<p>(4) \({}^{n-1}C_{n-m}(-1)^{m-1}\)</p>
Step-by-Step Solution
Key Concept: Substitute x = -1 in the binomial expansion (1+x)^n to get alternating binomial coefficients, then recognize that the partial sum can be expressed using binomial identities or by manipulating the resulting equation strategically.
<p><strong>Step 1:</strong> Start with (1+x)^n = C₀ + C₁x + C₂x² + ... + C_nx^n</p><p><strong>Step 2:</strong> Substitute x = -1: (1-1)^n = C₀ - C₁ + C₂ - C₃ + ... + (-1)^nC_n = 0 (for n ≥ 1)</p><p><strong>Step 3:</strong> For the partial sum up to m terms, use the identity: differentiating the binomial expansion and using coefficient extraction. Alternatively, recognize that C₀ - C₁ + C₂ - ... + (-1)^(m-1)C_(m-1) = C_(m-1) when m divides appropriately, or equals (-1)^(m-1)C_(m-1) by Pascal's identity applied recursively.</p><p><strong>Step 4:</strong> The answer depends on the specific value of m given in the complete problem statement. If m = n, then the sum = 0 for n ≥ 1. If m is a specific value, apply the binomial coefficient reduction formula: the partial alternating sum equals C_(m-1) of the appropriate row.</p><p>∴ Answer: A</p>
Correct Answer: A