Binomial Coefficient Identities and Applications: JEE
Reviewed Last updated 2026-11-20. Syllabus topic: Binomial coefficient identities and simple applications.
In short. Substituting x = 1 and x = -1 in (1 + x)ⁿ gives the sum 2ⁿ and the equal even and odd sums 2^(n-1). With r C(n,r) = n C(n-1,r-1) and coefficient comparison, most identity and remainder questions reduce to one line.
- Sum of C(n,r) is 2ⁿ; the alternating sum is 0 for n at least 1; the even-r sum equals the odd-r sum, each 2^(n-1).
- Pascal rule C(n,r) + C(n,r-1) = C(n+1,r) and the identity r C(n,r) = n C(n-1,r-1).
- Sum of r C(n,r) = n 2^(n-1) and sum of r² C(n,r) = n(n+1) 2^(n-2).
- Comparing coefficients in (1 + x)ᵐ (1 + x)ⁿ = (1 + x)^(m+n) gives sums of products such as the sum of C(n,r)² = C(2n,n).
- For remainders write the base as a multiple of the divisor plus or minus 1 and keep only the first one or two terms of the expansion.
Syllabus line: BINOMIAL THEOREM AND ITS SIMPLE APPLICATIONS: Binomial theorem for a positive integral index, general term and middle term and simple applications. (NTA JEE (Main) 2026 syllabus, Mathematics, Unit 5 (https://jeemain.nta.nic.in/document/syllabus-2026/))
Before you start
Prerequisites
- Binomial theorem for a positive integral index and the general term: The identities come from setting values in the expansion. Read this first if the expansion itself is not secure.
- Combinations and selections: C(n,r) is the engine of every term. Read this first if C(n,r) = n!/(r!(n-r)!) or C(n,r) = C(n,n-r) is not automatic.
Related topics
- Binomial theorem for a positive integral index and the general term
- Middle term, term independent of x and coefficient problems
- Binomial Theorem (lesson planned)
The concept step by step
Step 1: The sum of a row
Setting x = 1 in (1 + x)ⁿ gives C(n,0) + C(n,1) + ... + C(n,n) = 2ⁿ. This is the same statement as counting all subsets of an n-element set, by size on one side and by yes-or-no choices on the other. It is the base identity for the whole chapter, and every other sum is a variation of it.
Step 2: Alternating sums and the even-odd split
Setting x = -1 gives C(n,0) - C(n,1) + C(n,2) - ... = 0 for n at least 1. Adding it to the sum of the row shows that the even-r terms add to 2^(n-1), and subtracting shows that the odd-r terms add to the same 2^(n-1). So half the row total belongs to each parity.
Step 3: Pulling r out of C(n,r)
The factorial form gives r C(n,r) = n C(n-1,r-1). Then the sum of r C(n,r) is n times a row sum of the smaller row, so it equals n 2^(n-1). For r² split r² = r(r-1) + r and use the same idea twice. The result n(n+1) 2^(n-2) is worth remembering.
Step 4: Products of binomial rows
Because (1 + x)ᵐ (1 + x)ⁿ = (1 + x)^(m+n), comparing the coefficient of xᵏ gives the sum of C(m,r) C(n,k-r) = C(m+n,k). With m = n = k this evaluates the sum of squares C(n,r)² as C(2n,n).
Step 5: Remainders and last digits
To find aⁿ mod d, write a = (multiple of d) plus or minus a small number, expand with the binomial theorem and keep only terms not divisible by d. Usually one or two terms survive. Finally make sure the remainder is non-negative: a result of -1 means d - 1.
Worked examples
Each solution shows the marks every step would earn. The sanity check tests units and size of the answer.
Example 1 (easy)
Find the sum of C(8,r) over all odd r.
| Step | Marks |
|---|---|
| Put x = 1 and x = -1 in (1 + x)⁸: the sums of even-r and odd-r coefficients are equal. | 1 |
| Total 2⁸ = 256, so each part is 256/2. | 1 |
| The sum over odd r is 128. | 1 |
| Total: 3 marks | 3 |
Answer: 128
Fast method: Even-r sum = odd-r sum = 2^(n-1) for n at least 1.
Sanity check: C(8,1) + C(8,3) + C(8,5) + C(8,7) = 8 + 56 + 56 + 8 = 128.
Example 2 (easy)
Evaluate the sum of C(10,r) 3^r for r = 0 to 10.
| Step | Marks |
|---|---|
| This is the expansion of (1 + 3)¹0 with a = 1, b = 3. | 1 |
| So the sum is 4¹0. | 1 |
| 4¹0 = 1048576. | 1 |
| Total: 3 marks | 3 |
Answer: 1048576
Fast method: Recognise the expansion of (1 + b)ⁿ.
Sanity check: 4¹0 = 2²0 = 1048576, which is a little above 10⁶, as expected.
Example 3 (medium)
Find the sum of r C(12,r) for r = 1 to 12.
| Step | Marks |
|---|---|
| Use r C(n,r) = n C(n-1,r-1) (choose a committee and then its chair). | 1 |
| Sum = 12 x (sum of C(11,s) for s = 0 to 11) = 12 x 2¹1. | 1 |
| 12 x 2048 = 24576. | 1 |
| Total: 3 marks | 3 |
Answer: 24576
Fast method: n 2^(n-1) with n = 12.
Sanity check: The average r under the binomial row is n/2 = 6 and the row sums to 2¹2 = 4096, so 6 x 4096 = 24576.
Example 4 (medium)
Find the sum of C(10,r) for r = 0 to 5.
| Step | Marks |
|---|---|
| The row C(10,0), ..., C(10,10) sums to 2¹0 = 1024 and is symmetric about r = 5. | 1 |
| The sum for r = 0 to 4 equals the sum for r = 6 to 10, so each is (1024 - C(10,5))/2 = (1024 - 252)/2 = 386. | 2 |
| Add the central term: 386 + 252 = 638. | 1 |
| Total: 4 marks | 4 |
Answer: 638
Fast method: Half of (2ⁿ + C(n, n/2)) when the central term is included.
Sanity check: Slightly more than half of 1024 (which is 512), namely 638, because the central term 252 is included.
Example 5 (medium)
Find the last two digits of 11²5.
| Step | Marks |
|---|---|
| 11²5 = (1 + 10)²5 = 1 + 25 x 10 + C(25,2) x 100 + ... | 1 |
| Terms from 100 onwards are multiples of 100, so modulo 100 only 1 + 250 remain. | 1 |
| 251 mod 100 = 51, so the last two digits are 51. | 1 |
| Total: 3 marks | 3 |
Answer: 51
Fast method: Write the base as 1 + 10 and keep the terms below 100.
Sanity check: 11²5 ends in 1 (powers of 11 end in 1) and 51 satisfies that.
Example 6 (hard, multi-step)
Find the sum of C(5,r) C(7,3-r) for r = 0 to 3.
| Step | Marks |
|---|---|
| Consider the coefficient of x³ in (1 + x)⁵ (1 + x)⁷ = (1 + x)¹2. | 1 |
| On the left, x³ arises as x^r from the first factor and x^(3-r) from the second, giving exactly the sum. | 2 |
| On the right the coefficient of x³ is C(12,3) = 220. | 1 |
| Total: 4 marks | 4 |
Answer: 220
Fast method: Compare coefficients of the same power on both sides of (1 + x)ᵐ (1 + x)ⁿ = (1 + x)^(m+n).
Sanity check: Choosing 3 people from 5 + 7 = 12, split by how many come from the first group, must total C(12,3) = 220.
Example 7 (hard, multi-step)
Find the remainder when 6⁸3 + 8⁸3 is divided by 49.
| Step | Marks |
|---|---|
| Write 6 = 7 - 1 and 8 = 7 + 1, so the sum is (7 - 1)⁸3 + (7 + 1)⁸3. | 1 |
| Terms with an odd power of 7 doubled survive and the others cancel; since 7² = 49, only the term with 7¹ matters: 2 x C(83,1) x 7 plus multiples of 49. | 2 |
| 2 x 83 x 7 = 1162 = 23 x 49 + 35, so the remainder is 35. | 2 |
| Total: 5 marks | 5 |
Answer: 35
Fast method: Both bases are 7 plus or minus 1; only the linear term in 7 survives modulo 49.
Sanity check: A remainder must lie between 0 and 48; 35 does, and 1162 = 1127 + 35 checks the division.
Formulas and units
| Result | Formula | Valid when | Units or note | Worked example |
|---|---|---|---|---|
| Sum of coefficients | sum of C(n,r) = 2ⁿ | n is a non-negative integer | dimensionless | Example 1 |
| Alternating sum | sum of (-1)^r C(n,r) = 0 for n >= 1 | n is a positive integer (n >= 1) | dimensionless | Example 1 |
| Even-r and odd-r sums | each 2^(n-1) | n is a positive integer (n >= 1) | dimensionless | Example 1 |
| Pascal rule | C(n,r) + C(n,r-1) = C(n+1,r) | n >= 1 integers, 1 <= r <= n | dimensionless | none |
| r times C(n,r) | r C(n,r) = n C(n-1,r-1); sum = n 2^(n-1) | n is a positive integer | dimensionless | Example 3 |
| r squared | sum of r² C(n,r) = n(n+1) 2^(n-2) | n is a positive integer (n >= 1) | dimensionless | none |
| Product of rows | sum of C(m,r) C(n,k-r) = C(m+n,k) | m, n, k non-negative integers (Vandermonde) | dimensionless | Example 6 |
| Sum of squares | sum of C(n,r)² = C(2n,n) | n is a non-negative integer | dimensionless | none |
Common mistakes and speed
- Taking half of 2ⁿ for a half-row of even n without adding the central term. Why it tempts: The symmetry argument for odd n is so clean that the same step seems valid for even n.
- Starting the sum of r C(n,r) from r = 0 and counting a non-zero r = 0 term, or forgetting that the r = 0 term is 0. Why it tempts: The formula n 2^(n-1) hides the zero term, so the lower limit is not checked.
- Leaving a negative remainder (-1) instead of d - 1. Why it tempts: The binomial step ends neatly with -1 and the step of adding the divisor looks like extra work.
- Using (1 + x)ⁿ coefficients when the sum has C(n,r)², forgetting the product trick. Why it tempts: The sum looks like a sum of C(n,r), so 2ⁿ is tried first.
Time per question and fast method
Target: about 90 seconds per question.
Identify the pattern before computing: a plain sum is 2ⁿ, a sum with r is n 2^(n-1), a sum with b^r is (1 + b)ⁿ, a sum of products is a coefficient of a product. For remainders write the base as multiple of the divisor plus or minus 1.
Recall quiz
Pick an option for each question. Your answers stay on this page and are not sent anywhere.
Score: 0 of 6 correct. Pick an option for each question.
Practice
- The value of the sum of C(20,r) for r = 0, 1, 2, ..., 10 is Verified (T1)
- The remainder when 7²026 is divided by 50 is Verified (T3)
- The value of the sum of r² C(10,r) for r = 0 to 10 is Verified (T1)
- The term independent of x in the expansion of (1 + x)⁸ (1 + 1/x)⁸ is Verified (T1)
Previous-year questions
Previous-year questions are not imported yet. Previous-year questions are not imported yet; see the official papers on the NTA site. Official NTA papers page.
Going deeper and revision
Sums of coefficients by substitution
Putting x = 1 in (1 + x)ⁿ = sum of C(n,r) x^r gives C(n,0) + C(n,1) + ... + C(n,n) = 2ⁿ. Putting x = -1 gives the alternating sum C(n,0) - C(n,1) + C(n,2) - ... = 0 for n at least 1. Adding and subtracting the two results shows that the sum of the even-r coefficients equals the sum of the odd-r coefficients and each is 2^(n-1). The same idea with (1 + b)ⁿ evaluates sums like the sum of C(n,r) b^r = (1 + b)ⁿ. For sums over half a row use the symmetry C(n,r) = C(n,n-r): for odd n the first half is exactly 2^(n-1); for even n it is (2ⁿ + C(n, n/2))/2 if the central term is included.
Identities for r times C(n,r) and Pascal's rule
From the factorial form, r C(n,r) = n C(n-1,r-1), which is the count of choosing a committee with a chair. Pascal's rule is C(n,r) + C(n,r-1) = C(n+1,r). Using the first identity, the sum of r C(n,r) = n times the sum of C(n-1,r-1) = n 2^(n-1). For r² write r² = r(r-1) + r and use r(r-1) C(n,r) = n(n-1) C(n-2,r-2), which gives the sum of r² C(n,r) = n(n-1) 2^(n-2) + n 2^(n-1) = n(n+1) 2^(n-2). Alternatively differentiate (1 + x)ⁿ and set x = 1. These sums are what examiners ask for in single-line numerical form.
Comparing coefficients of a product
The identity (1 + x)ᵐ (1 + x)ⁿ = (1 + x)^(m+n) holds for every x, so the coefficient of xᵏ on both sides is equal. On the left the coefficient of xᵏ is the sum over r of C(m,r) C(n,k-r), on the right it is C(m+n,k). With m = n = k this gives the sum of C(n,r)² = C(2n,n), which also evaluates the term independent of x in (1 + x)ⁿ (1 + 1/x)ⁿ. The same trick is the counting statement that choosing k people from two groups can be split by how many come from the first group.
Simple applications: remainders, digits and divisibility
To find the remainder of aⁿ on division by d, write a as a multiple of d plus or minus a small number, expand with the binomial theorem and keep the few terms that are not multiples of d. For example 7²026 = (50 - 1)¹013, which is a multiple of 50 minus 1, so the remainder is 50 - 1 = 49 (never leave a negative remainder). For last digits use d = 10 or 100 with base 1 + 10k. Edge cases: when d has square factors, you may need two or three terms; always check the final remainder lies in 0 to d - 1, and verify by a small case.
Memory hook
Suppose six friends are deciding who goes to a cricket match from a group chat, and any number from none to all six may go. Each friend either goes or stays, so there are 2 x 2 x 2 x 2 x 2 x 2 = 64 possible plans.
- Suppose we count the plans by how many friends go instead: none gives C(6,0) = 1 plan, one gives 6, two give 15, three give 20, four give 15, five give 6, all six give 1.
- Adding, 1 + 6 + 15 + 20 + 15 + 6 + 1 = 64, the same total as the direct count of 2⁶.
- So the sum of C(6,r) over all r equals 2⁶, and in the same way the plans with an even number of friends (1 + 15 + 15 + 1 = 32) equal those with an odd number (6 + 20 + 6 = 32).
Counting subsets by size and counting them by independent yes-or-no choices must agree, which gives the sum of C(n,r) = 2ⁿ.
Count subsets two ways and the identity falls out.
Revision card
Try to answer each without looking above.
- What is the sum of C(n,r) over r, and why?
- What do the even-r and odd-r sums equal?
- State r C(n,r) = n C(n-1,r-1) and the sum of r C(n,r).
- How do you evaluate the sum of r² C(n,r)?
- What does comparing coefficients in (1 + x)ᵐ (1 + x)ⁿ give?
- How do you find a remainder using the binomial expansion?
Sources and review
Reviewed Reviewed on 2026-11-20: every number recomputed by code and independently reviewed; textbook section references pending.
- Method: Every number in worked examples, recall checks and notes recomputed by code; claims recomputed independently by a separate verifier run using other numerical methods; textbook section references not yet attached; wording defects found were fixed afterwards and re-linted (code checks re-run) but not re-reviewed by a second run; syllabus scope compared with the NTA JEE Main 2026 syllabus text (by the verifier; see the report)
- Reviewer: independent verifier agent run (not the author)
- Date: 2026-11-20
- Defects found: 2; fixed: 2
- Report: content/reviews/learn3-bin-2026-11-20.md
Textbook references
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 7: Binomial Theorem, 7.2.2 Some special cases (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.4 Combinations (read 2026-11-22)
Sources used
- Syllabus: NTA JEE (Main) 2026 syllabus, Mathematics, Unit 5, line id jee-main-2026-U05 in syllabus/lines/jee-main/2026.json
- NCERT Class 11 Mathematics, Binomial Theorem (read as a reference for scope only; content written fresh for this site, textbook section references still pending)
How labels work: see how answers and lessons are verified. Found a mistake? Use Report an error on any question page.