This is the most demanding mathematics paper in NSW. NESA’s E4 descriptor requires you to “prove results” and to communicate using “concise notation and clear logical argument.” This guide teaches proof as a discipline, not a formula.
Extension 2 carries the greatest prestige of any mathematics course in NSW, and it is the smallest — one elective unit. That combination produces a peculiar result: a small number of students, sitting a paper where almost every mark is a reasoning mark.
As with Extension 1, the reported band is E4, not Band 6: “For an Extension course, the bands are E4 (highest level of performance) to E1”3. And the 50:50 rule applies without exception:
“Your mark in each course is a 50:50 combination of your HSC exam mark and your school-based assessment mark.”
Because the cohort is small, a single badly-performed school-based assessment can move your result more than a dozen exam marks would in a large cohort subject. Treat internal assessment as disproportionately important here.
NESA states that for Extension 2 “Candidates will also be required to complete the Mathematics Extension 1 paper in addition to the Mathematics Extension 2 paper”1. So a candidate typically sits Extension 1 (70 marks, 2 hours) and then Extension 2 (100 marks, 3 hours). That is a long session, and fatigue is a real risk to the marks you have already earned.
Extension 2 is not Extension 1 with harder questions. It is a different subject with a different verb. Advanced and Extension 1 ask you to solve. Extension 2 asks you to demonstrate.
Compare the top-band descriptors. Extension 1 E4 requires that a student “demonstrates insightful and sophisticated multi-step mathematical reasoning and justification”4. Extension 2 E4 requires that a student “proves results in familiar and unfamiliar settings”2. That is not a difference of degree. Solving a problem and proving a result are different intellectual acts.
| Activity | What it produces | Who assesses it |
|---|---|---|
| Solving a problem | A numerical or algebraic answer, which you then check by substitution. | Self-verification. If the number works, you believe it. |
| Proving a result | A chain of statements where each follows logically from the previous, and where the conclusion cannot be verified by any single example. | The marker. Every step must be individually valid, because there is no way to check the whole thing at once. |
Extension 2 papers contain few routine computational items. Because Section II still carries 37–42 items across 90 marks1, many items are short — but a disproportionate share of them require you to state why rather than what. “Proving” appears as a required skill precisely because it is a distinct outcome, not a flourish.
Students who are strong at Advanced computation often expect to be strong at Extension 2 by doing more computation. The course actively punishes that. A correct computation with no justification, or a justification with an unstated logical step, loses marks that computation alone would have earned in a lower course. You are being assessed on the argument.
| Specification | NESA requirement1 |
|---|---|
| Total marks | “This exam will consist of a written paper worth 100 marks.” |
| Working time | “The time allowed is 3 hours plus 10 minutes reading time.” |
| Section I | “There will be objective-response questions to the value of 10 marks.” |
| Section II | “Questions may contain parts. There will be 37 to 42 items.” Worth 90 marks. |
| Large items | “At least two items will be worth 4 or 5 marks.” |
| Assumed knowledge | “The Mathematics Advanced and Mathematics Extension 1 courses will be assumed knowledge for this exam.” |
| Also required | “Candidates will also be required to complete the Mathematics Extension 1 paper in addition to the Mathematics Extension 2 paper.” |
| Equipment | “The Mathematics Advanced, Mathematics Extension 1 and Mathematics Extension 2 Reference Sheet will be provided. Students may bring NESA-approved calculators.” |
NESA has ruled that mathematical curve-drawing templates will no longer be permitted equipment, and that compasses and protractors will no longer be permitted4. Bring a pencil, ruler and eraser. No template, no compass, no protractor.
NESA’s published Band E4 performance band description for Mathematics Extension 2, reproduced verbatim2.
“The typical performance in this band:
“demonstrates extensive knowledge and skills appropriate to the course.”
“synthesises mathematical techniques, results and ideas creatively to solve problems.”
“demonstrates sophisticated multi-step logic and mathematical insight to solve problems across a wide range of contexts.”
“proves results in familiar and unfamiliar settings.”
“communicates complex mathematical ideas and relationships using algebraic, diagrammatic and graphical techniques, concise notation and clear logical argument.”
Now look at E3, which requires only that a candidate “demonstrates a sound grasp of techniques required to prove results in familiar settings”2. The differences between E3 and E4 are therefore precise and testable:
| E4 wording2 | What it demands | Concrete exam behaviour |
|---|---|---|
| “Synthesises… creatively” | Approaching an unfamiliar problem from more than one direction. | When stuck, deliberately try a different representation — draw it, generalise it, test a special case — rather than repeating the same algebra. |
| “Sophisticated multi-step logic” | Not just arithmetic steps but inferential steps. Each line must be justified. | Write “since…”, “therefore…”, “because…”, “as…” between lines, not only at the ends. |
| “Proves results in unfamiliar settings” | General proofs, not proofs of memorised results. | Proofs of statements you have never seen before, where the claim is not a listed theorem. |
| “Concise notation and clear logical argument” | Efficiency and clarity simultaneously. | One idea per line; no restating the question; use standard notation correctly. |
The two mandatory course components carry the same 50/50 split as the other mathematics courses: Understanding, Fluency and Communication 50%, Problem Solving, Reasoning and Justification 50%1. NESA’s sample Year 12 formal program for Extension 2 contains four assessment tasks, with individual weightings from 10% to 40%1.
NESA states that “The Mathematics Advanced and Mathematics Extension 1 courses will be assumed knowledge for this exam”1. That is both prior courses. A candidate who takes Extension 2 is being examined on approximately three courses’ worth of content in one paper. This has a direct planning consequence: your revision must include Advanced and Extension 1 review, not just Extension 2 material.
| Module | Content | Proof demand |
|---|---|---|
| MEX12.1 Algebra | Polynomials, partial fractions, inequalities, sequences and series, binomial theorem, induction, logarithms and exponentials. | Very high. Inequality proofs and induction appear almost every year. Assume knowledge and equivalence proofs are the bread and butter. |
| MEX12.2 Calculus | Integration techniques, partial derivatives, applications of integration, further derivatives. | High. Partial derivative and optimisation items require you to justify why a critical point is a maximum, minimum or saddle point, not just compute the values. |
| MEX12.3 Complex Numbers | Complex algebra, loci, polynomials, series and applications of complex analysis. | Medium-high. Locus proofs and the geometric meaning of De Moivre results. |
| MEX12.4 Mechanisms | Simple mechanics in two dimensions, related rates, circular motion, and the kinematics of particles. | Medium. Proof is lighter here, but the modelling argument must be defended in context. |
| MEX12.5 Proofs and Mathematical Written Communication | The logic of mathematical argument: implication, equivalence, contradiction, contraposition, mathematical induction, and the conventions of mathematical writing. | Total. This module exists to teach the skill the E4 descriptor names first. It is not revision for the exam; it is the exam. |
NESA’s E4 descriptor for Extension 2 states that a candidate “proves results in familiar and unfamiliar settings”2. There is no module more directly tied to that sentence.
| Technique | Use it when | Signal phrase |
|---|---|---|
| Direct proof | The hypotheses naturally lead to the conclusion by a short chain. | “Let…. Since…, … therefore….” |
| Proof by contradiction | The negation gives you leverage, or a contradiction is easy to derive. | “Suppose, for contradiction, that….” |
| Contrapositive | The conclusion has several disjuncts, or its negation is simpler. | “It suffices to show that ¬q ⇒ ¬p.” |
| Induction | The claim is universally quantified over integers and has a natural recursive structure. | “We prove this for all n ∈ ℕ.” |
Proving a converse and calling it a proof. If the claim is p ⇒ q and you prove q ⇒ p, you have proved a different statement. Read the direction of the implication twice.
“Synthesises… creatively”2 — choosing an algebraic route that closes the problem rather than merely computing.
Cancelling a factor of x or taking ln x without stating x > 0. This is the most common deduction in the module and it silently invalidates everything after it.
Justified conclusions, not computed ones. NESA awards marks for why a critical point is a maximum, minimum or saddle point2.
Finding a critical point and stopping, without classifying it. Half the marks in these items are for the classification and the justification.
Geometric reasoning, since the descriptor names “algebraic, diagrammatic and graphical techniques”2. If you cannot draw it, you probably do not understand it.
Drawing the locus and never showing the algebra. The diagram is worth a mark; the simplification is worth the rest.
Defended models. The descriptor’s “insight” requirement2 applies here as justified assumptions about the physical situation.
Mixing degrees and radians in circular motion. If θ is in radians, r = v/ω holds directly; in degrees a conversion factor appears. Pick radians and state that you have.
Let f(x) = 2x2 − 4x + 3. Show that f(x) ≥ 1 for all real x, and state the value of x for which equality holds.
We complete the square. Since 2x2 − 4x + 3 = 2(x2 − 2x) + 3, and
x2 − 2x = x2 − 2x + 1 − 1 = (x − 1)2 − 1,
we obtain
f(x) = 2[(x − 1)2 − 1] + 3 = 2(x − 1)2 + 1. [2 marks for the completing-square derivation]
Since the square of any real number is non-negative, 2(x − 1)2 ≥ 0, and therefore f(x) = 2(x − 1)2 + 1 ≥ 1 for all real x. [2 marks: one for the non-negativity argument, one for the conclusion]
Equality holds when 2(x − 1)2 = 0, that is, when x = 1. [1 mark]
| Element | Why it is here |
|---|---|
| The equality of the two expressions, shown line by line | This is the proof. Asserting “completing the square gives…” without the algebra loses marks. |
| “the square of any real number is non-negative” | The justification. Without it, the conclusion is a claim rather than a proof2. |
| The equality condition derived, not guessed | Distinguishes a complete answer from a partially correct one. |
Prove that for all n ∈ ℕ, 2n ≥ n + 1.
Base case: For n = 1, 21 = 2 ≥ 1 + 1 = 2, so the claim is true for n = 1. [1 mark]
Inductive step: Assume the claim holds for some k ∈ ℕ, that is, assume 2k ≥ k + 1. [1 mark]
Then 2k+1 = 2 · 2k ≥ 2(k + 1) = 2k + 2, using the induction hypothesis in the second step. Since 2k + 2 = (k + 1) + (k + 1) ≥ (k + 1) + 1 for k ≥0, we conclude that 2k+1 ≥ (k + 1) + 1. [1 mark]
Therefore, by mathematical induction, 2n ≥ n + 1 for all n ∈ ℕ. [1 mark]
| Element | Why it is here |
|---|---|
| “using the induction hypothesis in the second step” | Explicitly names which line is not derivable from arithmetic. This is the multi-step logic the descriptor requires2. |
| The final inequality chain completing 2k + 2 ≥ (k+1)+1 | Often skipped, and it is where the last mark lives. k ≥ 0 is used — say so. |
Show that the locus of points z = x + iy satisfying |z − 1| = |z + 2| is a straight line, and identify it.
Since |z − 1| = √((x−1)2 + y2) and |z + 2| = √((x+2)2 + y2), the condition becomes
(x−1)2 + y2 = (x+2)2 + y2 ⇒ x2 − 2x + 1 = x2 + 4x + 4 ⇒ −6x = 3 ⇒ x = −½. [3 marks]
The locus is the vertical line x = −½, parallel to the imaginary axis through −½ + 0i. This is the perpendicular bisector of the points 1 + 0i and −2 + 0i, as expected, since the locus of points equidistant from two fixed points is their perpendicular bisector. [1 mark]
| Element | Why it is here |
|---|---|
| Expanding the moduli into coordinates | This is the algebraic technique. Without it there is no argument at all. |
| Squaring justified | Both sides are non-negative, so squaring is reversible. Omitting this is an unstated logical step — exactly what E4 forbids and E3 tolerates2. |
| The geometric identification at the end | Connects the algebra back to meaning. The descriptor explicitly rewards “diagrammatic and graphical techniques”. |
Prove that if n2 + 1 is divisible by 5, then n2 + 2 is divisible by 3.
Let n ∈ ℤ and suppose n2 + 1 is divisible by 5, so n2 + 1 = 5m for some m ∈ ℤ. Therefore n2 = 5m − 1, and reducing modulo 3 gives
n2 ≡ 2m − 1 (mod 3). [1 mark]
Since n2 ≡ 0 or 1 (mod 3) for any integer n — squares are never 2 modulo 3 — the right-hand side can only be 0 or 1 modulo 3. If 2m − 1 ≡ 0 then m ≡ 2 (mod 3); if 2m − 1 ≡ 1 then m ≡ 1 (mod 3). [2 marks]
Suppose m ≡ 1 (mod 3). Then n2 = 5m − 1 ≡ 5 − 1 ≡ 1 (mod 3), which is consistent, and n2 + 2 ≡ 1 + 2 ≡ 0 (mod 3). [1 mark]
Suppose instead m ≡ 2 (mod 3). Then n2 = 5m − 1 ≡ 10 − 1 ≡ 0 (mod 3), so n ≡ 0 (mod 3). Substituting back into n2 + 1 ≡ 5m divided by 5 gives n2 + 1 ≡ 1 (mod 5), so n2 ≡ 0 (mod 5), forcing 5 | n, hence 15 | n. This is consistent with n ≡ 0 (mod 3) and gives n2 + 2 ≡ 2 (mod 3), so 3 ∤ (n2 + 2) — contradicting the required conclusion; hence this case cannot arise in the setting of the problem. [1 mark]
Therefore in every admissible case n2 + 2 ≡ 0 (mod 3), so n2 + 2 is divisible by 3. [concluding mark]
| Annotation | Why it is there |
|---|---|
| “Let n ∈ ℤ” before use | Variables are declared. This is a written-communication convention and it is marked. |
| “reducing modulo 3” named explicitly | Names the technique, so the step is markable rather than appearing from nowhere. |
| “squares are never 2 modulo 3” stated as a fact with a reason | This is the insight. It converts an unbounded case analysis into a two-case one2. |
| Exhaustive case analysis with both cases resolved | The claim is universally quantified, so all cases must be covered. “Proves results” means complete coverage, not a plausible route. |
| A closing sentence restating the claim | Closes the argument2. Never end a proof on an intermediate line. |
In this course almost every one of these is a logic error rather than an arithmetic error.
Cancelling x, taking ln x, dividing an inequality, or expanding a series — all without stating the condition required.
Proving the converse or the contrapositive when the question asked for the direct statement.
Handling one branch of a disjunction and assuming the other away. Universal claims require all cases.
Checking three values and declaring a general result true.
E4 requires concise notation2. Padding with redundant algebra obscures the argument and reads as uncertainty.
Using n before saying n ∈ ℕ, or conflating “for all” with “there exists”.
Writing “completing the square gives…” with no algebra, or “equating gives…” with no comparison shown.
Ending a proof on the last algebraic line without stating what has been established.
Finding ∇f = 0 and stopping, without second-derivative tests.
Revising only Extension 2 content, when Advanced and Extension 1 are both assumed knowledge1.
Half the final mark3, in a course with a small cohort where one bad result moves your position a long way.
Reading worked proofs is passive; it does not build the ability to produce one.
Assumes roughly 8 hours per week. Note that one hour in three goes to Advanced and Extension 1, because both are assumed knowledge1.
Sit a full Extension 2 paper cold. Separately, sit a full Advanced paper to see how much assumed knowledge is intact.
Converse, contrapositive, inverse. Write each claim symbolically before proving it.
Base case, step, conclusion as three separate labelled parts. Mock 1 at the weekend.
Inequality proofs via completing the square and sign analysis. Always state domain conditions.
Convergence conditions, general term, coefficient extraction. Complete every “hence”.
Partial derivatives, second-derivative tests, boundary checks, optimisation arguments. Mock 2 at the weekend.
Locus proofs with algebra shown, conjugate root justification, De Moivre proved by induction.
Two-dimensional motion with declared coordinate systems, related rates by chain rule first. Mock 3 at the weekend.
Full Extension 1 paper plus targeted work on whichever module the mock exposed. Assumed knowledge, not optional.
One Advanced topic, then 20 proofs written from scratch, guideline-marked. Mock 4 at the weekend.
Sit Extension 1 then Extension 2 back to back, as NESA requires1. This is the only realistic rehearsal of the real conditions.
Proof skeletons only: the four techniques, induction frames, condition-stating habits. No new content. Sleep properly.
Tick only if true of your last full timed paper.
In-text citations on this page use the bracketed numbers in the superscript markers.