Learn in your language
Skip to content
A Level · Cambridge (CIE) · 9709

Write vector equations of lines from points and directions

Interpret r = a + td, construct a line from two points, and distinguish a full line from a bounded segment.

Pure Mathematics 3 · Vectors · 3.7
Exam scope and assessment notes

Pure Mathematics 3 (Paper 3, A Level) · Mathematics 9709, 2026–2027, section 3.7. Paper 1 coordinate geometry and algebra are assumed. Work in two or three dimensions as stated. The general section theorem is not included; midpoint geometry is required. The cross product, shortest distance between skew lines and their common perpendicular are not required. Scalar products include angles between lines and the foot of a perpendicular from a point to a line, including 3D solids. Written practice is self-checked; human subject-teacher review remains pending.

Before you begin

  • Find the displacement between two points.
  • Solve linear equations and interpret scalar multiples of a direction vector.

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

Quick readiness check

A and B are distinct points. Which direction vector can define their line?

What you will learn

  • Explain the position vector, anchor, non-zero direction vector and scalar parameter in a line equation.
  • Construct a line from a point and direction or two distinct points, and check membership using every coordinate.
One parameter moves every coordinater = (1,1)ᵀ + t(2,1)ᵀxyt = −1t = 0t = 1t = 2One step in t adds (2,1)ᵀ
The plotted line has equation r = (1, 1)ᵀ + t(2, 1)ᵀ. The four markers at t = −1, 0, 1 and 2 have positions (−1, 0), (1, 1), (3, 2) and (5, 3). Each unit parameter step adds displacement (2, 1)ᵀ. The line continues beyond the plotted window, and a full line permits every real t. The parameter is a scalar position label, not automatically elapsed time. Reversing or rescaling the direction changes parameter values without changing the full line.

One parameter changes every coordinate together

In r = a + td, r is the position of a general point on the line, a is the position of a fixed anchor point, d is a non-zero direction vector and t is a real scalar. At t = 0 the point is a; increasing t by 1 moves by d. A full line allows all real t, while a segment or physical path may restrict its range. The parameter need not represent time unless the question says that it does.

For a = (1, −2, 3)ᵀ and d = (2, 1, −1)ᵀ, the equation gives x = 1 + 2t, y = −2 + t and z = 3 − t. The point (5, 0, 1) belongs at t = 2. The point (5, 0, 2) does not: the first two coordinates imply t = 2 but the third would have to be 1. All coordinates must come from one common parameter value for a point on a single line.

Different equations can describe the same line

Given distinct points A and B, use d = b − a and r = a + t(b − a). The segment AB corresponds to 0 ≤ t ≤ 1 in this particular parametrisation. Any non-zero scalar multiple of d gives the same full line, with a rescaled parameter; its old bounds cannot be copied without checking. A different anchor on the same line is also valid. A zero direction vector gives one point, not a line.

The diagram uses r = (1, 1)ᵀ + t(2, 1)ᵀ. Its marked positions at t = −1, 0, 1 and 2 are (−1, 0), (1, 1), (3, 2) and (5, 3). Each unit parameter step adds the same vector (2, 1)ᵀ. Replacing the direction by (4, 2)ᵀ leaves the full line unchanged but halves the parameter needed to reach the same point from the same anchor. Separate the geometry of the line from the choice of parameter.

Pause and explain

A candidate point matches x and y at t = 2 but fails z at t = 2. Is it on that 3D line?

Put the idea to work

Worked example

For r = (1, −2, 3)ᵀ + t(2, 1, −1)ᵀ, test P = (5, 0, 1) and Q = (5, 0, 2).

Show the worked solution
  1. The x coordinate requires t = 2 for both points.
  2. At t = 2 the line has y = 0 and z = 1, so P belongs.
  3. Q has z = 2 and fails the third coordinate despite matching x and y.

Answer P belongs at t = 2; Q does not belong.

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

Write the full line through A = (1, 2, −1) and B = (5, 0, 3), then give the bounds for segment AB in your parametrisation.

Give me a hint

Use B − A as the direction and A as the anchor.

Compare my reasoning
  1. The direction is (4, −2, 4)ᵀ.
  2. A valid line is r = (1, 2, −1)ᵀ + t(4, −2, 4)ᵀ for t ∈ ℝ.
  3. A occurs at t = 0 and B at t = 1, so segment AB uses 0 ≤ t ≤ 1.

r = (1, 2, −1)ᵀ + t(4, −2, 4)ᵀ; full line t ∈ ℝ, segment 0 ≤ t ≤ 1.

Look for these in your work

  • Use a non-zero between-point direction.
  • Check both endpoints and distinguish the full line from the segment.
2 · Independent

For r = (2, −1, 4)ᵀ + t(−1, 2, 0)ᵀ, test P = (−1, 5, 4) and Q = (−1, 5, 5). Show that r = P + u(2, −4, 0)ᵀ gives the same full line.

Give me a hint

Check the constant third coordinate and find the relation between t and u.

Compare my reasoning
  1. The first two coordinates require t = 3; z is always 4, so P belongs and Q does not.
  2. The new anchor P is on the original line and the new direction is −2 times the original direction.
  3. Using t = 3 − 2u makes both equations identical for all real u, proving the same full line.

P belongs at t = 3; Q does not; the second equation is equivalent with t = 3 − 2u.

Look for these in your work

  • Check constant coordinates as well as the changing ones.
  • Verify an anchor and a non-zero proportional direction or an exact parameter relation.
3 · Transfer

A straight pipe segment runs from A = (1, 1, 0) m to B = (5, 3, 2) m. Parametrise its centre line using A + t(B − A), find the position at t = 3/4, and decide whether (7, 4, 3) lies on the pipe segment.

Give me a hint

The physical segment has 0 ≤ t ≤ 1; a point on its infinite extension may lie outside those bounds.

Compare my reasoning
  1. The equation is r = (1, 1, 0)ᵀ + t(4, 2, 2)ᵀ with 0 ≤ t ≤ 1.
  2. At t = 3/4 the position is (4, 5/2, 3/2) metres.
  3. The candidate (7, 4, 3) corresponds to t = 3/2, so it is on the infinite extension but outside the pipe segment.

Segment r = (1, 1, 0)ᵀ + t(4, 2, 2)ᵀ, 0 ≤ t ≤ 1; at 3/4: (4, 5/2, 3/2) m; candidate is outside the segment.

Look for these in your work

  • Use the stated physical endpoints to set parameter bounds.
  • Check every coordinate and the range before accepting membership of the segment.

Common mistakes

  • Use one parameter value for all coordinates of one line.
  • A direction vector is a displacement, not an arbitrary second point's position.
  • Equivalent full-line equations may have different parameter values and segment bounds.
Recall without your notes

What can you explain now?

What point does r = a + td describe at t = 0?

Compare with the explanation

The anchor with position a.

The displacement term is zero, leaving the fixed position vector.

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.

Make it stick

Explain every symbol in a vector line equation, construct one from two points, and test a point against all coordinates and any parameter bounds.

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

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.

StudyForA · Learn with understanding

Original teaching content and links to official sources. Check your exam year and qualification before using a resource.