📚 Mastering IAL Unit MA05 (WMA05) Topics | 精通国际A-Level数学单元MA05（WMA05）知识点
The June 2023 IAL Unit MA05 (often coded WMA05) examination paper tests core topics from the Further Pure Mathematics 1 syllabus. This revision guide walks you through eight essential knowledge areas, from complex numbers and matrices to induction and numerical methods, ensuring you have a firm grasp of every concept likely to be assessed.
2023年6月的国际A-Level MA05（通常编码为WMA05）试卷考查了FP1进阶纯数课程的核心主题。本复习指南将带你梳理复数、矩阵、归纳法和数值方法等八个关键知识领域，确保你牢牢掌握每一个可能被考查的概念。
1. Complex Numbers — Modulus and Argument | 复数——模与幅角
A complex number z = x + iy can be represented on an Argand diagram by the point (x, y). Its modulus |z| = √(x² + y²) gives the distance from the origin, and its argument arg(z) = θ is the angle measured anticlockwise from the positive real axis, usually taken in (−π, π].
复数 z = x + iy 可在阿甘德图上用点 (x, y) 表示。模 |z| = √(x² + y²) 是到原点的距离，幅角 arg(z) = θ 是从正实轴逆时针测量的角度，通常取值在 (−π, π] 范围内。
To convert into modulus-argument form, write z = r(cos θ + i sin θ), where r = |z| and θ = arg(z). Always check the quadrant of (x, y) when finding θ from tan θ = y/x.
转换成模−幅角形式时写作 z = r(cos θ + i sin θ)，其中 r = |z|，θ = arg(z)。由 tan θ = y/x 求幅角时，务必根据 (x, y) 所在象限确定正确的角度。
Multiplying two complex numbers: |z₁z₂| = |z₁| |z₂| and arg(z₁z₂) = arg(z₁) + arg(z₂). Division obeys analogous rules: |z₁/z₂| = |z₁|/|z₂|, arg(z₁/z₂) = arg(z₁) − arg(z₂).
两个复数的乘积：|z₁z₂| = |z₁| |z₂|，且 arg(z₁z₂) = arg(z₁) + arg(z₂)。除法遵循类似规则：|z₁/z₂| = |z₁|/|z₂|，arg(z₁/z₂) = arg(z₁) − arg(z₂)。
2. Roots of Polynomial Equations | 多项式方程的根
For a cubic equation ax³ + bx² + cx + d = 0 with roots α, β, γ, the relationships are: Σα = −b/a, Σαβ = c/a, and αβγ = −d/a. These symmetric functions of roots allow you to construct new equations without finding the individual roots.
对于三次方程 ax³ + bx² + cx + d = 0，其根 α, β, γ 满足：Σα = −b/a, Σαβ = c/a, αβγ = −d/a。利用这些根的对称式，无需解出各个根就可以构造新方程。
For a quartic ax⁴ + bx³ + cx² + dx + e = 0 with roots α, β, γ, δ, the sums of products extend to Σα = −b/a, Σαβ = c/a, Σαβγ = −d/a, αβγδ = e/a.
对于四次方程 ax⁴ + bx³ + cx² + dx + e = 0，其根 α, β, γ, δ 的乘积和推广为：Σα = −b/a, Σαβ = c/a, Σαβγ = −d/a, αβγδ = e/a。
When asked to find a polynomial whose roots are, say, 2α, 2β, 2γ, replace each symmetric sum accordingly using the known values from the original equation.
若题目要求根的变换（例如新根为 2α, 2β, 2γ），只需用原方程已知的对称和进行相应代换即可。
3. 2×2 Matrices — Determinant and Inverse | 2×2 矩阵——行列式与逆矩阵
For a matrix M = [a b; c d], the determinant is det(M) = ad − bc. The matrix is singular (non-invertible) if the determinant equals zero.
对于矩阵 M = [a b; c d]，行列式为 det(M) = ad − bc。若行列式为零，则矩阵是奇异的，不可逆。
The inverse, when det ≠ 0, is given by M⁻¹ = 1/(ad − bc) [d −b; −c a]. You must be able to use the inverse to solve a pair of simultaneous linear equations written in matrix form M·(x y)ᵀ = k.
当行列式不为零时，逆矩阵为 M⁻¹ = 1/(ad − bc) [d −b; −c a]。你必须掌握利用逆矩阵求解写作 M·(x y)ᵀ = k 形式的方程组的方法。
The matrix equation has solution (x y)ᵀ = M⁻¹ k, provided M is invertible. This approach is particularly testable when coefficients contain constants or parameters.
若 M 可逆，则矩阵方程的解为 (x y)ᵀ = M⁻¹ k。当系数含有常数或参数时，该方法尤其容易出现在考题中。
4. Summation of Series | 级数求和
Standard results to memorise: Σ₁ⁿ r = n(n+1)/2, Σ₁ⁿ r² = n(n+1)(2n+1)/6, Σ₁ⁿ r³ = n²(n+1)²/4.
必须熟记的标准公式：Σ₁ⁿ r = n(n+1)/2，Σ₁ⁿ r² = n(n+1)(2n+1)/6，Σ₁ⁿ r³ = n²(n+1)²/4。
To sum a series such as Σ (r+1)(r+3), expand to r² + 4r + 3 and apply the standard sums term by term, factoring out n(n+1) where possible to simplify.
对 Σ (r+1)(r+3) 这样的级数求和时，先展开为 r² + 4r + 3，再逐项应用标准结果，尽可能提取公因式 n(n+1) 进行化简。
Many exam questions combine algebraic manipulation with proving a formula, then ask you to find the sum to infinity or a particular partial sum.
许多考题要求先通过代数操作证明某个求和公式，然后再求无穷和或特定部分和。
5. Proof by Mathematical Induction | 数学归纳法证明
Induction consists of three stages: basis step (verify for n = 1 or smallest value), induction hypothesis (assume true for n = k), and induction step (prove true for n = k+1 using the assumption).
归纳法包含三个阶段：奠基步骤（验证 n = 1 或最小取值成立）、归纳假设（假设 n = k 时命题为真）、归纳步骤（利用假设证明 n = k+1 时成立）。
Typical applications include proving divisibility (e.g., 5ⁿ − 1 is divisible by 4), summation formulae (e.g., Σ r = n(n+1)/2), and matrix powers (e.g., Mⁿ has a certain form).
典型应用包括证明整除性（如 5ⁿ − 1 可被 4 整除）、求和公式（如 Σ r = n(n+1)/2）以及矩阵的幂（如 Mⁿ 具有特定形式）。
Always write a clear conclusion: ‘Thus the statement is true for n = k+1 and, by induction, true for all positive integers n.’
必须写明结论：“因此命题对 n = k+1 成立，根据归纳法，对所有正整数 n 成立。”
6. Newton-Raphson Method | 牛顿-拉弗森迭代
To approximate a root of f(x) = 0, the Newton-Raphson formula is xₙ₊₁ = xₙ − f(xₙ)/f'(xₙ). The method requires the derivative f'(x) and a suitable initial guess x₀ close to the root.
对于方程 f(x) = 0，牛顿-拉弗森迭代公式为 xₙ₊₁ = xₙ − f(xₙ)/f'(xₙ)。使用该方法需要求导 f'(x) 并选取一个靠近根的合适初值 x₀。
The iteration converges quadratically provided f'(xₙ) ≠ 0 and x₀ is sufficiently near the root. You may be asked to perform two or three iterations and comment on convergence patterns.
只要 f'(xₙ) ≠ 0 且初值足够靠近根，该迭代就会以二次速度收敛。题目可能要求你完成两到三次迭代，并分析收敛模式。
Be prepared to rearrange an equation into the form f(x) = 0 and then apply the formula, showing all decimal places as requested.
你要学会将方程整理成 f(x) = 0 的形式，再代入公式，并按题目要求显示所有小数位数。
7. Matrix Transformations in the Plane | 平面内的矩阵变换
A 2×2 matrix M acts on position vectors to produce geometric transformations. Common transformation matrices to know: rotation by θ [cos θ −sin θ; sin θ cos θ], reflection in lines y = mx, and stretches parallel to axes.
2×2 矩阵 M 作用于位置矢量，可产生几何变换。务必熟记的常见变换矩阵有：旋转 θ 角的矩阵 [cos θ −sin θ; sin θ cos θ]、关于直线 y = mx 的反射、以及平行于坐标轴的伸缩变换。
The determinant indicates the area scale factor of the transformation. det(M) < 0 signifies a reflection is involved; |det(M)| gives the factor by which area is multiplied.
行列式代表变换的面积比例因子。det(M) < 0 表示变换包含反射；|det(M)| 给出面积放缩的倍数。
You must be able to identify a transformation from its matrix, find invariant lines, and determine the image of a given shape under the transformation.
你必须能从矩阵识别出变换类型、求不变直线、以及计算给定图形在变换下的像。
8. De Moivre’s Theorem and Roots of Unity | 棣莫弗定理与单位根
De Moivre’s theorem states that (cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ) for any integer n. This is fundamental for raising complex numbers to powers and for extracting roots.
棣莫弗定理指出，对任意整数 n，有 (cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ)。它是复数求幂和开方的重要基础。
The nᵗʰ roots of unity are solutions to zⁿ = 1, given by z = cos(2kπ/n) + i sin(2kπ/n) for k = 0, 1, …, n−1. These roots lie equally spaced on the unit circle.
单位 n 次根是方程 zⁿ = 1 的解，形式为 z = cos(2kπ/n) + i sin(2kπ/n)，其中 k = 0, 1, …, n−1。这些根均匀分布在单位圆上。
Similarly, the nᵗʰ roots of any complex number w = r(cos θ + i sin θ) are √ⁿr [cos((θ+2kπ)/n) + i sin((θ+2kπ)/n)]. Be careful to work in radians unless told otherwise.
类似地，任意复数 w = r(cos θ + i sin θ) 的 n 次根为 √ⁿr [cos((θ+2kπ)/n) + i sin((θ+2kπ)/n)]。除非题目另有说明，通常使用弧度制。
Published by TutorHao | Further Pure Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导