📚 MEA AS Further Mathematics Key Concepts | MEA AS 进阶数学知识点精讲
AS Further Mathematics deepens your understanding of pure mathematics, mechanics, statistics, and introduces entirely new areas such as complex numbers, matrices, and proof by induction. This article distils the essential MEA AS Further Mathematics syllabus into key revision points, with clear explanations and worked examples in both English and Chinese. Each section is designed to reinforce your conceptual grasp and prepare you for examination-style questions.
AS进阶数学深化你对纯数学、力学、统计的理解，并引入了复数、矩阵和归纳法证明等全新领域。本文将MEA AS进阶数学大纲浓缩为关键复习要点，提供中英双语的清晰讲解和示例。每一节都旨在巩固你的概念掌握，并帮助你应对考试题型。
1. Complex Numbers | 复数
A complex number is an extension of the real numbers and can be written in Cartesian form as z = a + bi, where a and b are real numbers and i is the imaginary unit satisfying i² = -1. The real part is Re(z) = a, and the imaginary part is Im(z) = b. Two complex numbers are equal if and only if their real and imaginary parts are equal.
复数是实数的扩展，可写成笛卡尔形式 z = a + bi，其中a和b为实数，i为虚数单位满足 i² = -1。实部 Re(z) = a，虚部 Im(z) = b。两个复数相等当且仅当它们的实部和虚部分别相等。
The complex conjugate of z = a + bi is denoted as z* = a – bi. The modulus of z is |z| = √(a² + b²), representing the distance from the origin in the Argand diagram. The argument, arg(z), is the angle θ measured from the positive real axis, typically given in the range -π < θ ≤ π.
z = a + bi 的共轭复数记为 z* = a – bi。z的模为 |z| = √(a² + b²)，表示在阿干特图上到原点的距离。辐角 arg(z) 是从正实轴量起的角度θ，通常取值范围为 -π < θ ≤ π。
Addition and subtraction are performed component-wise: (a+bi) ± (c+di) = (a±c) + (b±d)i. Multiplication uses the distributive law and i² = -1: (a+bi)(c+di) = (ac – bd) + (ad+bc)i. Division is simplified by multiplying numerator and denominator by the conjugate of the denominator.
加减法按分量进行：(a+bi) ± (c+di) = (a±c) + (b±d)i。乘法利用分配律和 i² = -1：(a+bi)(c+di) = (ac – bd) + (ad+bc)i。除法通过分子分母同乘分母的共轭来化简。
e.g. (3 + 2i)/(1 – i) = ((3+2i)(1+i))/((1-i)(1+i)) = (1 + 5i)/2 = 0.5 + 2.5i
Solving quadratic equations with negative discriminant yields complex conjugate roots. For example, x² – 4x + 13 = 0 gives x = 2 ± 3i. These roots can be verified using the sum and product of roots.
解具有负判别式的二次方程会得到共轭复根。例如，x² – 4x + 13 = 0 的解为 x = 2 ± 3i。这些根可利用根的和与积来验证。
2. Roots of Polynomials | 多项式根
For a cubic equation ax³ + bx² + cx + d = 0 with roots α, β, γ, the relationships between coefficients and roots are: α+β+γ = -b/a, αβ+βγ+γα = c/a, αβγ = -d/a. For a quartic with roots α, β, γ, δ, the sum of roots is -b/a, the sum of products of pairs is c/a, the sum of products of triples is -d/a, and the product of all four is e/a.
对于三次方程 ax³ + bx² + cx + d = 0，根为 α, β, γ，根与系数的关系为：α+β+γ = -b/a，αβ+βγ+γα = c/a，αβγ = -d/a。对于四次方程，根为 α, β, γ, δ，根之和为 -b/a，两两积之和为 c/a，三三积之和为 -d/a，四根之积为 e/a。
These relations can be used to find symmetric functions such as α²+β²+γ² = (α+β+γ)² – 2(αβ+βγ+γα) and α²β+α²γ+β²α+β²γ+γ²α+γ²β = (α+β+γ)(αβ+βγ+γα) – 3αβγ. When a new root is expressed in terms of the original roots, substitution or transformation techniques can construct the new polynomial.
这些关系可用于求对称函数，如 α²+β²+γ² = (α+β+γ)² – 2(αβ+βγ+γα) 和 α²β+α²γ+β²α+β²γ+γ²α+γ²β = (α+β+γ)(αβ+βγ+γα) – 3αβγ。当新根用原根表示时，可通过代换或变换技巧构造新的多项式。
Given that roots of x³ + px² + qx + r = 0 are α, β, γ, find an equation whose roots are α², β², γ². Let y = x², then x = √y or x = -√y; using transformations requires careful handling, often using the sum and product of squared roots: α²+β²+γ² = (α+β+γ)² – 2(αβ+βγ+γα), α²β²+β²γ²+γ²α² = (αβ+βγ+γα)² – 2αβγ(α+β+γ), (αβγ)² = r². Substitute known values.
已知 x³ + px² + qx + r = 0 的根为 α, β, γ，求以 α², β², γ² 为根的方程。令 y = x²，则需谨慎处理变换，通常利用平方根的和与积：α²+β²+γ² = (α+β+γ)² – 2(αβ+βγ+γα)，α²β²+β²γ²+γ²α² = (αβ+βγ+γα)² – 2αβγ(α+β+γ)，(αβγ)² = r²。代入已知值即可。
3. Matrices and Transformations | 矩阵与变换
A 2×2 matrix M acts on a position vector to produce a linear transformation. The identity matrix I = [1 0; 0 1] leaves points unchanged. Reflection, rotation, enlargement, and shear can all be represented by matrices. The determinant det(M) = ad – bc gives the area scale factor of the transformation; if det(M) = 0, the transformation collapses the plane onto a line or point and the matrix is singular (non-invertible).
2×2 矩阵 M 作用于位置向量产生线性变换。单位矩阵 I = [1 0; 0 1] 保持点不变。反射、旋转、缩放和剪切均可用矩阵表示。行列式 det(M) = ad – bc 给出变换的面积比例因子；若 det(M) = 0，变换将平面压缩到一条直线或点，矩阵是奇异的（不可逆）。
| a | b |
| c | d |
The inverse of a non-singular matrix M is (1/det(M)) [d -b; -c a]. Solving a system of simultaneous equations can be done by writing it as Mx = k and multiplying by M⁻¹ if it exists. Matrix multiplication corresponds to combining transformations: applying A then B is equivalent to the matrix BA (note the order).
非奇异矩阵 M 的逆为 (1/det(M)) [d -b; -c a]。求解联立方程组可写成矩阵形式 Mx = k，若逆存在，两边乘 M⁻¹ 即得解。矩阵乘法对应变换的复合：先应用 A 再应用 B 等价于矩阵 BA（注意顺序）。
Invariant lines and invariant points are key concepts: an invariant point satisfies Mx = x; an invariant line is a set of points that map to points on the same line. To find invariant lines, solve the eigenvector equation, or set y = mx and image point satisfies y’ = mx’ with same gradient.
不变线和不变点是核心概念：不变点满足 Mx = x；不变线是映射到该直线上的点集。求不变线可解特征向量方程，或设 y = mx，且像点满足 y’ = mx’，梯度相同。
4. Proof by Induction | 归纳法证明
Mathematical induction is used to prove statements that hold for all positive integers. The method consists of three steps: base case (verify for n = 1), inductive hypothesis (assume true for n = k), and inductive step (prove true for n = k+1 using the hypothesis). The conclusion then states that the statement is true for all integers n ≥ 1 by induction.
数学归纳法用于证明对所有正整数成立的命题。方法包括三个步骤：基础情况（验证 n = 1）、归纳假设（假设 n = k 时成立）和归纳步骤（利用假设证明 n = k+1 时成立）。最后得出所有整数 n ≥ 1 均成立的结论。
A typical example is proving the sum of the first n natural numbers: 1+2+…+n = ½ n(n+1). Base n=1: LHS=1, RHS=½(1)(2)=1, true. Assume ∑₁ᵏ i = ½ k(k+1). Then for n=k+1, LHS = ∑₁ᵏ i + (k+1) = ½ k(k+1) + (k+1) = ½ (k+1)(k+2), which matches the formula for n=k+1. So true for all n.
一个典型例子是证明前 n 个自然数之和：1+2+…+n = ½ n(n+1)。基础 n=1：LHS=1，RHS=½(1)(2)=1，成立。假设 ∑₁ᵏ i = ½ k(k+1)。则 n=k+1 时，LHS = ∑₁ᵏ i + (k+1) = ½ k(k+1) + (k+1) = ½ (k+1)(k+2)，与 n=k+1 时的公式相符。因此对所有 n 成立。
Induction can also be used for divisibility: e.g., prove 3²ⁿ – 1 is divisible by 8 for all n∈ℕ. Base n=1: 3² – 1 = 8, divisible. Assume 3²ᵏ – 1 = 8m; then 3²⁽ᵏ⁺¹⁾ – 1 = 9·3²ᵏ – 1 = 9(8m+1) – 1 = 72m + 8 = 8(9m+1), so divisible by 8. This step crucially factors out the hypothesis.
归纳法也可用于整除性证明：例如，证明对任意自然数 n，3²ⁿ – 1 能被 8 整除。基础 n=1：3² – 1 = 8，可整除。假设 3²ᵏ – 1 = 8m；则 3²⁽ᵏ⁺¹⁾ – 1 = 9·3²ᵏ – 1 = 9(8m+1) – 1 = 72m + 8 = 8(9m+1)，故能被 8 整除。此步骤关键在于分解出归纳假设。
5. Sequences and Series | 数列与级数
Beyond simple arithmetic and geometric progressions, AS Further Mathematics explores the method of differences and Maclaurin series. The method of differences involves expressing the n-th term as f(n) – f(n+1) or similar, so that telescoping cancellation gives a simple closed form for the sum.
除了简单的等差和等比数列，AS进阶数学探讨差分法和麦克劳林级数。差分法将第 n 项表示为 f(n) – f(n+1) 等形式，使其在求和时产生裂项相消，从而得到简洁的封闭形式。
For example, to find ∑₁ⁿ 1/(r(r+1)), write 1/(r(r+1)) = 1/r – 1/(r+1). The sum telescopes: (1 – 1/2) + (1/2 – 1/3) + … + (1/n – 1/(n+1)) = 1 – 1/(n+1). This technique is powerful for rational functions.
例如，求 ∑₁ⁿ 1/(r(r+1))，可写成 1/(r(r+1)) = 1/r – 1/(r+1)。求和时裂项：(1 – 1/2) + (1/2 – 1/3) + … + (1/n – 1/(n+1)) = 1 – 1/(n+1)。该技巧对有理函数非常有效。
The Maclaurin series expansion expresses a function f(x) as an infinite polynomial: f(x) = f(0) + f'(0)x + f”(0)x²/2! + f”'(0)x³/3! + … . Standard series include eˣ = 1 + x + x²/2! + x³/3! + … ; sin x = x – x³/3! + x⁵/5! – … ; cos x = 1 – x²/2! + x⁴/4! – … ; and ln(1+x) = x – x²/2 + x³/3 – … for |x| < 1.
麦克劳林级数将函数 f(x) 展开为无穷多项式：f(x) = f(0) + f'(0)x + f”(0)x²/2! + f”'(0)x³/3! + … 。标准展开式包括 eˣ = 1 + x + x²/2! + x³/3! + … ；sin x = x – x³/3! + x⁵/5! – … ；cos x = 1 – x²/2! + x⁴/4! – … ；以及 ln(1+x) = x – x²/2 + x³/3 – …，其中 |x| < 1。
These series can be used to find approximations and limits. For example, limit of (eˣ – 1 – x)/x² as x→0 is 1/2 by expanding eˣ up to x².
这些级数可用于求近似值和极限。例如，x→0 时 (eˣ – 1 – x)/x² 的极限，将 eˣ 展开至 x² 项可得极限为 1/2。
6. Further Vectors | 进阶向量
Vectors in three dimensions are extended with the scalar (dot) product and vector (cross) product. For vectors a = a₁i + a₂j + a₃k and b = b₁i + b₂j + b₃k, the dot product is a⋅b = a₁b₁ + a₂b₂ + a₃b₃ = |a||b| cos θ. It is used to find the angle between vectors and to test perpendicularity (a⋅b = 0).
三维向量扩展了点乘和叉乘。对于向量 a = a₁i + a₂j + a₃k 和 b = b₁i + b₂j + b₃k，点乘为 a⋅b = a₁b₁ + a₂b₂ + a₃b₃ = |a||b| cos θ。它可用于求向量夹角和检验垂直关系（a⋅b = 0）。
The vector product a × b yields a vector perpendicular to both a and b, with magnitude |a||b| sin θ and direction given by the right-hand rule. Its components are calculated as a × b = (a₂b₃ – a₃b₂)i – (a₁b₃ – a₃b₁)j + (a₁b₂ – a₂b₁)k. The cross product is anti-commutative: a × b = – b × a.
向量积 a × b 得到一个同时垂直于 a 和 b 的向量，大小为 |a||b| sin θ，方向由右手定则确定。其分量计算为 a × b = (a₂b₃ – a₃b₂)i – (a₁b₃ – a₃b₁)j + (a₁b₂ – a₂b₁)k。叉乘反交换：a × b = – b × a。
Lines in 3D are represented by r = a + λb, where a is a point on the line and b is a direction vector. The shortest distance from a point P to a line can be found using the cross product: distance = |(AP) × b| / |b|, where A is any point on the line. The angle between two lines is determined from their direction vectors using the dot product.
三维直线表示为 r = a + λb，其中 a 是直线上一点，b 是方向向量。一点 P 到直线的最短距离可用叉乘计算：距离 = |(AP) × b| / |b|，其中 A 为直线上任意点。两直线夹角通过它们方向向量的点乘求得。
7. Further Differentiation | 进阶微分
AS Further Mathematics extends differentiation techniques to include the chain rule with parametric and implicit functions, and second derivatives. For parametric equations x = f(t), y = g(t), the derivative dy/dx is found by dy/dx = (dy/dt) / (dx/dt). The second derivative is d²y/dx² = d/dt(dy/dx) / (dx/dt).
AS进阶数学扩展了微分技巧，包括参数函数和隐函数的链式法则，以及二阶导数。对于参数方程 x = f(t), y = g(t)，导数 dy/dx 通过 dy/dx = (dy/dt) / (dx/dt) 求得。二阶导数为 d²y/dx² = d/dt(dy/dx) / (dx/dt)。
Implicit differentiation treats y as a function of x and differentiates both sides of an equation, adding dy/dx whenever a term in y is differentiated. For example, for x² + y² = 25, differentiating gives 2x + 2y dy/dx = 0 ⇒ dy/dx = -x/y. The second derivative can then be found by differentiating again implicitly.
隐函数微分将 y 视作 x 的函数，对方程两边同时求导，每当对 y 的项求导时添加 dy/dx。例如，x² + y² = 25，求导得 2x + 2y dy/dx = 0 → dy/dx = -x/y。然后可再次隐式求导得到二阶导数。
Related rates of change problems use the chain rule to connect known rates. For instance, if the radius of a circle increases at a constant rate, the rate of increase of the area dA/dt = dA/dr · dr/dt. These problems often require identifying the correct geometric relationship.
相关变化率问题利用链式法则连接已知变化率。例如，若圆的半径以恒定速率增加，面积增加速率 dA/dt = dA/dr · dr/dt。这类问题常需确定正确的几何关系。
8. Further Integration | 进阶积分
Integration techniques are deepened with integration by substitution, integration by parts, and the use of partial fractions. The reverse chain rule is formalised as substitution: ∫ f(g(x))g'(x) dx = ∫ f(u) du, where u = g(x). Definite integrals require changing limits accordingly.
积分技巧通过换元积分法、分部积分法以及部分分式法加以深化。反链式法则规范为换元法：∫ f(g(x))g'(x) dx = ∫ f(u) du，其中 u = g(x)。定积分需相应变换积分限。
Integration by parts is derived from the product rule: ∫ u dv/dx dx = uv – ∫ v du/dx dx. Choosing u and dv/dx is crucial; a common mnemonic is LIATE (Logarithmic, Inverse trig, Algebraic, Trigonometric, Exponential). For example, ∫ x eˣ dx: let u = x, dv/dx = eˣ ⇒ du/dx = 1, v = eˣ, so integral = x eˣ – ∫ eˣ dx = x eˣ – eˣ + C.
分部积分法源自乘法法则：∫ u dv/dx dx = uv – ∫ v du/dx dx。选择 u 和 dv/dx 至关重要；常用助记法 LIATE（对数、反三角、代数、三角、指数）。例如，∫ x eˣ dx：令 u = x, dv/dx = eˣ → du/dx = 1, v = eˣ，积分得 x eˣ – ∫ eˣ dx = x eˣ – eˣ + C。
Partial fractions decompose rational functions into simpler fractions, enabling integration. For distinct linear factors, express as A/(x-a) + B/(x-b) etc. Integrals then yield natural logarithms. Repeated factors and irreducible quadratics require different decompositions.
部分分式将有理函数分解为更简单的分式，便于积分。对于相异线性因子，可表示为 A/(x-a) + B/(x-b) 等形式，积分后得到自然对数。重复因子和不可约二次式则需要不同的分解形式。
Differential equations of the form dy/dx = f(x)g(y) are solved by separation of variables: rewrite as (1/g(y)) dy = f(x) dx, then integrate both sides. The constant of integration is determined by initial conditions.
形如 dy/dx = f(x)g(y) 的微分方程通过分离变量法求解：改写为 (1/g(y)) dy = f(x) dx，然后两边积分。积分常数由初始条件确定。
9. Algorithms | 算法
A distinctive feature of the MEA (OCR MEI) specification is the study of algorithms and graph theory. Dijkstra’s algorithm finds the shortest path from a start node to all other nodes in a weighted graph. It uses a labelling method, iteratively updating temporary labels and permanently fixing the smallest tentative distance.
MEA（OCR MEI）大纲的一个特色是算法与图论的学习。迪杰斯特拉算法用于在加权图中寻找从起始节点到所有其他节点的最短路径。它使用标号法，迭代更新临时标号，并永久固定最小的临时距离值。
The planarity algorithm determines if a graph is planar by attempting to draw it without crossing edges. It relies on cycles and the identification of Hamiltonian cycles to arrange vertices. Kruskal’s and Prim’s algorithms find minimum spanning trees; Kruskal’s adds edges in ascending order of weight avoiding cycles, while Prim’s grows a tree from a start vertex, adding the smallest edge connecting a tree vertex to a non-tree vertex.
平面性算法通过尝试无交叉边绘图来判断图是否可平面化。它基于圈和哈密顿圈的识别来排列顶点。克鲁斯卡尔算法和普里姆算法求最小生成树；克鲁斯卡尔按权重升序添加边并避免形成圈，而普里姆从起始顶点开始生长树，每次添加连接树内顶点与树外顶点的最小边。
The simplex algorithm solves linear programming problems by moving along edges of the feasible region. The standard form uses slack variables, a tableau, and pivot operations. The optimal solution is found when all entries in the objective row are non-negative (for maximisation). Two-stage simplex handles artificial variables when the origin is not feasible.
单纯形算法通过沿可行域边界移动来求解线性规划问题。标准形式使用松弛变量、单纯形表和转轴操作。当目标行所有项非负时（对最大化问题），找到最优解。当原点不可行时，需使用两阶段单纯形法引入人工变量。
Floyd’s algorithm finds the shortest distances between every pair of nodes in a network using an iterative matrix method. At each stage, it checks if a route through an intermediate node offers a shorter path, updating the distance matrix until it converges.
弗洛伊德
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导