A Level · Cambridge (CIE) · 9709

Solve modulus equations and reject invalid signed candidates

Use both sign branches, then check original equations when a right-hand expression may be negative.

Section 3.1 · Algebra

Pure Mathematics 2 & 3 · Shared Algebra foundations · 2.1 / 3.1

Exam scope and assessment notes

Pure Mathematics 2 (Paper 2, AS only) and Pure Mathematics 3 (Paper 3, A Level) · Shared Algebra foundations, Mathematics 9709, 2026–2027. Paper 1 knowledge is assumed. These modulus and polynomial requirements occur in both sections 2.1 and 3.1. Paper 3 additionally requires partial fractions and rational-power binomial expansions; follow its separate lessons for those methods. The AS route using Papers 1 + 2 cannot be carried forward to A Level. Both sections use linear modulus graphs; nonlinear y = |f(x)| and y = f(|x|) graphs are excluded. Polynomial dividends have degree at most 4 and divisors are linear or quadratic. Written practice is self-checked.

Before you begin

Interpret modulus as a non-negative value.
Solve linear equations and substitute candidates into an original equation.

Work on paper. Try each question before revealing help, and explain why your method works.

Quick readiness check

For |u| = 7, which signed values can u take?

What you will learn

Solve |u| = k and |u| = |v| using the necessary sign cases.
Check a variable right-hand side is non-negative before retaining a squared-equation candidate.

Equal magnitudes allow equal or opposite signed values

For k > 0, |u| = k means u = k or u = −k. For k = 0 it means u = 0, and for k < 0 there is no real solution. For two real expressions, |u| = |v| is equivalent to u = v or u = −v, and also to u² = v². Keep both sign cases; a modulus removes a sign, not one of the possible inputs.

For |3x − 2| = |2x + 7|, the first case 3x − 2 = 2x + 7 gives x = 9. The second case 3x − 2 = −(2x + 7) gives 5x = −5, so x = −1. In the original equation these yield matching magnitudes 25 and 5 respectively. The check confirms both roots rather than relying on one branch.

Squaring needs a sign check when only one side has modulus

For |u(x)| = v(x), the right side must satisfy v(x) ≥ 0. Squaring gives a necessary equation u(x)² = v(x)², but it also allows u(x) = −v(x) when v(x) is negative, which cannot solve the original equation. Solve the branches with their sign restrictions or find candidates and substitute each into the unsquared original. Never assume every squared-equation root is valid.

For |x − 1| = 2x − 5, the right side requires x ≥ 5/2. The branches give candidates x = 4 and x = 2. At x = 4 both sides equal 3; at x = 2 they are 1 and −1. Therefore only x = 4 is valid. A time, length or other contextual domain may impose additional restrictions after the original algebraic equation has been checked.

Pause and explain

Squaring |x − 1| = 2x − 5 gives candidates 2 and 4. Which solves the original equation?

Put the idea to work

Worked example

Solve |3x − 2| = |2x + 7| and verify each answer.

Show the worked solution

Use 3x − 2 = 2x + 7 to get x = 9.
Use 3x − 2 = −(2x + 7) to get x = −1.
At x = 9 the magnitudes are both 25; at x = −1 they are both 5.

Answer x = −1 or 9; both satisfy the original modulus equation.

Try a topic test

Choose Easy, Normal or Difficult. Save your answers and open worked review after finishing.

Test this topic →

From guided practice to a new situation

Write your answer and reasoning first. Use a hint only if you are stuck. The model solution is for self-checking; your written work is not automatically marked.

1 · Guided

Solve |2x − 5| = 7 and check both roots.

Give me a hint

Set the linear inner expression equal to 7 and −7 separately.

Compare my reasoning

2x − 5 = 7 gives x = 6.
2x − 5 = −7 gives x = −1.
At these inputs the inner values are 7 and −7, both with magnitude 7.

x = −1 or 6.

Look for these in your work

Include both signed branches.
Check each root in the original modulus.

2 · Independent

Solve |x − 1| = 2x − 5, explaining any rejected candidate.

Give me a hint

Require a non-negative right side and test both branch solutions.

Compare my reasoning

The right side must be non-negative, so x ≥ 5/2.
The branches x − 1 = 2x − 5 and −x + 1 = 2x − 5 give 4 and 2.
At 4 both sides equal 3; at 2 they are 1 and −1. Reject 2 and retain 4.

x = 4 only; x = 2 is an extraneous signed candidate.

Look for these in your work

Check the right-side sign in the original equation.
State why a squared-equation candidate is excluded.

3 · Transfer

For d(t) = 3t − 12 metres on 0 ≤ t ≤ 6 seconds, find when the distance |d(t)| equals 6 m.

Give me a hint

Use signed separations +6 and −6, then check the time interval.

Compare my reasoning

3t − 12 = 6 gives t = 6 s.
3t − 12 = −6 gives t = 2 s.
Both times lie in [0, 6] and give distance 6 m, despite opposite signed separations.

t = 2 s or 6 s.

Look for these in your work

Solve both distance branches.
Check the physical time domain and the original magnitude.

Common mistakes

Include both equal and opposite signed cases.
A modulus cannot equal a negative right-hand value.
Verify candidates in the original equation after squaring.

Recall without your notes

What can you explain now?

Solve |x + 3| = −2 over the reals.

Compare with the explanation

No real solution.

A modulus is non-negative and cannot equal −2.

After trying it yourself, choose your next review. This is your self-assessment.

Your review choice appears on Today. Sign in to sync it across devices.

Continue to next lesson Back to Today

Make it stick

Explain when squaring a modulus equation is equivalent and when it produces extra candidates. Check an original right-side sign before accepting a root.

If you needed the solution, close it and solve the problem again from a blank page. A correct answer is stronger when you can explain the reason for each step.

Keep learning Mathematics

Check the official syllabus 2026–2027

Course scope and assessment

312 sequenced lessons provide 936 guided, independent and application problems covering the 160 objectives in sections 1.1–1.8, 2.1–2.6, 3.1–3.9, 4.1–4.5, 5.1–5.5 and 6.1–6.5. The map lists all 38 sections across six alternative components; all eight Pure Mathematics 1 sections and all six Pure Mathematics 2 sections, from Paper 2 Algebra through Numerical solution of equations, currently have full teaching sequences. Paper 3 Algebra, section 3.1, links the six shared foundation lessons plus six lessons on partial fractions and rational binomial expansions; Paper 3 logarithms, trigonometry and numerical equations use the shared lessons, with the Paper 1 graph foundation linked into trigonometry. Paper 3 differentiation combines the shared methods with its inverse-tangent derivative lesson. Paper 3 Integration links four shared standard and identity lessons plus seven advanced lessons, covering all six section 3.5 requirements. Eight Vectors lessons cover all six section 3.7 requirements, with 2D and 3D line and solid applications. Nine Differential equations lessons cover all four section 3.8 requirements, including Paper 3 integration techniques, initial conditions, equilibrium solutions and conditional model interpretations. Eleven Complex numbers lessons cover all eight section 3.9 requirements, with seven Argand diagrams and explicit argument and boundary checks. All nine Pure Mathematics 3 sections now have teaching linked to every mapped requirement. Nine Forces and equilibrium lessons cover all seven section 4.1 requirements, with six force diagrams, signed incline-friction intervals, reaction-dependent pull and push limits and separate-body third-law checks. Nine Kinematics lessons cover the four official section 4.2 requirements, with the graph requirement mapped to three relationships. Six motion diagrams support directed quantities, graph slopes and signed areas, Paper 1 time-calculus methods, reversal distances, constant-acceleration stages and shared-clock particle meetings. Six Momentum lessons cover both section 4.3 requirements, including signed system totals, conservation assumptions, outgoing velocities, coalescence, unknown masses and successive impacts. Four diagrams show system momentum through the stipulated events, and supplied kinetic-energy checks distinguish conservation of momentum from changes in kinetic energy. Twelve Newton’s laws lessons cover all four section 4.4 requirements, with vertical support and release stages, rough horizontal and incline motion, inferred parameters, hanging and surface pulley systems, rigid tow-bar thrust and slack-string transitions. Seven force diagrams support the separate-particle balances. Nine Energy, work and power lessons cover all five section 4.5 requirements, with angle-dependent work, kinetic and reference potential energy, signed net-work balances, smooth curved slides, rough and driven slopes, ideal connected-system energy and instantaneous power on hills. Five diagrams distinguish the energy inputs, losses and valid positive-speed force model. All five Mechanics sections now have teaching and staged practice linked to their mapped requirements. Thirteen Representation of data lessons cover all five section 5.1 requirements, including choice and limitations of displays, ordered and back-to-back stems, raw summaries and box plots, unequal-width density histograms, cumulative-frequency interpolation, descriptive moment calculations, grouped estimates, coding, combining two datasets and correcting totals. Six accessible diagrams retain repeated observations and distinguish numerical spread, frequency area and estimated readings. Ten Permutations and combinations lessons cover both official section 5.2 requirements, with selection and ordered roles, repeated objects, adjacency blocks, non-adjacency gaps, leading-zero cases, labelled multi-row seating and mixed restrictions. Six accessible diagrams show outcome trees, ordered versus unordered choices, repeated copies, blocks, gaps and distinct row seats. Eleven Probability lessons cover all four section 5.3 requirements, with equiprobable elementary outcomes, selection-based probabilities, complements and disjoint regions, independence tests, restricted sample spaces, two-way tables, replacement and removal trees, reversed conditions and unknown parameters. Seven accessible diagrams show dice outcomes, random subsets, event regions, a conditioned grid, a count table and two probability trees. Twelve Discrete random variables lessons cover all three official section 5.4 requirements, with complete probability tables, moment and parameter checks, binomial assumptions, exact probabilities and moments, geometric first-success probabilities, tails, expectation and integer reliability thresholds. Six accessible diagrams distinguish outcome grouping, weighted moments, fixed trials, discrete probability bars, waiting conventions and integer tail deadlines. Twelve Normal distribution lessons cover all three official section 5.5 requirements, with continuous-area interpretation, MF19 cumulative tables, full standardisation, tail and interval regions, conditional probabilities, percentiles, one- and two-parameter inference, binomial suitability, continuity corrections and approximate integer thresholds. Seven accessible diagrams show model areas, table reading, aligned scales, intervals, quantiles, matched binomial and normal shapes and whole integer cells. All five Statistics 1 sections now have teaching and staged practice linked to their mapped requirements. Fourteen Poisson distribution lessons cover all five official section 6.1 requirements, with homogeneous event-count assumptions, exposure scaling, exact masses and tails, conditional count events, moments, parameter inference, probability duration targets, disjoint and overlapping windows, rare-count binomial approximations, matched normal approximations and continuity corrections. Nine accessible diagrams show event exposures, unit conversions, discrete bars, complete tail complements, population moments, shared windows, approximate count models and integer cells. Exact checks distinguish approximate and exact close-target decisions. Fourteen Linear combinations lessons cover the six listed results in official section 6.2, with affine moments, signed scales and constant cases, expectation without independence, independent squared variance contributions, fixed and random fees, independent copies versus reused values, affine normal events, independent normal sums and differences, weighted and conditional areas, coefficient inference, exact independent Poisson sums and overlapping exposure limits. Nine accessible diagrams distinguish scale changes, variance contributions, component costs, copy mechanisms, aligned normal scales, summed areas, Poisson count pairs and unsupported distribution claims. Fourteen Continuous random variables lessons cover both official section 6.3 requirements, with density validity and units, support-aware intervals, complements and conditional regions, first and second moments, percentiles by direct density areas, symmetry checks, parameter inference, infinite-support power and exponential integrals, divergent-moment limits and combined applications. Nine accessible diagrams distinguish density height from probability, normalisation, negative-density failures, central and conditional areas, mean versus median, percentile locations and partial infinite tails. Explicit cumulative distribution function knowledge is not required. Eighteen Sampling and estimation lessons cover all eight official section 6.4 requirements, with population and frame definitions, random-number selection, sampling-quality limits, independent sample-mean moments, normal means, CLT conditions, SE scaling, raw, summarised and coded unbiased estimates, known-variance and large-sample mean intervals, repeated-sampling interpretation, precision planning, proportion intervals, sparse-outcome limits and contextual applications. Ten accessible diagrams distinguish selection frames, number rejection, repeated sample means, population versus mean density, CLT models, variance divisors, interval targets, illustrative coverage, integer size checks and proportion margins. Eighteen Hypothesis tests lessons cover all five official section 6.5 requirements, with pre-specified alternatives, inclusive count tails, explicit equal-tail conventions, integer critical regions and actual significance, exposure-aware Poisson tests, continuity-corrected count approximations, normal and large-sample mean tests, confidence-interval connections, error classifications, fixed-region binomial, Poisson and normal error probabilities and sample-size power comparisons. Nine accessible diagrams show the testing procedure, exact count regions, unequal Poisson tails, discrete significance jumps, corrected count boundaries, matching mean intervals and alternative error distributions. All shared lessons are counted once in the course total. All 38 sections now link teaching and practice. Eight earlier overview lessons remain available, but do not count as full section coverage. This is a content-availability measure, not full programme completion or exam readiness. Written practice is self-checked, not officially marked. Check the 2028–2030 syllabus separately if sitting an examination from 2028; this teaching map uses 2026–2027 requirements.