Unit FP1: Further Pure Mathematics AS 1
- Syllabus
- 2019
- Section
- —
- Level
- AS
A complex number combines a real part and an imaginary part: z=a+ib, where a,b∈R and i2=−1. Its polar form records the same number by its distance r from the origin and its directed angle θ from the positive real axis.
z=a+ib=r(cosθ+isinθ),r=∣z∣=a2+b2
| Feature | Meaning |
|---|---|
| Rez=a | real part |
| Imz=b | imaginary part, without the factor i |
| z∗=a−ib | conjugate: reflection in the real axis |
| argz=θ | principal argument, −π<θ≤π for z=0 |
| equality | a+ib=c+id exactly when a=c and b=d |
For z=−3+33,i, ∣z∣=9+27=6,argz=32π, because the point lies in quadrant II. Hence z=6(cos32π+isin32π),z∗=−3−33,i.
Use the signs of both components to choose the correct quadrant; a calculator value of an−1(b/a) alone may give the wrong argument. The zero complex number has modulus 0 but no defined argument.
Add and subtract complex numbers by matching real and imaginary parts. For products, expand and replace i2 by −1. For a quotient, multiply numerator and denominator by the conjugate of the denominator so the denominator becomes real.
| Operation | Example |
|---|---|
| sum | (2+i)+(−3+4i)=−1+5i |
| product | (2+i)(1−3i)=5−5i |
| quotient | 1−2i2+i=(1−2i)(1+2i)(2+i)(1+2i)=i |
∣z1z2∣=∣z1∣∣z2∣
The conjugate identity (c+id)(c−id)=c2+d2 explains why rationalising a quotient works. The modulus-product rule can find an unknown modulus without first expanding the product; for example, if ∣z1z2∣=15 and ∣z1∣=3, then ∣z2∣=5.
Keep the final answer in the requested form, usually a+ib, and simplify both parts. This unit does not require memorising rg(z_1z_2)=rg z_1+rg z_2; do not use that unrequired result as a substitute for the specified algebra or geometry.
An Argand diagram plots z=x+iy as the point (x,y): the horizontal axis is Rez and the vertical axis is Imz. The vector from the origin has length ∣z∣ and direction argz.
| Operation | Geometrical effect |
|---|---|
| add w | translate by the vector representing w |
| multiply by r(cosθ+isinθ) | enlarge by factor r and rotate through θ about the origin |
| divide by r(cosθ+isinθ) | scale by 1/r and reverse that rotation |
Multiplication by i makes the geometry visible algebraically: i(x+iy)=−y+ix. Thus (x,y) maps to (−y,x), a 90∘ anticlockwise rotation. Multiplication by 2i adds enlargement by factor 2; division by i rotates 90∘ clockwise.
Complex roots with real coefficients often appear as conjugate points reflected in the real axis. Distances, perimeters and areas on an Argand diagram are ordinary coordinate geometry once each complex number has been placed at its real and imaginary coordinates.
Label the real and imaginary axes in the correct order and preserve relative scale. A conjugate changes only the sign of the imaginary coordinate; it is not reflection in the imaginary axis.
A quadratic with real coefficients can have complex solutions when its discriminant is negative. Use the ordinary quadratic formula and rewrite the square root of a negative number using −k=ik for k>0.
az2+bz+c=0⟹z=2a−b±b2−4ac
For z2−6z+13=0, the discriminant is (−6)2−4(1)(13)=−16. Therefore z=26±−16=26±4i=3±2i. Substitution or the sum and product of the two roots checks the result.
Do not stop at −16 or discard it as having no solution: it has no real square root, but the complex square roots are ±4i. With real coefficients, the non-real solutions produced by the quadratic formula form a conjugate pair.
For a polynomial with real—in particular integer—coefficients, every non-real root occurs with its complex conjugate. In a cubic, a known non-real root therefore supplies a quadratic factor, leaving one real linear factor.
a+ib and a−ib⟹[x−(a+ib)][x−(a−ib)]=(x−a)2+b2
Suppose f(x)=x3−5x2+11x−15 and 1+2i is a root. Then 1−2i is also a root, giving [x−(1+2i)][x−(1−2i)]=x2−2x+5. Division gives f(x)=(x2−2x+5)(x−3), so the third root is 3.
Form the real quadratic factor from the conjugate pair; divide the cubic by it; solve the remaining linear factor; then state all three roots. Multiplying the factors back together checks that no coefficient or sign has drifted.
The conjugate-root conclusion depends on the polynomial coefficients being real. Do not conjugate a real root into a new root: its conjugate is itself. A factor is x−r, so a root r introduces the opposite sign inside its factor.
A quartic with real coefficients has four roots counting multiplicity. Use every supplied root to build factors: a non-real root supplies its conjugate, while each stated real root supplies one linear factor. Divide or compare coefficients to find the remaining factor.
| Given evidence | Factor secured |
|---|---|
| root a+ib, b=0 | (x−a)2+b2 |
| real root r | x−r |
| two real roots r,s | (x−r)(x−s) |
Let f(x)=x4−7x3+13x2+x−20, with roots 2+i and −1. Real coefficients also give 2−i, so [x−(2+i)][x−(2−i)]=x2−4x+5. The root −1 gives x+1. Dividing by (x2−4x+5)(x+1) leaves x−4, so the four roots are 2+i, 2−i, −1, 4.
State all four roots and count multiplicity. Do not assume every remaining root is real unless the factorisation proves it, and do not use decimal approximations when exact algebraic roots are available. Multiply the completed factors to verify the original quartic.
If α and β are the roots of ax2+bx+c=0 with a=0, their sum and product can be read directly from the coefficients. There is no need to solve the quadratic first.
α+β=−ab,αβ=ac
The result comes from a(x−α)(x−β)=a[x2−(α+β)x+αβ]. Comparing the coefficients of x and the constant term with ax2+bx+c gives the two relationships.
For 2x2−3x+7=0, α+β=−2−3=23,αβ=27. These values remain valid whether the roots are real or complex.
The minus sign belongs only to the sum formula. Divide by the leading coefficient a in both formulas, and identify b with its written sign. Do not use these relations on an expression that has not first been arranged as ax2+bx+c=0.
A symmetric expression is unchanged when α and β are swapped. Such expressions can often be rewritten using only S=α+β and P=αβ, so the individual roots never need to be found.
| Expression | In terms of S and P |
|---|---|
| α2+β2 | S2−2P |
| α3+β3 | S3−3PS |
| α4+β4 | (S2−2P)2−2P2 |
| α1+β1 | PS, when P=0 |
For the roots of 2x2−3x+7=0, S=3/2 and P=7/2. Hence α2+β2=(23)2−2(27)=−419, and α3+β3=(23)3−3(27)(23)=−899.
First replace every paired sum, product or reciprocal by S and P; then substitute the coefficient values; finally simplify exact fractions. If a higher power appears, build it from a lower symmetric identity rather than expanding unknown roots separately.
These shortcuts apply to symmetric combinations. An expression such as lpha-eta changes sign when the roots are swapped and is not determined by S and P alone without an additional sign choice. Check denominators before using reciprocal identities.
To form a quadratic whose roots are transformed versions u and v of α and β, calculate their new sum S′=u+v and product P′=uv. The required monic equation is then x2−S′x+P′=0.
| New roots | S′ | P′ |
|---|---|---|
| α2,β2 | S2−2P | P2 |
| α3,β3 | S3−3PS | P3 |
| 1/α,1/β | S/P | 1/P |
| 1/α2,1/β2 | (S2−2P)/P2 | 1/P2 |
| α+k/β, β+k/α | S+kS/P | P+2k+k2/P |
For the roots of 2x2−3x+7=0, S=3/2 and P=7/2. New roots 1/α and 1/β have S′=PS=73,P′=P1=72. Thus x2−73x+72=0, or, with integer coefficients, 7x2−3x+2=0.
Write the two new roots explicitly; derive their sum and product before inserting numbers; form x2−S′x+P′=0; then multiply through by the least common denominator. A non-zero multiple represents the same quadratic equation, so simplify to integer coefficients when requested.
Do not transform the old coefficients directly unless the sum/product derivation proves the rule. Reciprocal transformations require $P
e0.Keeptheminussigninx^2-S'x+P'$, and verify the final coefficient ratio after clearing fractions.
Numerical root methods approximate a solution of f(x)=0 when exact algebra is unavailable or inconvenient. First locate a root: if f is continuous on [a,b] and f(a)f(b)<0, then at least one root lies between a and b.
| Method | Next approximation or interval | Main control |
|---|---|---|
| interval bisection | evaluate the midpoint m=(a+b)/2 and keep the half whose endpoint values have opposite signs | preserves a sign-change bracket; width halves each step |
| linear interpolation | x≈a−f(b)−f(a)f(a)(b−a) | uses the x-intercept of the chord through the two endpoint values |
| Newton-Raphson | xn+1=xn−f′(xn)f(xn) | uses the tangent at xn; needs f′(xn)=0 |
For f(x)=x3−x−1, f(1)=−1 and f(2)=5, so continuity gives a root in [1,2]. Since f(1.5)=0.875, one bisection gives [1,1.5]; since f(1.25)=−0.296875, a second gives [1.25,1.5]. The interval width is now 0.25.
Using x0=1.3 for the same function, f′(x)=3x2−1. One Newton-Raphson step gives x1=1.3−3(1.3)2−11.33−1.3−1=1.325307…. Keep unrounded values inside the calculation, then round the requested approximation only at the end.
Bisection is slower but keeps a certified bracket. Linear interpolation usually improves a bracket with one straight-line estimate. Newton-Raphson can converge quickly from a suitable starting value, but it does not preserve a bracket and a poor start or a near-zero derivative may send the iteration away from the intended root.
A sign change plus continuity proves at least one root, not exactly one. Always show the function values that select a bisection half, use the stated interval or starting approximation, differentiate the actual function for Newton-Raphson, and report the precision requested rather than rounding every intermediate value.
The FP1 standard conics are a parabola with its vertex at the origin and axis along the x-axis, and a rectangular hyperbola whose asymptotes are the coordinate axes. Their constants control scale, not a translation of the centre or vertex.
| Curve | Cartesian equation | Key features |
|---|---|---|
| parabola | y2=4ax | vertex (0,0); axis y=0; for a>0 it opens to the right |
| rectangular hyperbola | xy=c2, or y=c2/x | asymptotes x=0 and y=0; branches lie where x and y have the same sign |
For y2=12x, comparison with y2=4ax gives a=3. For xy=25, comparison with xy=c2 gives c=5 or c=−5; the curve depends on c2, so the conventional positive scale is ∣c∣=5.
Do not confuse 4a with a, or c2 with c. A rectangular hyperbola never meets either coordinate axis because $xy=c^2
e0$. These standard equations are not the general translated or rotated forms of every parabola or hyperbola.
A parameter replaces the two coordinates of a point by one variable. Substitution verifies that the parameterised point lies on the conic and lets the same algebra describe every allowed point.
| Curve | General point | Verification |
|---|---|---|
| y2=4ax | (at2,2at), t∈R | (2at)2=4a(at2) |
| xy=c2 | (ct,c/t), t=0 | (ct)(c/t)=c2 |
On y2=12x, a=3. At t=2, the point is (3⋅22,2⋅3⋅2)=(12,12). Conversely, a point with y=12 has t=y/(2a)=2. On xy=25, taking c=5 and t=−2 gives (−10,−5/2), whose coordinate product is 25.
The same letter t labels a point; it is not a coordinate or a fixed curve constant. The hyperbola excludes t=0. For this unit, understanding and using the general points is required, but parametric differentiation is not.
A parabola is the locus of points whose distance from a fixed point, the focus, equals their perpendicular distance from a fixed line, the directrix.
y2=4ax:focus (a,0),directrix x=−a
For P=(x,y) on y2=4ax with a>0, PF2=(x−a)2+y2=(x−a)2+4ax=(x+a)2. Since the perpendicular distance from P to x=−a is x+a, the two distances are equal. This also places the vertex midway between focus and directrix at (0,0).
For y2=20x, a=5, so the focus is (5,0) and the directrix is x=−5. The point (5,10) lies on the curve. Its distance from the focus is 10, and its perpendicular distance from the directrix is also 5−(−5)=10.
Distance to a line means the shortest, perpendicular distance—not distance to an arbitrary point on the line. For x=−a it is the horizontal distance. Do not place the directrix at x=a or the focus at (4a,0).
Find a tangent gradient by differentiating the Cartesian equation, then use the negative reciprocal for the normal gradient. A parameter may identify the point, but parametric differentiation is not required.
| Curve and point | Tangent gradient | Tangent | Normal |
|---|---|---|---|
| y2=4ax, P=(at2,2at) | 1/t | ty=x+at2 | y=−tx+2at+at3 |
| xy=c2, P=(ct,c/t) | −1/t2 | x+t2y=2ct | t3x−ty=c(t4−1) |
For the parabola, 2ydy/dx=4a, so dy/dx=2a/y=1/t at P. For the hyperbola, y=c2x−1 gives dxdy=−x2c2=−t21. Insert each point and gradient into y−y0=m(x−x0), then simplify.
For y2=8x, a=2. At parameter t=3, P=(18,12). The tangent is 3y=x+18, and the normal is y=−3x+66. Their gradients 1/3 and −3 multiply to −1, checking perpendicularity.
Do not differentiate x=at2 and y=2at with respect to t in this unit. The gradient formulas containing 1/t exclude the parabola's vertex t=0; there the tangent is the vertical line x=0 and the normal is y=0.
Two matrices can be added or subtracted only when they have the same order. Combine entries that occupy the same row and column; the result has that same order.
A=(aij), B=(bij) of the same order⟹A±B=(aij±bij)
For A=(23−14),B=(5−321), match corresponding positions: A+B=(7015),A−B=(−36−33). For example, the lower-left entry of A−B is 3−(−3)=6.
Do not combine whole rows or columns, and do not add matrices of different orders. Subtraction is order-sensitive: A−B=−(B−A), so reversing the matrices usually changes every sign.
A scalar is a single number. Multiplying a matrix by a scalar multiplies every entry by that number while leaving the matrix order unchanged.
kA=k(aij)=(kaij)
If A=(23−14), then −3A=(−6−93−12). The negative scalar reverses each sign as well as multiplying each magnitude by 3. Also, 0A is the zero matrix of the same order as A.
The scalar must reach every entry, not just a row, a column or the diagonal. Scalar multiplication is different from a product of two matrices: it needs no row-by-column calculation and never changes the matrix order.
The product AB exists when the number of columns of A equals the number of rows of B. If A is m×n and B is n×p, then AB is m×p.
(AB)ij=r=1∑nairbrj
To find one entry, take a row from the first matrix and the matching column from the second, multiply corresponding terms, then add. Repeat for every row-column pair.
Let A=(1023−14),B=2−13102. Their inner dimensions are both 3, so AB=(1(2)+2(−1)+(−1)(3)0(2)+3(−1)+4(3)1(1)+2(0)+(−1)(2)0(1)+3(0)+4(2))=(−39−18).
Matrix multiplication is generally not commutative: even when both AB and BA exist, they need not be equal. Here AB is 2×2 but BA is 3×3, so equality is impossible. A2 means AA, not squaring each entry.
The determinant of a 2 by 2 matrix is one number found by multiplying along the main diagonal and subtracting the product along the other diagonal.
A=(acbd)⟹detA=∣A∣=ad−bc
| Determinant | Classification | Consequence |
|---|---|---|
| detA=0 | singular | A has no inverse |
| detA=0 | non-singular | A has an inverse |
For A=(4273), detA=4(3)−7(2)=−2, so A is non-singular. By contrast, for S=(2163), detS=2(3)−6(1)=0, so S is singular.
Keep the subtraction order ad−bc; it is not ac−bd and not the sum of the diagonal products. For a matrix containing a parameter, find the determinant expression first and solve detA=0 only when testing singularity.
An inverse A−1 reverses the effect of a square matrix: AA−1=A−1A=I. A 2 by 2 inverse exists exactly when the determinant is non-zero.
A=(acbd), ad−bc=0⟹A−1=ad−bc1(d−c−ba)
Keep the main-diagonal entries but swap their positions, change the signs of the other two entries, then multiply the resulting matrix by the reciprocal of the determinant.
For A=(4273), detA=−2, so A−1=−21(3−2−74). Multiplying A by this result gives I, which checks both the entry changes and the determinant factor.
(AB)−1=B−1A−1
The order reverses because B−1 must first undo B: (AB)(B−1A−1)=A(BB−1)A−1=I. This relation requires both A and B to be invertible.
If detA=0, division by the determinant is impossible and no inverse exists. Do not leave the factors in their original order: A−1B−1 does not generally invert AB.
A 2 by 2 matrix represents a linear transformation by multiplying each position column vector. The two columns of the matrix are the images of the coordinate basis vectors.
A=(acbd)⟹(xy)↦A(xy)=(ax+bycx+dy)
In particular, (01)↦(ca) and (10)↦(db). Knowing those two images therefore determines the whole matrix.
If A=(2−113), then (4−2)↦(2(4)+1(−2)−1(4)+3(−2))=(6−10).
If B acts first and A acts second, then a vector follows v↦Bv↦A(Bv)=(AB)v. Thus AB represents B followed by A: the right-hand factor acts first.
Matrix multiplication acts on column vectors written on the right. Reading the product from left to right reverses the transformation order and usually gives a different image.
A standard transformation matrix is identified by what it does to coordinates, or equivalently by the images of the basis vectors in its columns. All transformations here are centred at the origin where a centre is needed.
| Single transformation | Matrix |
|---|---|
| reflection in the x-axis | (100−1) |
| reflection in the y-axis | (−1001) |
| reflection in y=x | (0110) |
| reflection in y=−x | (0−1−10) |
| rotation by θ anticlockwise | (cosθsinθ−sinθcosθ) |
| stretch parallel to the x-axis, factor p | (p001) |
| stretch parallel to the y-axis, factor q | (100q) |
| enlargement, centre (0,0), factor k=0 | (k00k) |
A rotation of 210∘ anticlockwise has cos210∘=−3/2 and sin210∘=−1/2, so its matrix is (−23−2121−23). Exact trigonometric values keep the transformation exact.
To identify an unfamiliar matrix, test its effect on (1,0) and (0,1) and compare both images with the table. A full description includes the transformation type, line or centre where relevant, direction and angle for a rotation, and scale factor for a stretch or enlargement.
A stretch parallel to an axis changes the coordinate in that direction: an x-parallel stretch changes x, not y. A negative enlargement factor is allowed, but its centre is still the origin. Do not describe a general product as a standard single transformation unless its action supports that identification.
A sequence of linear transformations is represented by a matrix product in reverse reading order: the matrix for the last transformation is placed on the left.
A followed by B⟹v↦Av↦B(Av)=(BA)v
Let R=(01−10) rotate 90∘ anticlockwise, and let S=(2001) stretch parallel to the x-axis by factor 2. Rotation followed by stretch has matrix SR=(2001)(01−10)=(01−20).
For v=(21), the separate transformations give (21)↦(1−2)↦(1−4). The product gives SR(21)=(1−4), confirming the order.
Repeating the same transformation A exactly n times gives An. For example, four successive quarter-turns give R4=I, returning every vector to its original position.
Do not multiply matrices in the order the actions are spoken. In general BA=AB, so reversing the factors changes the combined transformation. A product need not match one of the standard single transformations.
A non-singular transformation can be undone by its inverse matrix. Its determinant also controls area: every finite region has its area multiplied by the absolute value of the determinant.
M=(acbd),detM=ad−bc=0⟹M−1=ad−bc1(d−c−ba)
area after transformation=∣detM∣×area before transformation
For M=(2013), detM=6. Hence M−1=61(30−12), and a region of area 5 is transformed to a region of area ∣6∣×5=30. Conversely, divide the image area by 6 to recover the original area.
For invertible transformations, (AB)−1=B−1A−1: the inverse first undoes the action performed last. This is the transformation meaning of the reverse-order inverse rule.
Area uses ∣detM∣, never a negative scale factor. If detM=0, areas collapse to zero and the transformation has no inverse, so division by the determinant is invalid.
A finite sum can be evaluated by rewriting its summand as a polynomial in the index, splitting it term by term, and applying the standard results. Here n is a positive integer.
| Sum from r=1 to n | Standard result |
|---|---|
| ∑1 | n |
| ∑r | 2n(n+1) |
| ∑r2 | 6n(n+1)(2n+1) |
| ∑r3 | (2n(n+1))2 |
Summation is linear: constants may be taken outside and separate polynomial terms may be summed separately. Thus r=1∑n(ar3+br2+cr+d)=ar=1∑nr3+br=1∑nr2+cr=1∑nr+dn. Expand or factor the summand before choosing the formulas.
For the official model form, r=1∑nr(r2+2)=r=1∑n(r3+2r)=(2n(n+1))2+n(n+1). Factoring gives 4n(n+1)(n(n+1)+4). This preserves the equality for every positive integer n, rather than checking only particular values.
For a different lower limit, define F(m)=∑r=1mf(r). Then r=a∑bf(r)=F(b)−F(a−1). For example, with f(r)=r2+2, r=4∑10(r2+2)=F(10)−F(3)=(385+20)−(14+6)=385.
Subtract through a−1, not through a. If a sum starts at r=0, include the r=0 term separately; in particular, ∑r=0nc=c(n+1). The method of differences is not required in FP1, so do not replace this standard-results method with telescoping or partial-fraction differences.
Mathematical induction proves a statement P(n) for every integer n≥n0 by establishing a starting case and a chain: whenever one case is true, the next case must be true.
| Stage | What the proof must establish |
|---|---|
| Base case | Substitute n=n0 and verify both sides or the required property. |
| Induction hypothesis | Assume P(k) is true for an arbitrary integer k≥n0. |
| Inductive step | Use that assumption to derive the exact statement P(k+1). |
| Conclusion | State that the base case and implication P(k)⇒P(k+1) prove P(n) for all integers n≥n0. |
| Required FP1 proof type | Productive k→k+1 move |
|---|---|
| sum of a series | Start with the assumed sum to k and add the term whose index is k+1. |
| divisibility by m | Rewrite f(k+1) as a multiple of the assumed divisible expression plus an explicit multiple of m. |
| general term of a recurrence | Substitute the assumed formula for uk into the recurrence; for a second-order recurrence use two base cases and assume formulas for two consecutive terms. |
| matrix power | If Ak=Mk, write Ak+1=AkA=MkA and simplify every entry to the stated matrix Mk+1. |
For example, let P(n) be r=1∑n(2r−1)=n2. Base case: for n=1, both sides equal 1. Assume P(k), so ∑r=1k(2r−1)=k2. Then r=1∑k+1(2r−1)=k2+(2(k+1)−1)=k2+2k+1=(k+1)2. This is exactly P(k+1). Since P(1) is true and P(k) implies P(k+1), the result holds for every positive integer n.
The induction hypothesis is a temporary assumption inside a conditional argument; it is not the conclusion being assumed. The base case starts the chain, and the inductive step guarantees there is no break after any established case.
Checking several numerical cases does not prove the general result. Do not assume P(k+1), and do not finish after obtaining an expression that merely resembles it: rewrite it into the exact target form. Match the number of base cases and consecutive hypotheses to the order of a recurrence, and include the final quantified conclusion.