Skip to main content

HSC Maths Extension 1 binomial theorem and combinatorics: deep dive (2026 guide)

HSCMaths Extension 1Study guide22 min read

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.

Jump to a section
  1. What this guide covers
  2. Counting principles
  3. Permutations
  4. Combinations
  5. The binomial theorem
  6. Standard exam techniques
  7. Common exam traps
  8. Practice patterns
  9. Exam strategy
  10. Check your knowledge
  11. Linked dot points

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 xkx^k, term independent of xx, identity proofs.
  • Sum identities like ∑(nk)=2n\sum \binom{n}{k} = 2^n.
  • Ratio of consecutive terms and the greatest binomial coefficient.

Counting principles

The multiplication principle

If a procedure has steps 1,2,…,k1, 2, \dots, k and step ii can be done in nin_i ways (independent of the previous steps), the total number of ways is n1⋅n2⋯nkn_1 \cdot n_2 \cdots n_k.

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).(\text{at least 1}) = (\text{total}) - (\text{none}).

For "at least" and "at most" problems, the complement is often easier.

Permutations

The number of ways to arrange nn distinct objects in a row is n!n!. To arrange rr out of nn: nPr=n!(n−r)!{}^n P_r = \frac{n!}{(n - r)!}.

For objects with repeats (say n1n_1 of one kind, n2n_2 of another), the number of distinct arrangements is

n!n1! n2!⋯nk!.\frac{n!}{n_1! \, n_2! \cdots n_k!}.

Circular arrangements of nn distinct objects: (n−1)!(n - 1)! (fix one to break rotational symmetry).

Combinations

The number of unordered selections of rr from nn distinct objects is

(nr)=n!r!(n−r)!.\binom{n}{r} = \frac{n!}{r! (n - r)!}.

Key identities:

  • Symmetry: (nr)=(nn−r)\binom{n}{r} = \binom{n}{n - r}.
  • Pascal's rule: (nr)=(n−1r−1)+(n−1r)\binom{n}{r} = \binom{n - 1}{r - 1} + \binom{n - 1}{r}.
  • Sum: ∑r=0n(nr)=2n\sum_{r = 0}^{n} \binom{n}{r} = 2^n.

The binomial theorem

For any non-negative integer nn,

(a+b)n=∑k=0n(nk)an−kbk.(a + b)^n = \sum_{k = 0}^{n} \binom{n}{k} a^{n - k} b^k.

The general term is

Tk+1=(nk)an−kbk.T_{k + 1} = \binom{n}{k} a^{n - k} b^k.

So T1=anT_1 = a^n (when k=0k = 0) and Tn+1=bnT_{n + 1} = b^n (when k=nk = n).

Pascal's triangle

The first few rows:

111121133114641151010511615201561\begin{array}{c} 1 \\ 1 \quad 1 \\ 1 \quad 2 \quad 1 \\ 1 \quad 3 \quad 3 \quad 1 \\ 1 \quad 4 \quad 6 \quad 4 \quad 1 \\ 1 \quad 5 \quad 10 \quad 10 \quad 5 \quad 1 \\ 1 \quad 6 \quad 15 \quad 20 \quad 15 \quad 6 \quad 1 \end{array}

Each row nn gives the coefficients of (a+b)n(a + b)^n.

Standard exam techniques

Find the coefficient of a specific power

The general term is Tk+1=(nk)an−kbkT_{k + 1} = \binom{n}{k} a^{n - k} b^k. Identify the power of the variable in Tk+1T_{k + 1}, set it equal to the target, and solve for kk.

Find the coefficient of x3x^3 in the expansion of (2x+5)7(2x + 5)^7

Step 1. Write the general term. With a=2xa = 2x, b=5b = 5, n=7n = 7:

Tk+1=(7k)(2x)7−k(5)k=(7k)27−k5k x7−k.T_{k+1} = \binom{7}{k} (2x)^{7-k} (5)^k = \binom{7}{k} 2^{7-k} 5^k \, x^{7-k}.

Step 2. Match the target power. The power of xx is 7−k7 - k. Set 7−k=37 - k = 3, so k=4k = 4.

Step 3. Substitute k=4k = 4. Pick off the coefficient at this value of kk.

T5=(74)2354 x3.T_5 = \binom{7}{4} 2^{3} 5^{4} \, x^3.

Step 4. Evaluate the numerical factors. Compute (74)=35\binom{7}{4} = 35, 23=82^3 = 8, 54=6255^4 = 625.

Coefficient=35⋅8⋅625=175 000.\text{Coefficient} = 35 \cdot 8 \cdot 625 = 175\,000.

The coefficient of x3x^3 in (2x+5)7(2x + 5)^7 is 175 000175\,000.

Find the term independent of the variable

The general term Tk+1T_{k + 1} has some power of xx formed from the two factors. Set the power to 00 and solve for kk.

Find the term independent of xx in the expansion of (x2+3x)6\left( x^2 + \dfrac{3}{x} \right)^6

Step 1. Write the general term. With a=x2a = x^2, b=3/xb = 3/x, n=6n = 6:

Tk+1=(6k)(x2)6−k(3x)k=(6k)3k x2(6−k)−k=(6k)3k x12−3k.T_{k+1} = \binom{6}{k} (x^2)^{6-k} \left( \frac{3}{x} \right)^k = \binom{6}{k} 3^k \, x^{2(6-k) - k} = \binom{6}{k} 3^k \, x^{12 - 3k}.

Step 2. Set the power of xx to zero. For the term to be independent of xx, 12−3k=012 - 3k = 0, so k=4k = 4.

Step 3. Substitute k=4k = 4.

T5=(64)34.T_5 = \binom{6}{4} 3^4.

Step 4. Evaluate. (64)=15\binom{6}{4} = 15 and 34=813^4 = 81, so the term is 15⋅81=121515 \cdot 81 = 1215.

The term independent of xx is 12151215.

Coefficient of xkx^k in a product of two binomial expansions

For an expression like (a+bx)n(c+dx)m(a + bx)^n (c + dx)^m, the coefficient of xkx^k comes from summing all ways to pick a power xjx^j from the first factor and xk−jx^{k-j} from the second.

Find the coefficient of x4x^4 in the expansion of (1+2x)5(1−x)4(1 + 2x)^5 (1 - x)^4
Step 1. Identify the general terms
From (1+2x)5(1 + 2x)^5 the term in xjx^j is (5j)2jxj\binom{5}{j} 2^j x^j. From (1−x)4(1 - x)^4 the term in xix^i is (4i)(−1)ixi\binom{4}{i} (-1)^i x^i.
Step 2. Set up the convolution
To get x4x^4, choose j+i=4j + i = 4 with 0≤j≤50 \leq j \leq 5 and 0≤i≤40 \leq i \leq 4. The valid pairs (j,i)(j, i) are (0,4)(0, 4), (1,3)(1, 3), (2,2)(2, 2), (3,1)(3, 1), (4,0)(4, 0).
Step 3. Compute each contribution
Multiply the two coefficients for each pair.
  • (0,4)(0, 4): (50)20⋅(44)(−1)4=1⋅1⋅1⋅1=1\binom{5}{0} 2^0 \cdot \binom{4}{4} (-1)^4 = 1 \cdot 1 \cdot 1 \cdot 1 = 1.
  • (1,3)(1, 3): (51)21⋅(43)(−1)3=5⋅2⋅4⋅(−1)=−40\binom{5}{1} 2^1 \cdot \binom{4}{3} (-1)^3 = 5 \cdot 2 \cdot 4 \cdot (-1) = -40.
  • (2,2)(2, 2): (52)22⋅(42)(−1)2=10⋅4⋅6⋅1=240\binom{5}{2} 2^2 \cdot \binom{4}{2} (-1)^2 = 10 \cdot 4 \cdot 6 \cdot 1 = 240.
  • (3,1)(3, 1): (53)23⋅(41)(−1)1=10⋅8⋅4⋅(−1)=−320\binom{5}{3} 2^3 \cdot \binom{4}{1} (-1)^1 = 10 \cdot 8 \cdot 4 \cdot (-1) = -320.
  • (4,0)(4, 0): (54)24⋅(40)(−1)0=5⋅16⋅1⋅1=80\binom{5}{4} 2^4 \cdot \binom{4}{0} (-1)^0 = 5 \cdot 16 \cdot 1 \cdot 1 = 80.

Step 4. Sum the contributions.

1−40+240−320+80=−39.1 - 40 + 240 - 320 + 80 = -39.

The coefficient of x4x^4 in (1+2x)5(1−x)4(1 + 2x)^5 (1 - x)^4 is −39-39.

Ratio of consecutive terms and the greatest binomial coefficient

For an expansion such as (1+x)n(1 + x)^n at a fixed value of xx, the ratio Tk+2/Tk+1T_{k+2} / T_{k+1} tells you whether successive terms grow or shrink. The largest term occurs where the ratio crosses 11.

In the expansion of (1+x)20(1 + x)^{20} at x=2x = 2, find the value of kk for which the term Tk+1T_{k+1} is greatest

Step 1. Write the general term. Tk+1=(20k)2kT_{k+1} = \binom{20}{k} 2^k for k=0,1,…,20k = 0, 1, \dots, 20.

Step 2. Form the ratio of consecutive terms.

Tk+2Tk+1=(20k+1)2k+1(20k)2k=20−kk+1⋅2=2(20−k)k+1.\frac{T_{k+2}}{T_{k+1}} = \frac{\binom{20}{k+1} 2^{k+1}}{\binom{20}{k} 2^k} = \frac{20 - k}{k + 1} \cdot 2 = \frac{2(20 - k)}{k + 1}.

Step 3. Find where the ratio crosses 11. Terms grow while the ratio exceeds 11 and shrink once it drops below 11. Solve 2(20−k)k+1>1\frac{2(20 - k)}{k+1} > 1:

2(20−k)>k+1  ⟹  40−2k>k+1  ⟹  39>3k  ⟹  k<13.2(20 - k) > k + 1 \implies 40 - 2k > k + 1 \implies 39 > 3k \implies k < 13.

So Tk+2>Tk+1T_{k+2} > T_{k+1} for k<13k < 13 and Tk+2<Tk+1T_{k+2} < T_{k+1} for k>13k > 13.

Step 4. Identify the largest term. The growth stops after k=13k = 13. So the largest term is T14T_{14}, corresponding to k=13k = 13.

Step 5. Verify at the boundary. At k=13k = 13: ratio =2⋅714=1= \frac{2 \cdot 7}{14} = 1, meaning T15=T14T_{15} = T_{14}. Both T14T_{14} and T15T_{15} are equal and are the largest terms. (If a single answer is required, give k=13k = 13, so the greatest term is T14=(2013)213T_{14} = \binom{20}{13} 2^{13}.)

Find the value of rr for which the binomial coefficient (nr)\binom{n}{r} is greatest, for (1+x)n(1 + x)^n at x=1x = 1 and n=12n = 12
Step 1. Restate the question
At x=1x = 1 the term in (1+x)12(1+x)^{12} corresponding to power rr is (12r)\binom{12}{r}. We want the value of rr that maximises (12r)\binom{12}{r} for r∈{0,1,…,12}r \in \{0, 1, \dots, 12\}.
Step 2. Use symmetry
(12r)=(1212−r)\binom{12}{r} = \binom{12}{12 - r}, so the sequence of coefficients is symmetric about r=6r = 6.
Step 3. Form the ratio of consecutive coefficients

(12r+1)(12r)=12−rr+1.\frac{\binom{12}{r+1}}{\binom{12}{r}} = \frac{12 - r}{r + 1}.

Step 4. Find where the ratio crosses 11. Solve 12−rr+1>1\frac{12 - r}{r + 1} > 1:

12−r>r+1  ⟹  11>2r  ⟹  r<5.5.12 - r > r + 1 \implies 11 > 2r \implies r < 5.5.

So (12r+1)>(12r)\binom{12}{r+1} > \binom{12}{r} for r<5.5r < 5.5, and the coefficients keep increasing until r=6r = 6.

Step 5. Conclude. The greatest binomial coefficient is (126)=924\binom{12}{6} = 924 at r=6r = 6.

Sum identities

Several sum identities follow from the binomial theorem by substitution.

Prove that ∑k=0n(nk)=2n\sum_{k=0}^{n} \binom{n}{k} = 2^n for all integers n≥0n \geq 0

Step 1. Start from the binomial theorem. Set up the identity with arbitrary aa, bb:

(a+b)n=∑k=0n(nk)an−kbk.(a + b)^n = \sum_{k = 0}^{n} \binom{n}{k} a^{n-k} b^k.

Step 2. Substitute a=1a = 1 and b=1b = 1. This collapses the powers of aa, bb to 11.

(1+1)n=∑k=0n(nk)⋅1⋅1.(1 + 1)^n = \sum_{k = 0}^{n} \binom{n}{k} \cdot 1 \cdot 1.

Step 3. Simplify both sides. LHS =2n= 2^n. RHS =∑k=0n(nk)= \sum_{k=0}^{n} \binom{n}{k}.

Conclusion. ∑k=0n(nk)=2n\sum_{k=0}^{n} \binom{n}{k} = 2^n for all n≥0n \geq 0.

Prove that (n0)+(n2)+(n4)+⋯=(n1)+(n3)+(n5)+⋯=2n−1\binom{n}{0} + \binom{n}{2} + \binom{n}{4} + \dots = \binom{n}{1} + \binom{n}{3} + \binom{n}{5} + \dots = 2^{n-1} for all integers n≥1n \geq 1

Step 1. Substitute a=1a = 1, b=1b = 1 into the binomial theorem.

2n=(n0)+(n1)+(n2)+⋯+(nn).(i)2^n = \binom{n}{0} + \binom{n}{1} + \binom{n}{2} + \dots + \binom{n}{n}. \tag{i}

Step 2. Substitute a=1a = 1, b=−1b = -1 into the binomial theorem. For n≥1n \geq 1:

0=(n0)−(n1)+(n2)−⋯+(−1)n(nn).(ii)0 = \binom{n}{0} - \binom{n}{1} + \binom{n}{2} - \dots + (-1)^n \binom{n}{n}. \tag{ii}

Step 3. Add (i) and (ii). The odd-indexed terms cancel; the even-indexed ones double.

2n+0=2[(n0)+(n2)+(n4)+… ].2^n + 0 = 2 \left[ \binom{n}{0} + \binom{n}{2} + \binom{n}{4} + \dots \right].

So (n0)+(n2)+(n4)+⋯=2n−1\binom{n}{0} + \binom{n}{2} + \binom{n}{4} + \dots = 2^{n-1}.

Step 4. Subtract (ii) from (i). The even-indexed terms cancel; the odd-indexed ones double.

2n−0=2[(n1)+(n3)+(n5)+… ].2^n - 0 = 2 \left[ \binom{n}{1} + \binom{n}{3} + \binom{n}{5} + \dots \right].

So (n1)+(n3)+(n5)+⋯=2n−1\binom{n}{1} + \binom{n}{3} + \binom{n}{5} + \dots = 2^{n-1}.

Conclusion. Both the even-indexed and odd-indexed sums equal 2n−12^{n-1}, and so they equal each other.

Common exam traps

Trap: Off-by-one in Tk+1T_{k + 1}

T1T_1 has k=0k = 0 (ana^n), and Tn+1T_{n + 1} has k=nk = n (bnb^n). Many students get the indexing wrong, costing marks.

Trap: Wrong power-balance equation

For (axp+bxq)n\left( a x^p + b x^q \right)^n, the power of xx in Tk+1T_{k + 1} is p(n−k)+qkp(n - k) + q k. Not pk+q(n−k)p k + q(n - k).

Trap: Forgetting coefficients

In (2x+3)n\left( 2 x + 3 \right)^n, the general term includes powers of both 22 and 33. Easy to forget.

Trap: Combinations vs permutations

Read carefully whether order matters. "A group of 55" is unordered (combination); "a sequence of 55" or "a queue" is ordered (permutation).

Trap: Repeated elements in permutations

Forgetting to divide by r1!r2!⋯r_1! r_2! \cdots for repeats massively over-counts.

Practice patterns

Pattern A: Coefficient of a specific power

Find the coefficient of x5x^5 in (2+3x)8(2 + 3 x)^8. Find the coefficient of x10x^{10} in (x2+1x)12\left( x^2 + \frac{1}{x} \right)^{12}.

Pattern B: Term independent of xx

Find the term independent of xx in (2x−1x2)9\left( 2 x - \frac{1}{x^2} \right)^9 or (x+2x3)12\left( x + \frac{2}{x^3} \right)^{12}.

Pattern C: Identity proof using (1+x)n(1 + x)^n

Show that ∑k=0n(nk)2k=3n\sum_{k = 0}^{n} \binom{n}{k} 2^k = 3^n. (Set x=2x = 2 in (1+x)n=∑(nk)xk(1 + x)^n = \sum \binom{n}{k} x^k.)

Pattern D: Counting with constraints

How many 44-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 55 books be chosen from 1010 and arranged on a shelf? (105)⋅5!\binom{10}{5} \cdot 5!, equivalently 10P5{}^{10} P_5.

Exam strategy

Binomial theorem questions are typically 2-4 marks each. Allocate 4−64-6 minutes per question. Steps:

  1. Write the general term Tk+1T_{k + 1} for the given expression.
  2. Identify what is being asked: coefficient, specific term, independent term.
  3. Form the right equation (matching power of xx, etc.) and solve for kk.
  4. Substitute back to compute the answer.
  5. State your answer clearly.

For identity proofs, the standard moves are: set specific values into (1+x)n(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.

  1. Find the coefficient of x5x^5 in the expansion of (2+3x)8(2 + 3x)^8.
  2. Find the term independent of xx in the expansion of (2x−1x2)9\left( 2x - \dfrac{1}{x^2} \right)^9.
  3. Show that ∑k=0n(nk)2k=3n\sum_{k=0}^{n} \binom{n}{k} 2^k = 3^n for all integers n≥0n \geq 0.
  4. Find the coefficient of x2x^2 in the expansion of (1+x)5(1+2x)4(1 + x)^5 (1 + 2x)^4.
  5. Find the value of rr for which (15r)\binom{15}{r} is greatest.
  6. In how many ways can 44 letters be selected from the word MATHEMATICS so that the selection includes at least one vowel? Use complementary counting.
  7. In the expansion of (1+3x)18(1 + 3x)^{18}, find the value of kk for which the term Tk+1T_{k+1} is greatest when x=1x = 1.
  8. Show that ∑k=0nk(nk)=n⋅2n−1\sum_{k=0}^{n} k \binom{n}{k} = n \cdot 2^{n-1} for all integers n≥1n \geq 1 by differentiating (1+x)n(1 + x)^n.
Solutions
Q1
Step 1. Write the general term
Tk+1=(8k)28−k(3x)k=(8k)28−k3kxkT_{k+1} = \binom{8}{k} 2^{8-k} (3x)^{k} = \binom{8}{k} 2^{8-k} 3^k x^k.
Step 2. Match the target power
Set k=5k = 5.
Step 3. Substitute
T6=(85)2335x5=56⋅8⋅243 x5T_6 = \binom{8}{5} 2^3 3^5 x^5 = 56 \cdot 8 \cdot 243 \, x^5.
Step 4. Evaluate
56⋅8=44856 \cdot 8 = 448 and 448⋅243=108 864448 \cdot 243 = 108\,864.

The coefficient of x5x^5 is 108 864108\,864.

Q2
Step 1. Write the general term
Tk+1=(9k)(2x)9−k(−1x2)k=(9k)29−k(−1)k x9−k⋅x−2k=(9k)29−k(−1)k x9−3kT_{k+1} = \binom{9}{k} (2x)^{9-k} \left( -\dfrac{1}{x^2} \right)^k = \binom{9}{k} 2^{9-k} (-1)^k \, x^{9-k} \cdot x^{-2k} = \binom{9}{k} 2^{9-k} (-1)^k \, x^{9 - 3k}.
Step 2. Set the power of xx to zero
9−3k=09 - 3k = 0, so k=3k = 3.
Step 3. Substitute k=3k = 3
T4=(93)26(−1)3=84⋅64⋅(−1)T_4 = \binom{9}{3} 2^{6} (-1)^3 = 84 \cdot 64 \cdot (-1).
Step 4. Evaluate
84⋅64=537684 \cdot 64 = 5376, so the term is −5376-5376.

The term independent of xx is −5376-5376.

Q3
Step 1. Start from the binomial theorem
(1+x)n=∑k=0n(nk)xk(1 + x)^n = \sum_{k=0}^{n} \binom{n}{k} x^k.
Step 2. Substitute x=2x = 2
(1+2)n=∑k=0n(nk)2k(1 + 2)^n = \sum_{k=0}^{n} \binom{n}{k} 2^k.
Step 3. Simplify
LHS =3n= 3^n.
Conclusion
∑k=0n(nk)2k=3n\sum_{k=0}^{n} \binom{n}{k} 2^k = 3^n for all integers n≥0n \geq 0.
Q4
Step 1. Identify the general terms
From (1+x)5(1+x)^5, the term in xjx^j is (5j)xj\binom{5}{j} x^j. From (1+2x)4(1+2x)^4, the term in xix^i is (4i)2ixi\binom{4}{i} 2^i x^i.
Step 2. List the pairs giving x2x^2
(j,i)∈{(0,2),(1,1),(2,0)}(j, i) \in \{(0, 2), (1, 1), (2, 0)\}.
Step 3. Compute contributions
  • (0,2)(0, 2): (50)⋅(42)22=1⋅6⋅4=24\binom{5}{0} \cdot \binom{4}{2} 2^2 = 1 \cdot 6 \cdot 4 = 24.
  • (1,1)(1, 1): (51)⋅(41)21=5⋅4⋅2=40\binom{5}{1} \cdot \binom{4}{1} 2^1 = 5 \cdot 4 \cdot 2 = 40.
  • (2,0)(2, 0): (52)⋅(40)=10⋅1=10\binom{5}{2} \cdot \binom{4}{0} = 10 \cdot 1 = 10.

Step 4. Sum. 24+40+10=7424 + 40 + 10 = 74.

The coefficient of x2x^2 is 7474.

Q5
Step 1. Use the ratio of consecutive coefficients
(15r+1)(15r)=15−rr+1\dfrac{\binom{15}{r+1}}{\binom{15}{r}} = \dfrac{15 - r}{r + 1}.
Step 2. Solve ratio >1> 1
15−r>r+1  ⟹  r<715 - r > r + 1 \implies r < 7.
Step 3. Interpret
Coefficients increase while r<7r < 7, so the largest is at r=7r = 7 or r=8r = 8. Check: (157)=6435=(158)\binom{15}{7} = 6435 = \binom{15}{8}. They are equal.

The greatest binomial coefficient is (157)=(158)=6435\binom{15}{7} = \binom{15}{8} = 6435.

Q6
Step 1. Identify the distinct letters available
MATHEMATICS contains the distinct letters {M,A,T,H,E,I,C,S}\{M, A, T, H, E, I, C, S\}, that is 88 different letters. The vowels are A,E,IA, E, I (33 vowels) and the consonants are M,T,H,C,SM, T, H, C, S (55 consonants).
Step 2. Count total selections of 44 distinct letters
(84)=70\binom{8}{4} = 70.
Step 3. Count selections with no vowels (complement)
Choose all 44 from the 55 consonants: (54)=5\binom{5}{4} = 5.
Step 4. Apply complementary counting
Selections with at least one vowel =70−5=65= 70 - 5 = 65.

The number of selections is 6565.

Q7
Step 1. Write the general term at x=1x = 1
Tk+1=(18k)3kT_{k+1} = \binom{18}{k} 3^k for k=0,1,…,18k = 0, 1, \dots, 18.
Step 2. Form the ratio of consecutive terms

Tk+2Tk+1=(18k+1)3k+1(18k)3k=18−kk+1⋅3=3(18−k)k+1.\frac{T_{k+2}}{T_{k+1}} = \frac{\binom{18}{k+1} 3^{k+1}}{\binom{18}{k} 3^k} = \frac{18 - k}{k + 1} \cdot 3 = \frac{3(18 - k)}{k + 1}.

Step 3. Solve ratio >1> 1. 3(18−k)>k+1  ⟹  54−3k>k+1  ⟹  53>4k  ⟹  k<13.253(18 - k) > k + 1 \implies 54 - 3k > k + 1 \implies 53 > 4k \implies k < 13.25.

Step 4. Interpret. Terms increase while k<13.25k < 13.25, so the largest is at k=13k = 13 (giving T14T_{14}).

The greatest term is T14=(1813)313T_{14} = \binom{18}{13} 3^{13}, corresponding to k=13k = 13.

Q8
Step 1. Write the binomial expansion
(1+x)n=∑k=0n(nk)xk(1 + x)^n = \sum_{k=0}^{n} \binom{n}{k} x^k.
Step 2. Differentiate both sides with respect to xx
Use the chain rule on the LHS and term-by-term differentiation on the RHS.

n(1+x)n−1=∑k=0nk(nk)xk−1.n (1 + x)^{n - 1} = \sum_{k=0}^{n} k \binom{n}{k} x^{k-1}.

Step 3. Substitute x=1x = 1. LHS =n⋅2n−1= n \cdot 2^{n-1}. RHS =∑k=0nk(nk)= \sum_{k=0}^{n} k \binom{n}{k}.

Conclusion. ∑k=0nk(nk)=n⋅2n−1\sum_{k=0}^{n} k \binom{n}{k} = n \cdot 2^{n-1} for all integers n≥1n \geq 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.

Sources & how we know this

ExamExplained