Binomial Expansion of (a + bx)ⁿ for Positive Integer n
~55 min · WMA12 · 4.5
WMA12 · 4.5 · 55 min
Every term in the expansion of answers the same question, asked times over: out of identical brackets, how many ways can you pick which of them contribute the ? That headcount — written or — is the entire , and nothing about it needs memorising once you see it as counting rather than as a formula. The paper's most common trap isn't getting that count wrong; it's attaching a correctly-computed count to the wrong power in the first place.
Key terms in this lesson
Before you read on
Two or three questions on exactly what this lesson teaches. Being wrong here is fine — it's the fastest way to find out what to pay attention to next.
What (a + bx)ⁿ means, and where P2 draws the line
means exactly what it looks like: multiply by itself times. Spec 4.5 restricts to a positive integer here, and that restriction is worth taking seriously rather than skimming past: the P2 formula booklet page prints two binomial formulas side by side — the combinatorial expansion for positive integer , and a second, more general series that only converges for real and . That second formula is P4 content. It sits on the same page purely because Pearson organises the booklet by unit rather than by difficulty, and reaching for it on a P2 paper — where is always a known positive integer — buys nothing but harder algebra, confirmed directly by real exam behaviour later in this lesson.
Expanding produces exactly terms. Powers of fall from down to as powers of rise from up to , so the general shape is — the two exponents in any single term always add to , which is a fast self-check on any line of working: if they don't, a power has been mistyped somewhere.
The spec explicitly permits three interchangeable notations for the same coefficient: (factorial), (" choose "), and . They are not three different things to learn — they are three ways of writing one number, and which one appears on a given exam paper or in a given textbook is a stylistic choice, not a mathematical one.
Every term in the expansion is found the same way, using the general term: . Reading it left to right, it demands three separate pieces of arithmetic every single time — the coefficient , the power of , and the power (and, where is negative, the sign) of — and each one is an independent place to slip. The rest of this lesson is built around keeping those three pieces from bleeding into each other.
Mechanism
Where ⁿCᵣ actually comes from — it is a headcount, not a formula to memorise
Write out as separate brackets multiplied together: . Expanding this product term by term means picking, from EVERY bracket, either the or the — one choice per bracket — and multiplying all choices together; that is what "expanding a product of sums" means, mechanically. A term that ends up as is exactly the result of a selection that picked from of the brackets and from the other — and every selection that picks the SAME set of brackets multiplies out to the identical term, so instead of writing that term out once per selection, the selections are counted and the count becomes the coefficient. is, by definition, the number of ways to choose which of brackets contribute the — nothing more exotic than that, and nothing that needs a separate rule to justify why it's the coefficient. Now derive the factorial form from the same counting argument rather than quoting it: line the brackets up and decide, for each, whether it's an "-bracket" or a "-bracket." There are ways to put distinct objects in order — but the objects here aren't actually distinct once you only care about the FINAL split into two groups: swapping the order of the brackets already labelled "" among themselves doesn't create a new selection, so the orderings over-count by a factor of (the number of ways to shuffle those brackets among themselves); and swapping the order of the remaining ""-brackets among themselves doesn't create a new selection either, over-counting by a further factor of . Dividing out both gives — not a formula handed down, but the direct consequence of removing the two kinds of reordering that don't actually change which brackets were chosen.
Mechanism
Pascal's triangle is the same headcount, one step earlier
The rule "each entry of is the sum of the two entries above it" is usually presented as something to notice, not something to derive — but it falls straight out of the same counting argument. To choose which of brackets contribute the , look specifically at the LAST bracket and split into two cases that cannot overlap: either that last bracket is one of the chosen ones, in which case the other chosen brackets have to come from the remaining brackets — ways — or it isn't, in which case all chosen brackets have to come from those same remaining — ways. Every valid selection falls into exactly one of those two cases, so the total count is their sum: . That is Pascal's triangle's addition rule, in symbols — each entry really is built from the two above it, because "whether or not the newest bracket is chosen" really does split every selection into exactly those two non-overlapping groups. This is what makes the triangle a second, genuinely valid way to reach the same coefficients, not just a shortcut for small numbers: it's the identical headcount, built up one bracket at a time instead of computed in one factorial calculation.
Same question, every valid method
Find the coefficient of in the expansion of . (VERIDIAN-original question — not a reproduction of any past-paper question. The per-line mark allocations are modelled on general M/A/B conventions verified against the primary mark-scheme documentation, not transcribed from a real mark scheme, which for an original question does not exist.)
2 valid methods · every one reaches · 3 marks available
- 01M1
; the term in needs .
Method mark for quoting the general term and setting r to the power actually asked for. The general marking guidance's advice is to quote a learnt formula before substituting into it — where it isn't quoted, the method mark can still be gained by implication from correct working, but is then at risk from any slip in that working.
- 02A1
, , .
Accuracy mark for all three separate pieces correct — the coefficient, the power of a, and the power of bx — dependent on the method mark above.
- 03A1
.
Accuracy mark for the final coefficient, correct answer only.
Fast, and scales to any n without writing anything not actually needed — a single evaluation, done once, for whichever term the question asks for. That is exactly why it's the right default once n is large enough that building a full Pascal's triangle row would waste time reaching an entry you don't need on the way to the one you do. Its real risk is the one this whole lesson is built around: attaching r to the wrong power or the wrong nCr in the first place, which is arithmetic that looks entirely correct on the page and is simply answering a different question.
In your own words
In one sentence: why do the general term formula and Pascal's triangle always produce the same coefficient for the same n and r?
Where the exam hides the mismatch
Almost no WMA12 binomial question is a plain "expand this and stop" instruction — it usually wants one specific coefficient, or an unknown constant found from a given coefficient, which means correctly matching the term to the power asked for IS the skill being tested, not the multiplication itself. An examiner report puts the resulting error precisely: candidates were seen "using the wrong power (usually 4 or 6 instead of 5 for the fractional part) or using the wrong binomial coefficient (¹²C₆, ¹²C₈ and ⁷C₅ instead of ¹²C₇)" (Jan 2024, Q2) — not a conceptual misunderstanding of the theorem, an indexing slip.
The second hiding place is the choice of formula itself. Both the combinatorial form and the general series sit on the same booklet page, and real exam behaviour shows the split: "Part (a) was generally done very well with candidates mostly using the (a+b)ⁿ form of the binomial expansion where n is a positive integer rather than (1+x)ⁿ where n is a rational number" (June 2025, Q1). A regional variant of the same series shows exactly what the harder route costs once a question adds a second unknown alongside x: "Many candidates struggled to make a start with this question due to the fact that there were two unknowns, n and k, within the binomial expression (1+kx)ⁿ" (June 2025 Regional 01R, Q7) — the report records that candidates reaching for the general-series formula made comparatively little progress with it. Default to on P2. It is both the form the spec restricts you to and the one that stays tractable.
The third hiding place only appears once is negative. carries whatever sign has — negative when is odd, positive when is even, for exactly the same reason and . An expansion like therefore alternates strictly by the parity of , term by term, not by any other pattern — and dropping that sign on a single term, usually by writing as out of habit, produces a coefficient that is numerically wrong by exactly a factor of while everything else on the line looks correct.
Worked, in full
The coefficient of in — matching the term index correctly, then carrying its sign all the way through
- 01
Identify , , , and the general term . The power of wanted is 4, so — directly, with no adjustment, because already supplies exactly .
Earns: M1 — attempts the general term with r correctly identified as the power of x itself, not one more or one less than it.
- 02
Evaluate the three pieces separately rather than in one line, since each is an independent place to slip: (the 5th entry of Pascal's row 7, counting the first entry as ); ; and — positive, because raising a negative number to an EVEN power always is.
Earns: A1 — all three components correct, including the sign reasoning for (−2)⁴, dependent on the method mark above.
- 03
. The coefficient of is .
Earns: A1 — the final coefficient, correct answer only.
- 04
Check by substituting into the whole expansion, which must equal : . ✓ This catches a dropped sign on ANY term, not just the one just found — it's a check on the whole line of working, not only the final answer.
Earns: Nothing — the mark scheme has run out by this point. It's on the list anyway because it costs one line of arithmetic and would have caught a sign slip on this exact question before the paper was handed in.
Source — Examiner report, Jan 2024
"using the wrong power (usually 4 or 6 instead of 5 for the fractional part) or using the wrong binomial coefficient (¹²C₆, ¹²C₈ and ⁷C₅ instead of ¹²C₇)"
Complete it yourself
Complete the chain — the coefficient of in
- 01
Identify , , , and the general term . The power of wanted is 3, so — directly, with no adjustment.
- 02
— the 4th entry of Pascal's row 6 (), counting the first entry as .
Marked, line by line
, where is a non-zero constant. (a) Find, in ascending powers of , the first three terms of the binomial expansion of , simplifying each coefficient. (3) (b) Given that the coefficient of in the expansion is , find the possible value(s) of . (3) (c) Given also that the coefficient of in the expansion is negative, state which value of from part (b) must be rejected, giving a reason. (2) — VERIDIAN-original question, modelled on the real structure of P2 binomial-expansion items that pair a "find the first three terms" opener with a "given that a coefficient equals..." part and a condition that eliminates one root (spec 4.5). Not a reproduction of any past-paper question, and the per-line mark allocations below are modelled on verified general marking guidance rather than transcribed from a real mark scheme, which for an original question does not exist.
8 marks available
(a) — 3 marks
- 01M1
— the general term with , , .
Method mark for attempting the expansion with the correct structure — decreasing powers of 3, increasing powers of kx, a binomial coefficient attached to each. The mark is for a correct method attempted, whatever happens to the arithmetic afterwards.
- 02A1
Accuracy mark for the first two terms. Binomial(6,0)·3⁶ = 729 needs no k at all; Binomial(6,1)·3⁵·k = 6×243×k = 1458k.
- 03A1
Accuracy mark for the third term. Binomial(6,2) = 15 and 3⁴ = 81, so 15×81 = 1215 — the 6 that belongs to the SECOND term must not be reused here, the same class of indexing slip the Jan 2024 examiner report names elsewhere in this lesson, just with different numbers.
(b) — 3 marks
- 101M1
Method mark for equating their coefficient of x² from part (a) to the given value 4860 — earned outright, with no 'ft' qualifier needed: an M mark credits a correct method applied to whatever value is on the page, right or wrong, so it needs no follow-through tag just because it is built on a previous part's own answer. 'ft' only ever attaches to A and B marks.
- 102dM1
Dependent method mark for solving their equation for k², reachable however the equation was set up.
- 103A1
or
Accuracy mark, correct answer only, for BOTH values. A squared quantity equal to 4 always has two square roots, and dropping the negative one is the same failure as dropping a bound on an inequality question.
(c) — 2 marks
- 201M1
Coefficient of is : at this is (positive); at this is (negative).
Method mark for substituting BOTH values of k into the coefficient of x found in part (a) and comparing signs — the only way to actually apply the given condition rather than guess which root to keep.
- 202A1
is rejected, since it gives a positive coefficient of x; is the value that satisfies the question, since is negative.
Accuracy mark for the correct rejection WITH the correct reason attached. Stating which value is rejected without saying why — or rejecting the wrong one — does not earn this mark.
Named traps
- term-index-mismatched-to-power
- Confirmed directly on a real WMA12 question: common mistakes included "using the wrong power (usually 4 or 6 instead of 5 for the fractional part) or using the wrong binomial coefficient (¹²C₆, ¹²C₈ and ⁷C₅ instead of ¹²C₇)" (Jan 2024, Q2). The power of in the general term is itself — no "one more" or "one less." State explicitly, on its own line, before touching any other number, and this error becomes almost impossible to make by accident.
- general-series-form-chosen-over-combinatorial-form
- The P2 formula booklet page prints two binomial formulas side by side: the combinatorial expansion for positive integer , and the general series for real and — the second is P4 content, not required here, and genuinely harder to apply. An examiner report confirms most candidates default correctly: "Part (a) was generally done very well with candidates mostly using the (a+b)ⁿ form of the binomial expansion where n is a positive integer rather than (1+x)ⁿ where n is a rational number" (June 2025, Q1) — but a regional variant paper shows exactly what the harder route costs once a question adds a second unknown: "Many candidates struggled to make a start with this question due to the fact that there were two unknowns, n and k, within the binomial expression (1+kx)ⁿ" (June 2025 Regional 01R, Q7). On P2, is always a known positive integer — default to every time.
- bx-term-not-raised-as-a-whole
- Confirmed directly on a real WMA12 question, not just derived from the arithmetic: the examiner report for the same anchor question cited elsewhere in this lesson names this as the most common way of losing the accuracy mark for the unsimplified term — "using invisible brackets that were not recovered in further work (4x⁷ instead of (4x)⁷) resulting in multiplication by 4 instead of 4⁷" (Jan 2024, Q2). means both and are raised to the power — , not . Losing the power on the numeral while keeping it on the variable is easy to miss on the page, because the still looks correct; only the coefficient in front of it is wrong. Write as before evaluating , so the two pieces are never handled in the same breath.
- sign-lost-on-odd-powers-of-a-negative-b
- When is negative, carries the sign of — negative when is odd, positive when is even, for the same reason while . The terms of an expansion like therefore alternate strictly by the parity of , not by any other pattern — dropping the sign on just one term, usually by writing as out of habit, produces an answer that looks structurally right and is numerically wrong by exactly a factor of .
- pascal-triangle-row-miscounted
- Row of Pascal's triangle — counting the single "1" at the top as row 0 — has exactly entries, through . Starting the count at row 1 instead of row 0 reads off the coefficients for , one whole row too early, and every coefficient taken from it is wrong even though every addition inside the triangle was done correctly. Before reading off a row, count its entries: numbers, not .
- required-term-not-isolated-from-a-list
- Confirmed directly on the anchor WMA12 question: the examiner report states the final accuracy mark "was commonly not awarded to candidates who failed to isolate the required term from a list" (Jan 2024, Q2), and the mark scheme itself warns "the term or coefficient must be identified if they have more than one term." Writing several terms, a full expansion, or a whole row of Pascal's triangle is not itself an error — but once the value asked for has been found, it has to be pointed to on its own, not left sitting unlabelled inside the longer list. State it on its own final line (or circle/box it) the moment it's reached.
Beyond the spec
Spec 4.5 only asks for the expansion and specific terms of it; it never asks for a proof about the row of coefficients as a whole. This is the one-line reason the "check by substituting x = 1" habit used throughout this lesson is not a trick — it works because the entire expansion, evaluated at x = 1, IS the sum of every coefficient, and that sum is forced to equal (a+b)ⁿ by the very identity being checked. It is not examined at P2 and no question will ask for it directly.
Set in : every becomes , and the whole right-hand side collapses to again — obvious algebraically, since substituting a number for can't change which identity holds, but genuinely useful practically, because it turns the sum of every coefficient in a worked expansion into a number you can check independently: . Set specifically, and the identity becomes — the familiar fact that a full row of Pascal's triangle sums to a power of two, which is not a separate fact to memorise but the same substitution used to check every worked example in this lesson, with the two simplest possible numbers chosen for and . Set instead, with , and every term picks up a sign of ; the terms cancel in pairs whenever , giving — which is exactly why an alternating row of Pascal's triangle, taken with alternating and signs, always sums to zero.
Retrieval — with feedback on every choice
What is the coefficient of in the expansion of ?
What is the coefficient of in the expansion of ?
What is the coefficient of in the expansion of ?
Pascal's triangle is used to expand . Which row gives the correct coefficients, and how many entries does it have?
In the expansion of , what does the coefficient actually count?
Which expression equals ?
- (a+bx)ⁿ, n a positive integer: n+1 terms, C(n,r)aⁿ⁻ʳ(bx)ʳ. Powers of a and bx in any term always add to n.
- C(n,r) = n!/(r!(n−r)!) — a headcount of which r of n brackets give bx, not a formula to memorise alone.
- The power of x in a term IS r. Write r = (power wanted) on its own line before anything else.
- (bx)ʳ = bʳxʳ: raise the number too, not just the variable. Negative b alternates sign with the parity of r.
- Pascal's row n has n+1 entries, C(n,0)…C(n,n). Check any answer: set x = 1, total should equal (a+b)ⁿ.
- Writing several terms or a full Pascal's row? State the one answering the question on its own line — a correct value left unlabelled in a list can still lose the mark (Jan 2024 Q2).
Not affiliated with or endorsed by Pearson Edexcel. Every quotation and figure attributed to a mark scheme or examiner report in this lesson was independently verified against the primary Pearson document, not carried over from prior course material. Every question in this lesson — prequestion, worked chain, chain drill, method comparison, marked solution and MCQ alike — is VERIDIAN-original wording, inspired by confirmed real question types, never a reproduction of a real Pearson question; and because the questions are original, the per-line mark allocations attached to them are modelled on verified mark-scheme conventions (what M, A and B marks mean, when follow-through applies, how a dependent method mark works) rather than transcribed from a real mark scheme, which for an original question does not exist.
What is the coefficient of in the expansion of ?
Correct. , , , and .
- B
This swaps which exponent belongs to which factor — computing instead of the correct . The power of is , the power of is ; they are not interchangeable.
- C
This uses instead of the correct — a one-row-early read of the wrong binomial coefficient, with the correct powers of 2 and 5 still attached to it.
- D
This is with the binomial coefficient left out entirely — every term in the expansion needs its headcount attached, not just the two powers.
Traps tested: Power of a confused with power of bx · Term index mismatched to power · Binomial coefficient omitted
What is the coefficient of in the expansion of ?
Correct. , , , and .
- B
This computes — the 4 raised to the power 1 instead of the power 3. : the numeral is raised to the power just as much as the variable is.
- C
This uses instead of the correct — the coefficient for the WRONG term, with the correct still attached to it.
- D
This is alone, with the binomial coefficient left out entirely.
Traps tested: Bx term not raised as a whole · Term index mismatched to power · Binomial coefficient omitted
What is the coefficient of in the expansion of ?
Correct. , , and since 3 is odd — so .
- B
The magnitude is right and the sign is dropped: , not . Raising a negative number to an ODD power keeps it negative.
- C
This uses instead of the correct — the power of was never reduced by at all, leaving the full power attached instead of .
- D
This uses instead of the correct — the coefficient for the wrong term, with the correct powers and sign attached to it.
Traps tested: Sign lost on odd powers of a negative b · Power of a not reduced by the term index · Term index mismatched to power
Pascal's triangle is used to expand . Which row gives the correct coefficients, and how many entries does it have?
- Row 7 (counting the top "1" as row 0), with 8 entries:
Correct. Row has entries, through , and for that's 8 entries.
- BRow 7 (counting the top "1" as row 1), with 7 entries:
This is actually the row for , read off one row too early because the count started at row 1 instead of row 0. Every coefficient taken from it is wrong, even though the additions inside the triangle were all done correctly.
- CRow 7, with 7 entries:
The right row, with the final entry dropped. Row 7 has entries, ending in — the entry for choosing bx from every single bracket.
- DRow 8, with 9 entries:
This is the row for , one row too late — labelling the row by instead of , the opposite direction of the more common off-by-one slip.
Traps tested: Pascal triangle row miscounted · Pascal triangle entry dropped
In the expansion of , what does the coefficient actually count?
- The number of ways to choose which of the bracket-factors contribute a (the rest contributing ) when the product is expanded term by term
Correct — this is the direct combinatorial derivation from earlier in this lesson: expanding brackets means one choice of or per bracket, and every selection choosing the same brackets for multiplies out to the same term, so the coefficient is that count.
- BThe power to which is raised in that term
That power is itself, which is a separate quantity from the coefficient in front of the term — and are not the same number, and confusing them collapses two independent pieces of the general term into one.
- CThe total number of terms in the full expansion
The full expansion always has terms in total, regardless of — that count doesn't depend on which term you're looking at, while changes with every different .
- DA rounded estimate of divided by
is an exact integer count, not an estimate of anything — it's the precise number of ways to make a specific selection, computable exactly from .
Traps tested: Binomial coefficient confused with the power · Binomial coefficient confused with total term count · Coefficient treated as an estimate not exact count
Which expression equals ?
Correct: .
- B
This is — every ordered arrangement of 3 items chosen from 7, still distinguishing different orders of the same 3 items. Missing the that removes the ordering among the 4 items left over.
- C
This is , the ordered-arrangement count. Dividing by to remove the ordering among the 3 chosen items is exactly what turns this into .
- D
This is the reciprocal of the correct value, . A binomial coefficient counts a number of selections, so it's always a positive integer — never a fraction less than 1.
Traps tested: N minus r factorial omitted · Permutation used instead of combination · Ncr fraction inverted
Practice this for real
This site teaches the mechanism; the exam is sat on Pearson's own real questions. Go find and attempt these yourself — nothing here substitutes for actually sitting a timed paper.
- Examiner report
- Jan 2024 · Q2 — cited directly in this lesson
Select International Advanced Level → Mathematics → any series, then look for WMA12.
Up next
Exponential Graphs, the Laws of Logarithms and Solving aˣ = b
Every law of logarithms on this page is a law of indices, read backwards. That is not a simplification for beginners — it is the actual content of spec 5.2, and it is why the five identities never need memorising as five separate facts. The real difficulty on this paper is not the algebra of the laws themselves: real scripts show candidates reaching the correct rearranged equation and then simply not finishing it, or reaching for a log law that does not exist. Both of those are what this lesson targets.
55 min