A complete deep dive into the binomial theorem and combinatorics for HSC Mathematics Extension 1. Counting principles, permutations, combinations, the binomial theorem in full, Pascal's triangle, standard exam techniques (general term, independent term, sum identities), and an embedded practice question set with full solutions.
What this guide covers
The binomial theorem and the underlying combinatorics are bread-and-butter Extension 1 topics. They appear in Section II most years, often as a 4-mark coefficient question or a 3-mark identity proof.
This guide covers:
- The fundamental counting principles (multiplication, addition, complementary).
- Permutations and combinations with worked examples.
- The binomial theorem in full, including the general term.
- Standard exam techniques: coefficient of xk, term independent of x, identity proofs.
- Sum identities like ∑(kn)=2n.
- Ratio of consecutive terms and the greatest binomial coefficient.
Counting principles
The multiplication principle
If a procedure has steps 1,2,…,k and step i can be done in ni ways (independent of the previous steps), the total number of ways is n1⋅n2⋯nk.
The addition principle
If a procedure can be completed in one of several disjoint ways, the total is the sum of the counts for each way.
Complementary counting
(at least 1)=(total)−(none).
For "at least" and "at most" problems, the complement is often easier.
Permutations
The number of ways to arrange n distinct objects in a row is n!. To arrange r out of n: nPr=(n−r)!n!.
For objects with repeats (say n1 of one kind, n2 of another), the number of distinct arrangements is
n1!n2!⋯nk!n!.
Circular arrangements of n distinct objects: (n−1)! (fix one to break rotational symmetry).
Combinations
The number of unordered selections of r from n distinct objects is
(rn)=r!(n−r)!n!.
Key identities:
- Symmetry: (rn)=(n−rn).
- Pascal's rule: (rn)=(r−1n−1)+(rn−1).
- Sum: ∑r=0n(rn)=2n.
The binomial theorem
For any non-negative integer n,
(a+b)n=k=0∑n(kn)an−kbk.
The general term is
Tk+1=(kn)an−kbk.
So T1=an (when k=0) and Tn+1=bn (when k=n).
Pascal's triangle
The first few rows:
111121133114641151010511615201561
Each row n gives the coefficients of (a+b)n.
Standard exam techniques
Find the coefficient of a specific power
The general term is Tk+1=(kn)an−kbk. Identify the power of the variable in Tk+1, set it equal to the target, and solve for k.
Find the coefficient of
x3 in the expansion of
(2x+5)7Step 1. Write the general term. With a=2x, b=5, n=7:
Tk+1=(k7)(2x)7−k(5)k=(k7)27−k5kx7−k.
Step 2. Match the target power. The power of x is 7−k. Set 7−k=3, so k=4.
Step 3. Substitute k=4. Pick off the coefficient at this value of k.
T5=(47)2354x3.
Step 4. Evaluate the numerical factors. Compute (47)=35, 23=8, 54=625.
Coefficient=35⋅8⋅625=175000.
The coefficient of x3 in (2x+5)7 is 175000.
Find the term independent of the variable
The general term Tk+1 has some power of x formed from the two factors. Set the power to 0 and solve for k.
Find the term independent of
x in the expansion of
(x2+x3)6Step 1. Write the general term. With a=x2, b=3/x, n=6:
Tk+1=(k6)(x2)6−k(x3)k=(k6)3kx2(6−k)−k=(k6)3kx12−3k.
Step 2. Set the power of x to zero. For the term to be independent of x, 12−3k=0, so k=4.
Step 3. Substitute k=4.
T5=(46)34.
Step 4. Evaluate. (46)=15 and 34=81, so the term is 15⋅81=1215.
The term independent of x is 1215.
Coefficient of xk in a product of two binomial expansions
For an expression like (a+bx)n(c+dx)m, the coefficient of xk comes from summing all ways to pick a power xj from the first factor and xk−j from the second.
Find the coefficient of
x4 in the expansion of
(1+2x)5(1−x)4- Step 1. Identify the general terms
- From (1+2x)5 the term in xj is (j5)2jxj. From (1−x)4 the term in xi is (i4)(−1)ixi.
- Step 2. Set up the convolution
- To get x4, choose j+i=4 with 0≤j≤5 and 0≤i≤4. The valid pairs (j,i) are (0,4), (1,3), (2,2), (3,1), (4,0).
- Step 3. Compute each contribution
- Multiply the two coefficients for each pair.
- (0,4): (05)20⋅(44)(−1)4=1⋅1⋅1⋅1=1.
- (1,3): (15)21⋅(34)(−1)3=5⋅2⋅4⋅(−1)=−40.
- (2,2): (25)22⋅(24)(−1)2=10⋅4⋅6⋅1=240.
- (3,1): (35)23⋅(14)(−1)1=10⋅8⋅4⋅(−1)=−320.
- (4,0): (45)24⋅(04)(−1)0=5⋅16⋅1⋅1=80.
Step 4. Sum the contributions.
1−40+240−320+80=−39.
The coefficient of x4 in (1+2x)5(1−x)4 is −39.
Ratio of consecutive terms and the greatest binomial coefficient
For an expansion such as (1+x)n at a fixed value of x, the ratio Tk+2/Tk+1 tells you whether successive terms grow or shrink. The largest term occurs where the ratio crosses 1.
In the expansion of
(1+x)20 at
x=2, find the value of
k for which the term
Tk+1 is greatest
Step 1. Write the general term. Tk+1=(k20)2k for k=0,1,…,20.
Step 2. Form the ratio of consecutive terms.
Tk+1Tk+2=(k20)2k(k+120)2k+1=k+120−k⋅2=k+12(20−k).
Step 3. Find where the ratio crosses 1. Terms grow while the ratio exceeds 1 and shrink once it drops below 1. Solve k+12(20−k)>1:
2(20−k)>k+1⟹40−2k>k+1⟹39>3k⟹k<13.
So Tk+2>Tk+1 for k<13 and Tk+2<Tk+1 for k>13.
Step 4. Identify the largest term. The growth stops after k=13. So the largest term is T14, corresponding to k=13.
Step 5. Verify at the boundary. At k=13: ratio =142⋅7=1, meaning T15=T14. Both T14 and T15 are equal and are the largest terms. (If a single answer is required, give k=13, so the greatest term is T14=(1320)213.)
Find the value of
r for which the binomial coefficient
(rn) is greatest, for
(1+x)n at
x=1 and
n=12- Step 1. Restate the question
- At x=1 the term in (1+x)12 corresponding to power r is (r12). We want the value of r that maximises (r12) for r∈{0,1,…,12}.
- Step 2. Use symmetry
- (r12)=(12−r12), so the sequence of coefficients is symmetric about r=6.
- Step 3. Form the ratio of consecutive coefficients
(r12)(r+112)=r+112−r.
Step 4. Find where the ratio crosses 1. Solve r+112−r>1:
12−r>r+1⟹11>2r⟹r<5.5.
So (r+112)>(r12) for r<5.5, and the coefficients keep increasing until r=6.
Step 5. Conclude. The greatest binomial coefficient is (612)=924 at r=6.
Sum identities
Several sum identities follow from the binomial theorem by substitution.
Prove that
∑k=0n(kn)=2n for all integers
n≥0Step 1. Start from the binomial theorem. Set up the identity with arbitrary a, b:
(a+b)n=k=0∑n(kn)an−kbk.
Step 2. Substitute a=1 and b=1. This collapses the powers of a, b to 1.
(1+1)n=k=0∑n(kn)⋅1⋅1.
Step 3. Simplify both sides. LHS =2n. RHS =∑k=0n(kn).
Conclusion. ∑k=0n(kn)=2n for all n≥0.
Prove that
(0n)+(2n)+(4n)+⋯=(1n)+(3n)+(5n)+⋯=2n−1 for all integers
n≥1Step 1. Substitute a=1, b=1 into the binomial theorem.
2n=(0n)+(1n)+(2n)+⋯+(nn).(i)
Step 2. Substitute a=1, b=−1 into the binomial theorem. For n≥1:
0=(0n)−(1n)+(2n)−⋯+(−1)n(nn).(ii)
Step 3. Add (i) and (ii). The odd-indexed terms cancel; the even-indexed ones double.
2n+0=2[(0n)+(2n)+(4n)+…].
So (0n)+(2n)+(4n)+⋯=2n−1.
Step 4. Subtract (ii) from (i). The even-indexed terms cancel; the odd-indexed ones double.
2n−0=2[(1n)+(3n)+(5n)+…].
So (1n)+(3n)+(5n)+⋯=2n−1.
Conclusion. Both the even-indexed and odd-indexed sums equal 2n−1, and so they equal each other.
Common exam traps
Trap: Off-by-one in Tk+1
T1 has k=0 (an), and Tn+1 has k=n (bn). Many students get the indexing wrong, costing marks.
Trap: Wrong power-balance equation
For (axp+bxq)n, the power of x in Tk+1 is p(n−k)+qk. Not pk+q(n−k).
Trap: Forgetting coefficients
In (2x+3)n, the general term includes powers of both 2 and 3. Easy to forget.
Trap: Combinations vs permutations
Read carefully whether order matters. "A group of 5" is unordered (combination); "a sequence of 5" or "a queue" is ordered (permutation).
Trap: Repeated elements in permutations
Forgetting to divide by r1!r2!⋯ for repeats massively over-counts.
Practice patterns
Pattern A: Coefficient of a specific power
Find the coefficient of x5 in (2+3x)8. Find the coefficient of x10 in (x2+x1)12.
Pattern B: Term independent of x
Find the term independent of x in (2x−x21)9 or (x+x32)12.
Pattern C: Identity proof using (1+x)n
Show that ∑k=0n(kn)2k=3n. (Set x=2 in (1+x)n=∑(kn)xk.)
Pattern D: Counting with constraints
How many 4-letter words from MATHEMATICS contain at least one vowel? Use complementary counting from no-vowels.
Pattern E: Combined permutation/combination
In how many ways can 5 books be chosen from 10 and arranged on a shelf? (510)⋅5!, equivalently 10P5.
Exam strategy
Binomial theorem questions are typically 2-4 marks each. Allocate 4−6 minutes per question. Steps:
- Write the general term Tk+1 for the given expression.
- Identify what is being asked: coefficient, specific term, independent term.
- Form the right equation (matching power of x, etc.) and solve for k.
- Substitute back to compute the answer.
- State your answer clearly.
For identity proofs, the standard moves are: set specific values into (1+x)n, add or subtract two such substitutions, or differentiate and substitute. The library of identities you need is small.
Check your knowledge
Try these questions before reading the solutions. They are roughly arranged from easier to harder.
- Find the coefficient of x5 in the expansion of (2+3x)8.
- Find the term independent of x in the expansion of (2x−x21)9.
- Show that ∑k=0n(kn)2k=3n for all integers n≥0.
- Find the coefficient of x2 in the expansion of (1+x)5(1+2x)4.
- Find the value of r for which (r15) is greatest.
- In how many ways can 4 letters be selected from the word MATHEMATICS so that the selection includes at least one vowel? Use complementary counting.
- In the expansion of (1+3x)18, find the value of k for which the term Tk+1 is greatest when x=1.
- Show that ∑k=0nk(kn)=n⋅2n−1 for all integers n≥1 by differentiating (1+x)n.
Solutions
- Q1
- Step 1. Write the general term
- Tk+1=(k8)28−k(3x)k=(k8)28−k3kxk.
- Step 2. Match the target power
- Set k=5.
- Step 3. Substitute
- T6=(58)2335x5=56⋅8⋅243x5.
- Step 4. Evaluate
- 56⋅8=448 and 448⋅243=108864.
The coefficient of x5 is 108864.
- Q2
- Step 1. Write the general term
- Tk+1=(k9)(2x)9−k(−x21)k=(k9)29−k(−1)kx9−k⋅x−2k=(k9)29−k(−1)kx9−3k.
- Step 2. Set the power of x to zero
- 9−3k=0, so k=3.
- Step 3. Substitute k=3
- T4=(39)26(−1)3=84⋅64⋅(−1).
- Step 4. Evaluate
- 84⋅64=5376, so the term is −5376.
The term independent of x is −5376.
- Q3
- Step 1. Start from the binomial theorem
- (1+x)n=∑k=0n(kn)xk.
- Step 2. Substitute x=2
- (1+2)n=∑k=0n(kn)2k.
- Step 3. Simplify
- LHS =3n.
- Conclusion
- ∑k=0n(kn)2k=3n for all integers n≥0.
- Q4
- Step 1. Identify the general terms
- From (1+x)5, the term in xj is (j5)xj. From (1+2x)4, the term in xi is (i4)2ixi.
- Step 2. List the pairs giving x2
- (j,i)∈{(0,2),(1,1),(2,0)}.
- Step 3. Compute contributions
- (0,2): (05)⋅(24)22=1⋅6⋅4=24.
- (1,1): (15)⋅(14)21=5⋅4⋅2=40.
- (2,0): (25)⋅(04)=10⋅1=10.
Step 4. Sum. 24+40+10=74.
The coefficient of x2 is 74.
- Q5
- Step 1. Use the ratio of consecutive coefficients
- (r15)(r+115)=r+115−r.
- Step 2. Solve ratio >1
- 15−r>r+1⟹r<7.
- Step 3. Interpret
- Coefficients increase while r<7, so the largest is at r=7 or r=8. Check: (715)=6435=(815). They are equal.
The greatest binomial coefficient is (715)=(815)=6435.
- Q6
- Step 1. Identify the distinct letters available
- MATHEMATICS contains the distinct letters {M,A,T,H,E,I,C,S}, that is 8 different letters. The vowels are A,E,I (3 vowels) and the consonants are M,T,H,C,S (5 consonants).
- Step 2. Count total selections of 4 distinct letters
- (48)=70.
- Step 3. Count selections with no vowels (complement)
- Choose all 4 from the 5 consonants: (45)=5.
- Step 4. Apply complementary counting
- Selections with at least one vowel =70−5=65.
The number of selections is 65.
- Q7
- Step 1. Write the general term at x=1
- Tk+1=(k18)3k for k=0,1,…,18.
- Step 2. Form the ratio of consecutive terms
Tk+1Tk+2=(k18)3k(k+118)3k+1=k+118−k⋅3=k+13(18−k).
Step 3. Solve ratio >1. 3(18−k)>k+1⟹54−3k>k+1⟹53>4k⟹k<13.25.
Step 4. Interpret. Terms increase while k<13.25, so the largest is at k=13 (giving T14).
The greatest term is T14=(1318)313, corresponding to k=13.
- Q8
- Step 1. Write the binomial expansion
- (1+x)n=∑k=0n(kn)xk.
- Step 2. Differentiate both sides with respect to x
- Use the chain rule on the LHS and term-by-term differentiation on the RHS.
n(1+x)n−1=k=0∑nk(kn)xk−1.
Step 3. Substitute x=1. LHS =n⋅2n−1. RHS =∑k=0nk(kn).
Conclusion. ∑k=0nk(kn)=n⋅2n−1 for all integers n≥1.
Linked dot points
For more detail, see the dot point pages at permutations, combinations, binomial theorem and Pascal's triangle, and pigeonhole principle.
For NESA past papers and marking guidelines, refer to educationstandards.nsw.edu.au.