NDA Maths · Binomial Theorem
Sums of Binomial Coefficients
Sums of binomial coefficients are read off by substituting clever values of x into (1+x)ⁿ — x = 1 gives the total, x = −1 gives the alternating sum, and differentiating first gives the weighted sums.
Why this matters
14 PYQs. The whole subtopic runs on one idea: the coefficients ARE the expansion, so plug a number into the right identity. x = 1, x = −1, and 'differentiate then substitute' cover almost everything; the Pascal-rule identities mop up the rest.
Concept 1 of 4
Sum of All Coefficients — Put x = 1
Intuition
Definition
For any polynomial , the sum of all coefficients is . In particular:
- .
- Dropping the first term: .
- A weighted base: (e.g. ).
Sum of coefficients = f(1)
Worked example
- Sum of coefficients .
From the bank · past-year question
[Q46 · Apr · 2021]
Sum of coefficients uses x = 1, not x = 0
Concept 2 of 4
Alternating & Odd/Even-Index Sums — Put x = −1
Intuition
Definition
Substitute :
- Alternating sum: (for ).
- For a general polynomial, .
- Odd/even split: sum of even-index coefficients sum of odd-index coefficients . (They are equal because .)
- In , the odd-power terms cancel; in the difference, the even-power terms cancel.
Alternating sum and the split
Worked example
- The alternating sum is : substitute .
- .
From the bank · past-year question
[Q3 · Apr · 2020]
Concept 3 of 4
Weighted Sums via Differentiation
Intuition
Definition
Start from and differentiate:
- Put : .
- Put : for .
Multiplying by before differentiating, or differentiating twice, handles -type sums.
Index-weighted sum
Worked example
- This is .
- Differentiate : , then set .
From the bank · past-year question
[Q38 · Sep · 2023]
Differentiate first, substitute second
Concept 4 of 4
Pascal's Rule & Coefficient Identities
Intuition
Definition
The recurring identities:
- Pascal's rule: .
- Pascal applied twice: .
- Symmetry: , so the first and last coefficients are equal, and "coefficient of and in " are equal.
- Middle-term split: (Pascal's rule on the central coefficient).
Pascal's rule (applied twice)
Worked example
- Group as .
- Each bracket is Pascal's rule: .
- Apply Pascal's rule once more.
From the bank · past-year question
[Q28 · Apr · 2018]
Pascal's rule needs adjacent lower indices on the SAME n
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (4)
- Sum of All Coefficients — Put x = 1
Sum of coefficients = f(1)
- Alternating & Odd/Even-Index Sums — Put x = −1
Alternating sum and the split
- Weighted Sums via Differentiation
Index-weighted sum
- Pascal's Rule & Coefficient Identities
Pascal's rule (applied twice)
Watch out for (3)
- Sum of coefficients uses x = 1, not x = 0→ Sum of All Coefficients — Put x = 1
- Differentiate first, substitute second→ Weighted Sums via Differentiation
- Pascal's rule needs adjacent lower indices on the SAME n→ Pascal's Rule & Coefficient Identities
Mastery check — 5 interleaved questions
Try each one before clicking. Questions are interleaved across the concepts above, not grouped — interleaving sharpens transfer.
[Q4 · Apr · 2021]
[Q24 · Sep · 2019]
[Q39 · Sep · 2023]
[Q10 · Apr · 2018]
[Q2 · Sep · 2022]
Drill every past-year question on this subtopic
14 questions from the bank — paginated, with cart and Word-export support.