📚 AS Further Mathematics Unit 2 (Jan 2020) Key Concepts | AS 进阶数学单元2 2020年1月试卷知识点精讲
This article revisits the essential topics examined in the January 2020 AS Further Mathematics Unit 2 paper. By breaking down each concept with worked examples, theoretical insights, and bilingual explanations, students can consolidate their understanding of complex numbers, matrices, series, polar coordinates, differential equations, and proof by induction. Whether you are preparing for a resit or using this as a supplementary revision resource, the following sections will guide you through every major specification point.
本文重温2020年1月AS进阶数学单元2试卷中考查的核心知识点。通过分解每个概念，辅以示例、理论要点和双语解释，学生可以巩固对复数、矩阵、级数、极坐标、微分方程以及归纳法证明的理解。无论你是准备补考，还是将本文作为补充复习资料，以下各部分将引导你掌握每一个主要考纲要点。
1. Complex Numbers: Arithmetic and Roots | 复数：运算与根
Complex numbers are numbers of the form a + bi, where a and b are real numbers and i² = −1. Addition and subtraction are performed by handling real and imaginary parts separately. For example, (3 + 2i) + (1 − 4i) = 4 − 2i. Multiplication uses the distributive property and the fact that i² = −1; thus (2 + i)(3 − 2i) = 6 − 4i + 3i − 2i² = 8 − i. Division requires multiplying numerator and denominator by the complex conjugate of the denominator to produce a real denominator.
复数是形如 a + bi 的数，其中 a 和 b 为实数，且 i² = −1。加法和减法分别处理实部和虚部。例如，(3 + 2i) + (1 − 4i) = 4 − 2i。乘法利用分配律及 i² = −1；因此 (2 + i)(3 − 2i) = 6 − 4i + 3i − 2i² = 8 − i。除法需将分子分母同乘以分母的共轭复数，使得分母化为实数。
Finding square roots of a complex number is a typical exam problem. To solve (x + yi)² = a + bi, expand and equate real and imaginary parts: x² − y² = a and 2xy = b. Solve the system simultaneously, often by substituting y = b/(2x) into the first equation and solving the resulting quadratic in x².
求复数的平方根是典型的考题。为解 (x + yi)² = a + bi，展开并令实部与虚部分别相等：x² − y² = a，2xy = b。联立求解，通常将 y = b/(2x) 代入第一个方程，再解关于 x² 的二次方程。
Cubic and quartic equations with real coefficients may have complex roots that occur in conjugate pairs. If one complex root is known, its conjugate is also a root, allowing factorization.
实系数三次和四次方程可能有成对出现的共轭复根。若已知一个复根，其共轭也是根，从而可进行因式分解。
2. Argand Diagrams and Modulus-Argument Form | 阿尔冈图与模-辐角形式
An Argand diagram represents complex numbers as points or vectors on a plane with the x-axis as the real part and the y-axis as the imaginary part. The modulus of z = x + yi is |z| = √(x² + y²), giving the distance from the origin. The argument, arg(z), is the angle θ measured from the positive real axis, typically in the range (−π, π] or [0, 2π). It satisfies tan θ = y/x, with the quadrant determined by the signs of x and y.
阿尔冈图将复数表示为平面上的点或向量，以 x 轴为实部，y 轴为虚部。复数 z = x + yi 的模为 |z| = √(x² + y²)，即到原点的距离。辐角 arg(z) 是从正实轴量起的角度 θ，通常取值范围为 (−π, π] 或 [0, 2π)。满足 tan θ = y/x，象限由 x 和 y 的符号决定。
The modulus-argument form is written as z = r(cos θ + i sin θ) or, using Euler’s relation, z = r e^(iθ). This form is powerful for multiplication, division, and exponentiation. Multiplication: r₁ e^(iθ₁) × r₂ e^(iθ₂) = r₁r₂ e^(i(θ₁+θ₂)). Division: r₁/r₂ e^(i(θ₁−θ₂)).
模-辐角形式写作 z = r(cos θ + i sin θ) 或使用欧拉关系表示为 z = r e^(iθ)。这种形式在乘法、除法和乘方中极为有效。乘法：r₁ e^(iθ₁) × r₂ e^(iθ₂) = r₁r₂ e^(i(θ₁+θ₂))。除法：r₁/r₂ e^(i(θ₁−θ₂))。
Loci on an Argand diagram can be lines or circles. For example, |z − a| = r represents a circle with centre a and radius r. |z − a| = |z − b| is the perpendicular bisector of the line segment joining a and b. arg(z − a) = θ defines a half-line.
阿尔冈图上的轨迹可以是直线或圆。例如，|z − a| = r 表示以 a 为圆心、r 为半径的圆。|z − a| = |z − b| 表示连接 a 与 b 线段的垂直平分线。arg(z − a) = θ 定义了一条射线。
3. De Moivre’s Theorem and Applications | 棣莫弗定理及其应用
De Moivre’s theorem states that for any integer n, (cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ). This can be proved by induction for positive integers and extended to negative integers using the reciprocal property. The theorem is essential for deriving trigonometric multiple-angle identities.
棣莫弗定理指出，对于任意整数 n，(cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ)。该定理可通过归纳法对正整数进行证明，并利用倒数性质推广到负整数。该定理是推导三角函数倍角恒等式的基础。
To express cos nθ or sin nθ in terms of powers of cos θ and sin θ, expand (cos θ + i sin θ)ⁿ using the binomial theorem, then equate real and imaginary parts. For example, to find cos 3θ: (cos θ + i sin θ)³ = cos³θ + 3i cos²θ sin θ − 3 cos θ sin²θ − i sin³θ, so cos 3θ = cos³θ − 3 cos θ sin²θ, which simplifies to 4 cos³θ − 3 cos θ.
要将 cos nθ 或 sin nθ 表示为 cos θ 和 sin θ 的幂次形式，可用二项式定理展开 (cos θ + i sin θ)ⁿ，然后使实部和虚部分别相等。例如，求 cos 3θ：(cos θ + i sin θ)³ = cos³θ + 3i cos²θ sin θ − 3 cos θ sin²θ − i sin³θ，故 cos 3θ = cos³θ − 3 cos θ sin²θ，可化简为 4 cos³θ − 3 cos θ。
Conversely, to express powers of sin θ or cos θ as sums of multiple angles, use the reverse process. Write z = cos θ + i sin θ, then zⁿ = cos nθ + i sin nθ, and z⁻ⁿ = cos nθ − i sin nθ. Thus cosⁿθ can be expanded using ((z + z⁻¹)/2)ⁿ, and sinⁿθ using ((z − z⁻¹)/(2i))ⁿ.
反之，将 sin θ 或 cos θ 的幂次表示为多倍角之和，需使用逆过程。令 z = cos θ + i sin θ，则 zⁿ = cos nθ + i sin nθ，且 z⁻ⁿ = cos nθ − i sin nθ。因此 cosⁿθ 可利用 ((z + z⁻¹)/2)ⁿ 展开，sinⁿθ 利用 ((z − z⁻¹)/(2i))ⁿ 展开。
De Moivre’s theorem is also used to find nth roots of unity. The equation zⁿ = 1 has solutions zₖ = e^(2πik/n) = cos(2πk/n) + i sin(2πk/n) for k = 0, 1, 2, …, n−1. These roots lie evenly spaced on the unit circle.
棣莫弗定理也用于求 n 次单位根。方程 zⁿ = 1 的解为 zₖ = e^(2πik/n) = cos(2πk/n) + i sin(2πk/n)，其中 k = 0, 1, 2, …, n−1。这些根均匀分布在单位圆上。
4. Series and Summation of Series | 级数与级数求和
The AS Further Maths Unit 2 paper often requires manipulating finite series and using standard summation formulas. The standard results are:
- Σ(r=1 to n) 1 = n
- Σ(r=1 to n) r = ½ n(n+1)
- Σ(r=1 to n) r² = ⅙ n(n+1)(2n+1)
- Σ(r=1 to n) r³ = ¼ n²(n+1)²
AS 进阶数学单元2试卷常要求处理有限级数并运用标准求和公式。标准结果如下：
- Σ(r=1 to n) 1 = n
- Σ(r=1 to n) r = ½ n(n+1)
- Σ(r=1 to n) r² = ⅙ n(n+1)(2n+1)
- Σ(r=1 to n) r³ = ¼ n²(n+1)²
These can be combined linearly to sum polynomial expressions. For instance, Σ(r=1 to n) (3r² − 2r + 1) = 3 Σr² − 2 Σr + Σ1 = 3[⅙ n(n+1)(2n+1)] − 2[½ n(n+1)] + n = ½ n(n+1)(2n+1) − n(n+1) + n, which simplifies to n(2n² + 3n + 1)/2 − n² − n + n = n³ + ½ n² + ½ n. Always factor and simplify fully.
这些公式可线性组合以对多项式表达式求和。例如，Σ(r=1 to n) (3r² − 2r + 1) = 3 Σr² − 2 Σr + Σ1 = 3[⅙ n(n+1)(2n+1)] − 2[½ n(n+1)] + n = ½ n(n+1)(2n+1) − n(n+1) + n，化简得 n³ + ½ n² + ½ n。务必完全分解并化简。
Another common task is finding the nth term of a series from the sum formula. Given Sₙ = Σ(r=1 to n) uᵣ, then uₙ = Sₙ − Sₙ₋₁. This is useful when a series expression is defined by a formula for its partial sums.
另一常见任务是已知求和公式求级数的第 n 项。给定 Sₙ = Σ(r=1 to n) uᵣ，则 uₙ = Sₙ − Sₙ₋₁。当级数表达式由其部分和公式定义时，该方法非常有用。
Method of differences allows telescoping sums. If the general term can be expressed as f(r) − f(r+1) or f(r) − f(r−1), many terms cancel and the sum simplifies to f(1) − f(n+1). Questions often require splitting rational expressions into partial fractions first.
差分法可实现裂项相消。若通项可表为 f(r) − f(r+1) 或 f(r) − f(r−1) 的形式，则大量项相消，和化简为 f(1) − f(n+1)。题目经常要求先将有理式分解为部分分式。
5. Matrices: Operations and Determinants | 矩阵：运算与行列式
A matrix is a rectangular array of numbers. Addition and subtraction are done element-wise only when matrices have the same dimensions. Scalar multiplication multiplies every element by that constant. Matrix multiplication AB is defined if the number of columns of A equals the number of rows of B. The product is not commutative in general (AB ≠ BA).
矩阵是数的矩形阵列。只有维度相同的矩阵才能进行逐元素加减。标量乘法将常数乘以每个元素。矩阵乘法 AB 在 A 的列数等于 B 的行数时有定义。通常乘积不可交换（AB ≠ BA）。
The determinant of a 2×2 matrix M = [[a, b], [c, d]] is det(M) = ad − bc. For a 3×3 matrix, the determinant can be computed by expansion along any row or column, using cofactors. The determinant determines whether a matrix is singular (det = 0) or non-singular (det ≠ 0). A non-singular matrix has an inverse.
2×2 矩阵 M = [[a, b], [c, d]] 的行列式为 det(M) = ad − bc。对于 3×3 矩阵，可通过沿任意行或列展开并使用余子式来计算行列式。行列式决定矩阵是奇异的（det = 0）还是非奇异的（det ≠ 0）。非奇异矩阵存在逆矩阵。
Properties of determinants: det(AB) = det(A) det(B); det(Aᵀ) = det(A); det(kA) = kⁿ det(A) for n×n matrix; det(A⁻¹) = 1/det(A). Swapping two rows changes the sign of the determinant. Row operations that add a multiple of one row to another leave the determinant unchanged.
行列式的性质：det(AB) = det(A) det(B)；det(Aᵀ) = det(A)；对于 n×n 矩阵，det(kA) = kⁿ det(A)；det(A⁻¹) = 1/det(A)。交换两行改变行列式的符号。将一行倍数加到另一行的行变换不改变行列式。
6. Matrix Inverses and Solving Linear Equations | 矩阵的逆与解线性方程组
The inverse of a 2×2 matrix A = [[a, b], [c, d]] is A⁻¹ = 1/(ad−bc) [[d, −b], [−c, a]], provided det(A) ≠ 0. For a 3×3 matrix, the inverse can be found by forming the matrix of cofactors, transposing it to get the adjugate, and then multiplying by 1/det(A). A system of linear equations can be written in matrix form Ax = b. If A is square and non-singular, the unique solution is x = A⁻¹b.
2×2 矩阵 A = [[a, b], [c, d]] 的逆矩阵为 A⁻¹ = 1/(ad−bc) [[d, −b], [−c, a]]，前提是 det(A) ≠ 0。对于 3×3 矩阵，可通过构造余子式矩阵、转置得伴随矩阵，再乘以 1/det(A) 求得逆。线性方程组可写成矩阵形式 Ax = b。若 A 为方阵且非奇异，则唯一解为 x = A⁻¹b。
When det(A) = 0, the system either has no solutions or infinitely many solutions. In a geometrical context, this corresponds to parallel planes or lines with no intersection, or coincident planes. Exam questions may require interpreting the consistency of equations without fully solving them.
当 det(A) = 0 时，方程组或无解，或有无穷多解。在几何背景下，这对应于无交点的平行平面或直线，或重合的平面。考题可能要求在不完全求解的情况下解读方程组的相容性。
Matrix inversion is also used to find transformation matrices that reverse a given linear transformation. For example, if a transformation T is represented by matrix M, then T⁻¹ is represented by M⁻¹.
矩阵求逆也用于寻找逆变换矩阵。例如，若变换 T 由矩阵 M 表示，则 T⁻¹ 由 M⁻¹ 表示。
7. Further Matrix Transformations | 进一步的矩阵变换
Matrices represent linear transformations in the plane or in 3D space. Common 2×2 transformations include rotations, reflections, stretches, and shears. A rotation by angle θ counter‑clockwise is [[cos θ, −sin θ], [sin θ, cos θ]]. A reflection in the line y = x is [[0, 1], [1, 0]]. A stretch parallel to the x-axis with scale factor k is [[k, 0], [0, 1]].
矩阵表示平面或三维空间中的线性变换。常见的 2×2 变换包括旋转、反射、拉伸和剪切。逆时针旋转 θ 角为 [[cos θ, −sin θ], [sin θ, cos θ]]。关于直线 y = x 的反射为 [[0, 1], [1, 0]]。平行于 x 轴且缩放因子为 k 的拉伸为 [[k, 0], [0, 1]]。
Successive transformations correspond to matrix multiplication from right to left. If transformation A is followed by transformation B, the combined transformation matrix is BA. The order matters.
相继的变换对应于从右向左的矩阵乘法。若变换 A 后接变换 B，则合并的变换矩阵为 BA。顺序至关重要。
Invariant points and invariant lines can be found by solving Mx = x or Mx = λx. Invariant points satisfy (M − I)x = 0. Invariant lines are lines mapped onto themselves, possibly with points moving along the line, so direction vectors are eigenvectors. This connects to eigenvalues and eigenvectors, although the full eigen theory may appear in A2 Further Maths.
不变点和不变直线可通过解 Mx = x 或 Mx = λx 求出。不变点满足 (M − I)x = 0。不变直线是映射到自身的直线，线上的点可能沿直线移动，因此方向向量为特征向量。这关联到特征值与特征向量，尽管完整的特征理论可能出现在 A2 进阶数学中。
8. Polar Coordinates | 极坐标
Polar coordinates define a point by (r, θ), where r is the distance from the origin and θ is the angle from the positive x‑axis. Conversion formulas: x = r cos θ, y = r sin θ, and r = √(x² + y²), θ = arctan(y/x) considering quadrant.
极坐标用 (r, θ) 定义一个点，其中 r 为到原点的距离，θ 为从正 x 轴量起的角度。转换公式：x = r cos θ，y = r sin θ，且 r = √(x² + y²)，θ = arctan(y/x) 需考虑象限。
Curves are often given as r = f(θ). To sketch, plot key values of θ and note symmetry. The area enclosed by a polar curve r = f(θ) from θ = α to θ = β is A = ½ ∫(α to β) r² dθ. This formula is essential and frequently tested.
曲线常以 r = f(θ) 的形式给出。要画草图，可标出关键 θ 值并注意对称性。极坐标曲线 r = f(θ) 从 θ = α 到 θ = β 所围面积为 A = ½ ∫(α to β) r² dθ。该公式至关重要且常考。
Finding tangents at a point: use the gradient dy/dx = (dy/dθ) / (dx/dθ), with x = r cos θ, y = r sin θ. Tangents parallel to the initial line occur where dy/dθ = 0; perpendicular to the initial line where dx/dθ = 0. The pole (origin) itself may have tangents given by solving r = 0.
求某点处的切线：利用斜率 dy/dx = (dy/dθ) / (dx/dθ)，其中 x = r cos θ，y = r sin θ。平行于极轴的切线出现在 dy/dθ = 0 处；垂直于极轴的切线出现在 dx/dθ = 0 处。极点（原点）处的切线可通过解 r = 0 得到。
9. Differential Equations | 微分方程
First-order differential equations in Unit 2 can be solved by separating variables. If dy/dx = g(x) h(y), then ∫ 1/h(y) dy = ∫ g(x) dx. After integration, add the constant of integration and rearrange to an explicit or implicit form.
单元2中的一阶微分方程可通过分离变量法求解。若 dy/dx = g(x) h(y)，则 ∫ 1/h(y) dy = ∫ g(x) dx。积分后加上积分常数，并按要求整理为显式或隐式。
Contextual problems involve exponential growth/decay and Newton’s law of cooling. The model dP/dt = kP gives P = P₀ e^(kt). If a cooling rate follows dT/dt = −k(T − Tₐ), the solution is T = Tₐ + (T₀ − Tₐ) e^(−kt).
文字背景题涉及指数增长/衰减以及牛顿冷却定律。模型 dP/dt = kP 的解为 P = P₀ e^(kt)。若冷却速率遵循 dT/dt = −k(T − Tₐ)，则解为 T = Tₐ + (T₀ − Tₐ) e^(−kt)。
Second-order homogeneous linear differential equations with constant coefficients, of the form a d²y/dx² + b dy/dx + c y = 0, are also examined. The auxiliary equation is a m² + b m + c = 0. Real distinct roots m₁, m₂ give y = A e^(m₁x) + B e^(m₂x); repeated root m gives y = (A + Bx) e^(mx); complex roots α ± iβ give y = e^(αx) (A cos βx + B sin βx).
常系数二阶齐次线性微分方程 a d²y/dx² + b dy/dx + c y = 0 也在考查范围内。辅助方程为 a m² + b m + c = 0。相异实根 m₁、m₂ 给出 y = A e^(m₁x) + B e^(m₂x)；重根 m 给出 y = (A + Bx) e^(mx)；复根 α ± iβ 给出 y = e^(αx) (A cos βx + B sin βx)。
Boundary conditions or initial conditions are used to find the unknown constants A and B. Always check that the final solution satisfies the given conditions.
利用边界条件或初始条件可求出未知常数 A 和 B。始终要检验最终解是否满足给定条件。
10. Proof by Induction | 归纳法证明
Proof by induction is a formal method for proving that a statement P(n) is true for all positive integers n. The structure consists of three steps: (1) Base case: verify P(1) or the starting value is true. (2) Inductive hypothesis: assume P(k) is true for some arbitrary integer k ≥ 1. (3) Inductive step: show that P(k+1) follows from P(k). The conclusion then affirms the statement for all n ≥ 1 by the principle of mathematical induction.
归纳法证明是一种形式化方法，用于证明命题 P(n) 对所有正整数 n 成立。结构包含三步：(1) 基础情形：验证 P(1) 或起始值为真。(2) 归纳假设：假设对某任意整数 k ≥ 1，P(k) 成立。(3) 归纳递推：证明由 P(k) 可推出 P(k+1)。因此根据数学归纳原理，命题对所有 n ≥ 1 成立。
Common induction questions include proving summation formulas, divisibility statements, matrix powers, and recurrence relations. For example, to prove Σ(r=1 to n) r² = ⅙ n(n+1)(2n+1), assume the formula holds for n = k, then show that adding (k+1)² yields the same expression with n = k+1.
常见的归纳法题目包括证明求和公式、整除性命题、矩阵的幂以及递推关系。例如，为了证明 Σ(r=1 to n) r² = ⅙ n(n+1)(2n+1)，假设公式对 n = k 成立，然后证明加上 (k+1)² 后得到 n = k+1 时的表达式。
For matrix powers Mⁿ, express Mᵏ⁺¹ = M Mᵏ and substitute the assumed form for Mᵏ. For divisibility, rewrite f(k+1) as an expression involving f(k) and a multiple of the divisor. Careful algebraic manipulation is crucial.
对于矩阵的幂 Mⁿ，可写出 Mᵏ⁺¹ = M Mᵏ 并代入假设的 Mᵏ 形式。对于整除性，将 f(k+1) 改写为包含 f(k) 与除数倍数的表达式。细致的代数操作至关重要。
Another variant is proving inequalities by induction, e.g., 2ⁿ > n² for n ≥ 5. The inductive step often requires using the hypothesis and then applying additional algebraic inequalities to reach the desired result.
另一变体是用归纳法证明不等式，例如对 n ≥ 5 证明 2ⁿ > n²。归纳递推通常需要利用假设，再运用额外的代数不等式以得到所需结果。
Published by TutorHao | AS Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导