📚 AS Eduqas Further Mathematics: Core Knowledge Review | AS Eduqas 进阶数学：核心知识点梳理
The AS Eduqas Further Mathematics qualification builds on single mathematics and introduces a wealth of new concepts across pure and applied modules. The compulsory unit, Further Pure Mathematics A, covers proof by induction, complex numbers, matrices, vectors, summation of series, and numerical methods. Students then choose two optional modules from Further Pure Mathematics B, Further Mechanics A, Further Statistics A, and Decision Mathematics A, each bringing distinctive techniques and problem-solving skills. This article presents a structured review of the core knowledge required for success, with paired explanations in English and Chinese.
AS Eduqas 进阶数学考试在普通数学的基础上引入了大量纯数学和应用数学的新概念。必修单元 Further Pure Mathematics A 涵盖数学归纳法证明、复数、矩阵、向量、级数求和以及数值方法。随后，学生从 Further Pure Mathematics B、Further Mechanics A、Further Statistics A 和 Decision Mathematics A 中选择两个选修模块，每一个模块都带来独特的技巧与问题解决能力。本文以英文和中文配对的方式，系统梳理了取得优异成绩所需的核心知识点。
1. Proof by Induction | 数学归纳法证明
Proof by induction is used to establish that a statement holds for all positive integers. The process involves a base case, an inductive hypothesis, and the inductive step. For example, to prove Σr² = n(n+1)(2n+1)/6, verify the result for n=1, assume it true for n=k, and then show it holds for n=k+1 using algebraic manipulation.
数学归纳法用于证明某个命题对所有正整数都成立。过程包括基础情形、归纳假设和归纳步骤。比如，证明 Σr² = n(n+1)(2n+1)/6 时，先验证 n=1 时成立，假设 n=k 时成立，再通过代数推导证明 n=k+1 时也成立。
Clear presentation of the inductive step is crucial: start from the assumed expression for k, add the (k+1)th term, and rearrange to match the target form. Examiners expect a concluding statement stating that the proposition holds for all n ∈ N by the principle of mathematical induction.
归纳步骤的清晰表达至关重要：从假设的 k 的表达式出发，加上第 (k+1) 项，再重组得到目标形式。考官期望看到结论句，说明由数学归纳法原理，命题对所有 n ∈ N 成立。
2. Complex Numbers | 复数基础
The imaginary unit i satisfies i² = -1. A complex number z = a + bi has real part a and imaginary part b. Addition and subtraction are performed by combining real and imaginary parts separately; multiplication uses the distributive law and i² = -1.
虚数单位 i 满足 i² = -1。复数 z = a + bi 的实部为 a，虚部为 b。加减法只需分别合并实部和虚部；乘法利用分配律并代入 i² = -1。
The complex conjugate of z = a + bi is z* = a – bi. Division by a complex number is achieved by multiplying numerator and denominator by the conjugate of the denominator, making the denominator real. Solving quadratic equations with negative discriminants yields conjugate pairs of complex roots.
z = a + bi 的共轭复数为 z* = a – bi。复数除法通过将分子分母同乘分母的共轭来实现，使分母变为实数。解判别式为负的二次方程可得到共轭复根。
3. Matrices and Linear Transformations | 矩阵与线性变换
Matrices are rectangular arrays of numbers that represent linear transformations. In AS Further Mathematics, the focus is on 2×2 matrices. Addition and scalar multiplication follow element-wise rules; matrix multiplication is non-commutative in general. The identity matrix I leaves vectors unchanged.
矩阵是代表线性变换的数字矩形阵列。在 AS 进阶数学中，重点在于 2×2 矩阵。加法和数乘遵循逐元素法则；矩阵乘法通常不可交换。单位矩阵 I 保持向量不变。
The determinant of a 2×2 matrix M = [[a,b],[c,d]] is det(M) = ad – bc. If the determinant is non-zero, the matrix is invertible and its inverse is (1/det(M)) [[d,-b],[-c,a]]. The matrix product MN corresponds to applying transformation N followed by M.
2×2 矩阵 M = [[a,b],[c,d]] 的行列式为 det(M) = ad – bc。若行列式不为零，则矩阵可逆，其逆矩阵为 (1/det(M)) [[d,-b],[-c,a]]。矩阵乘积 MN 对应先应用变换 N，再应用变换 M。
4. Vectors and Cross Product | 向量与叉积运算
In three dimensions, the cross product (or vector product) of two vectors a and b is a vector perpendicular to both, with magnitude |a||b| sin θ, where θ is the angle between them. Using unit vectors i, j, k, if a = a₁i + a₂j + a₃k and b = b₁i + b₂j + b₃k, then a × b = (a₂b₃ – a₃b₂)i – (a₁b₃ – a₃b₁)j + (a₁b₂ – a₂b₁)k.
在三维空间中，两向量 a 和 b 的叉积（向量积）是一个垂直于两者的向量，大小为 |a||b| sin θ，其中 θ 为两向量夹角。使用单位向量 i, j, k，若 a = a₁i + a₂j + a₃k 且 b = b₁i + b₂j + b₃k，则 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). It is useful for finding normals to planes, calculating areas of parallelograms, and solving vector equations of lines and planes. The scalar triple product a · (b × c) gives the volume of a parallelepiped.
叉积满足反交换律：a × b = – (b × a)。它可用于求平面法向量、计算平行四边形面积，以及解直线与平面的向量方程。标量三重积 a · (b × c) 给出平行六面体的体积。
5. Summation of Series | 级数求和
Standard summation formulas for positive integers are fundamental: Σr = n(n+1)/2, Σr² = n(n+1)(2n+1)/6, and Σr³ = n²(n+1)²/4. These results are proved by induction and then used to sum polynomial expressions by splitting the sum into standard parts.
正整数的标准求和公式是基础：Σr = n(n+1)/2，Σr² = n(n+1)(2n+1)/6，以及 Σr³ = n²(n+1)²/4。这些结果通过归纳法证明，随后用于求多项式表达式的和，只需将和式拆分为标准部分。
When dealing with series involving fractions, the method of differences can simplify sums by telescoping. For example, 1/(r(r+1)) can be expressed as 1/r – 1/(r+1), leading to cancellation of terms in the sum from r=1 to n.
Σ 1/(r(r+1)) = 1 – 1/(n+1)
处理包含分数的级数时，裂项法可通过伸缩简化求和。例如，1/(r(r+1)) 可写成 1/r – 1/(r+1)，使得从 r=1 到 n 的求和中的项大量消去。
Σ 1/(r(r+1)) = 1 – 1/(n+1)
6. Numerical Methods | 数值方法
The Newton-Raphson method finds successively better approximations to the roots of a real-valued function. Starting with an initial guess x₀, the iterative formula is:
xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ)
The method converges quadratically near a simple root, provided f'(xₙ) is not zero. Students must be able to derive the formula from the tangent line equation and apply it to equations like x³ – x – 1 = 0.
Newton-Raphson 方法可逐次逼近实值函数的根。从初始猜测值 x₀ 开始，迭代公式为：
xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ)
在靠近单根且 f'(xₙ) 不为零时，方法具有二次收敛性。学生需能从切线方程推导该公式，并将其应用于诸如 x³ – x – 1 = 0 的方程。
When an interval [a, b] contains a root and f(a) and f(b) have opposite signs, the sign-change method (interval bisection or linear interpolation) can be used. The change-of-sign criterion must be checked at each iteration to guarantee convergence.
若区间 [a, b] 含有根且 f(a) 与 f(b) 异号，可使用符号变换法（区间二分或线性插值）。每次迭代须检验符号变化准则以保证收敛。
7. Further Pure Mathematics B: Selected Topics (Polar Coordinates & Hyperbolic Functions) | 进阶纯数B：精选主题（极坐标与双曲函数）
In polar coordinates, points are described by (r, θ), where r is the distance from the origin and θ is the angle from the initial line. Curves are defined by equations such as r = a(1 + cos θ) (cardioid). The area bounded by a polar curve is given by ½ ∫ r² dθ over the appropriate interval.
在极坐标中，点由 (r, θ) 描述，r 为到原点的距离，θ 为从极轴起的角度。曲线由方程定义，例如 r = a(1 + cos θ)（心形线）。极坐标曲线所围面积由 ½ ∫ r² dθ 在适当区间上积分求得。
Hyperbolic functions are defined using exponentials: sinh x = (eˣ – e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, tanh x = sinh x / cosh x. They satisfy identities analogous to trigonometric ones, with Osborn’s rule guiding sign changes. For instance, cosh² x – sinh² x = 1, and sinh(2x) = 2 sinh x cosh x.
双曲函数使用指数函数定义：sinh x = (eˣ – e⁻ˣ)/2，cosh x = (eˣ + e⁻ˣ)/2，tanh x = sinh x / cosh x。它们满足类似于三角恒等式的恒等式，Osborn 法则指导符号变化。例如，cosh² x – sinh² x = 1，sinh(2x) = 2 sinh x cosh x。
8. Further Mechanics A: Elasticity and Simple Harmonic Motion | 进阶力学A：弹性与简谐运动
Hooke’s Law for an elastic string or spring states that the tension T is proportional to the extension x from natural length l: T = λx/l, where λ is the modulus of elasticity. The elastic potential energy (EPE) stored is EPE = λx²/(2l). These principles are used to solve equilibrium and motion problems with elastic forces.
弹性绳或弹簧的胡克定律表明，张力 T 与超出原长 l 的伸长量 x 成正比：T = λx/l，其中 λ 为弹性模量。储存的弹性势能（EPE）为 EPE = λx²/(2l)。这些原理用于解决涉及弹性力的平衡和运动问题。
Simple harmonic motion (SHM) occurs when the acceleration of a particle is directed towards a fixed point and proportional to the displacement: a = -ω²x, where ω is the angular frequency. The general solution is x = A cos(ωt + φ) or x = A sin(ωt) + B cos(ωt). The period is T = 2π/ω, and v² = ω²(A² – x²) links velocity and displacement.
当质点的加速度指向固定点且与位移成正比时，便产生简谐运动（SHM）：a = -ω²x，其中 ω 为角频率。通解为 x = A cos(ωt + φ) 或 x = A sin(ωt) + B cos(ωt)。周期为 T = 2π/ω，速度与位移关系为 v² = ω²(A² – x²)。
9. Further Statistics A: Poisson Distribution & Chi-squared Tests | 进阶统计A：泊松分布与卡方检验
The Poisson distribution models the number of events occurring in a fixed interval of time or space, assuming events happen independently at a constant average rate λ. The probability function is P(X = r) = e⁻ⁿ λʳ / r! for r = 0, 1, 2, … . Both the mean and variance equal λ. The Poisson can be used as an approximation to the binomial distribution when n is large and p is small.
泊松分布用于建模在固定时间或空间区间内发生的事件数，假设事件以恒定平均速率 λ 独立发生。概率函数为 P(X = r) = e⁻ⁿ λʳ / r!，r = 0, 1, 2, … 。均值与方差均为 λ。当 n 很大而 p 很小时，泊松分布可作为二项分布的近似。
The chi-squared (χ²) test for independence assesses whether two categorical variables are associated. A contingency table is used, and expected frequencies are calculated under the null hypothesis of independence. The test statistic is:
χ² = Σ (O – E)² / E
The degrees of freedom equal (rows – 1) × (columns – 1). The calculated χ² is compared to a critical value to decide whether to reject the null hypothesis.
独立性卡方 (χ²) 检验用于评估两个分类变量是否相关。使用列联表，在独立性的原假设下计算期望频数。检验统计量为：
χ² = Σ (O – E)² / E
自由度为 (行数 – 1) × (列数 – 1)。计算出的 χ² 与临界值比较，以决定是否拒绝原假设。
10. Decision Mathematics A: Graph Theory & Critical Path Analysis | 决策数学A：图论与关键路径分析
Graphs and networks underpin many decision mathematics algorithms. Dijkstra’s algorithm finds the shortest path from a start node to every other node in a weighted graph. At each step, the node with the smallest temporary label is made permanent, updating labels of its neighbours.
图与网络是众多决策数学算法的基础。Dijkstra 算法用于在加权图中找出从起始节点到其他所有节点的最短路径。每步将临时标号最小的节点固定为永久标号，并更新其相邻节点的标号。
Critical path analysis (CPA) is used to plan projects with dependent activities. A precedence table lists activities, their durations, and immediate predecessors. The activity network is drawn, and forward and backward passes calculate earliest start times (EST) and latest start times (LST). The critical path is the sequence of activities with zero total float, determining the minimum project completion time.
关键路径分析（CPA）用于规划具有依赖关系的项目。前序表列出活动、持续时间和紧前活动。绘制活动网络图，通过正向和反向推导计算最早开始时间（EST）和最晚开始时间（LST）。关键路径是总浮时为零的活动序列，决定了项目的最短完成时间。
Other algorithms in the module include Kruskal’s and Prim’s algorithms for finding a minimum spanning tree, and the Hungarian algorithm for assignment problems. Bin packing and sorting routines are also covered.
该模块中的其他算法包括用于求最小生成树的 Kruskal 和 Prim 算法，以及用于指派问题的匈牙利算法。装箱问题和排序例程也在学习范围之内。
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply