📚 Edexcel Further Pure Mathematics: Key Concepts Explained | Edexcel 进阶纯数学：核心知识点精讲
Further Pure Mathematics forms the backbone of the Edexcel A-Level Further Mathematics qualification. It extends ideas from pure mathematics and equips learners with powerful tools for tackling complex problems in algebra, calculus, trigonometry and beyond. This article provides a carefully structured overview of the essential topics, highlighting the key concepts that appear regularly in examination papers and that underpin higher‑level mathematical thinking.
进阶纯数学是 Edexcel A‑Level 进阶数学资格认证的核心支柱。它延伸了纯数学的思想，为学生提供了处理代数、微积分、三角学及其他领域复杂问题的强有力工具。本文对核心主题进行了精心组织的概览，着重突出考试中频繁出现的、支撑着更高层次数学思维的关键概念。
1. Complex Numbers and the Argand Diagram | 复数与阿尔甘图
A complex number is written as z = x + iy, where x and y are real numbers and i² = –1. The real part Re(z) = x and the imaginary part Im(z) = y. The Argand diagram represents z as a point (x, y) or as a vector from the origin.
复数写作 z = x + iy，其中 x 和 y 是实数，且 i² = –1。实部 Re(z) = x，虚部 Im(z) = y。阿尔甘图将 z 表示为点 (x, y) 或从原点出发的向量。
The modulus |z| = √(x² + y²) gives the distance from the origin, and the argument arg z = θ, measured from the positive real axis. The modulus‑argument form is z = r(cosθ + i sinθ), where r = |z|. Euler’s relation eⁱθ = cosθ + i sinθ links trigonometry to exponentials.
模 |z| = √(x² + y²) 表示到原点的距离，辐角 arg z = θ 从正实轴开始度量。模‑辐角形式为 z = r(cosθ + i sinθ)，其中 r = |z|。欧拉关系 eⁱθ = cosθ + i sinθ 将三角学与指数联系起来。
Adding and subtracting complex numbers follow the parallelogram rule on the Argand diagram, while multiplication rotates and scales the vector. Division uses the complex conjugate z̄ = x – iy, so that z × z̄ = |z|² is real.
加减复数在阿尔甘图上遵循平行四边形法则，而乘法则是旋转并缩放向量。除法利用共轭复数 z̄ = x – iy，使 z × z̄ = |z|² 成为实数。
z₁z₂ = r₁r₂[cos(θ₁+θ₂) + i sin(θ₁+θ₂)]
2. De Moivre’s Theorem and nth Roots | 棣莫弗定理与 n 次根
De Moivre’s theorem states that for any integer n, (cosθ + i sinθ)ⁿ = cos(nθ) + i sin(nθ). This result is particularly powerful for proving trigonometric identities and for finding roots of complex numbers.
棣莫弗定理指出，对于任何整数 n，(cosθ + i sinθ)ⁿ = cos(nθ) + i sin(nθ)。该结果在证明三角恒等式以及求复数的根时特别强大。
To find the n distinct nth roots of a complex number w = r(cosφ + i sinφ), we use zₖ = r¹⁄ⁿ[cos((φ + 2πk)/n) + i sin((φ + 2πk)/n)] for k = 0, 1, …, n–1. The roots lie on a circle of radius r¹⁄ⁿ and are equally spaced around it.
为了求复数 w = r(cosφ + i sinφ) 的 n 个不同的 n 次根，我们使用 zₖ = r¹⁄ⁿ[cos((φ + 2πk)/n) + i sin((φ + 2πk)/n)]，其中 k = 0, 1, …, n–1。这些根分布在半径为 r¹⁄ⁿ 的圆上，并且等间距排列。
Applications include solving equations of the form zⁿ = a + i b and expressing sinⁿθ or cosⁿθ in terms of multiple angles. For example, cos³θ = ¼(cos3θ + 3cosθ) can be derived using De Moivre’s theorem and binomial expansion.
应用包括求解形如 zⁿ = a + i b 的方程，以及用多倍角表示 sinⁿθ 或 cosⁿθ。例如，利用棣莫弗定理和二项式展开可推导出 cos³θ = ¼(cos3θ + 3cosθ)。
3. Matrices and Linear Transformations | 矩阵与线性变换
A 2×2 matrix represents a linear transformation in the plane. The image of a point with position vector r = (x, y)ᵀ is given by multiplication by the matrix M. Common transformations include reflections, rotations, stretches and shears.
2×2 矩阵表示平面中的线性变换。位置向量为 r = (x, y)ᵀ 的点的像通过对矩阵 M 相乘得到。常见的变换包括反射、旋转、拉伸和剪切。
The determinant of a matrix M = det(M) tells us the area scale factor of the transformation. If det(M) = 0, the transformation is singular and maps points onto a line through the origin. Inverse matrices, where they exist, reverse the transformation: M⁻¹M = I.
矩阵 M 的行列式 det(M) 告诉我们变换的面积比例因子。若 det(M) = 0，变换是奇异的，将所有点映射到过原点的一条直线上。逆矩阵（若存在）则逆转该变换：M⁻¹M = I。
Eigenvalues λ and eigenvectors v satisfy Mv = λv. They reveal invariant lines under the transformation. For a rotation matrix eigenvalues are complex, and for a reflection one eigenvalue is –1.
特征值 λ 和特征向量 v 满足 Mv = λv。它们揭示了变换下的不变直线。对于旋转矩阵，特征值为复数；对于反射矩阵，有一个特征值为 –1。
| Transformation | Matrix | det |
|---|---|---|
| Reflection in y=x | [0 1; 1 0] | –1 |
| Rotation by θ anticlockwise | [cosθ –sinθ; sinθ cosθ] | 1 |
| Shear parallel to x‑axis | [1 k; 0 1] | 1 |
4. Series Summation and Standard Results | 级数求和与标准结果
Summing finite series is a key skill. The standard results for the sum of the first n natural numbers, their squares and cubes are fundamental:
对有限级数求和是一项关键技能。前 n 个自然数、它们的平方与立方的标准求和结果是基础：
Σᵣ₌₁ⁿ r = ½n(n+1), Σᵣ₌₁ⁿ r² = ⅙n(n+1)(2n+1), Σᵣ₌₁ⁿ r³ = ¼n²(n+1)²
We often need to split a sum involving r(r+1) or algebraic fractions into combinations of these standard forms. For example, Σ (r³ + 2r) = Σ r³ + 2 Σ r.
我们经常需要将包含 r(r+1) 或代数分式的和拆分成这些标准形式的组合。例如，Σ (r³ + 2r) = Σ r³ + 2 Σ r。
Proof by induction is used to verify a given closed form for a sum. The inductive step requires showing that if the statement holds for n = k, then adding the (k+1)th term yields the formula for n = k+1.
归纳法用于验证一个给定的闭合求和形式。归纳步骤要求证明：若命题对 n = k 成立，则加上第 (k+1) 项便得到 n = k+1 时的公式。
Another technique is the method of differences, where terms cancel telescopically. For expressions like 1/(r(r+1)), we write it as 1/r – 1/(r+1) so that most terms cancel when summed from r=1 to n.
另一种方法是差分法，其中的项可以相消（裂项相消）。对于 1/(r(r+1)) 这样的表达式，我们将其写成 1/r – 1/(r+1)，使得从 r=1 到 n 求和时绝大部分项会抵消。
5. Method of Differences and Partial Fractions | 差分法与部分分式
The method of differences is especially useful for series of rational functions. Using partial fractions, we decompose the nth term into a difference of successive terms f(r) – f(r+1) or f(r) – f(r–1). The sum then collapses to f(1) – f(n+1).
差分法对有理函数级数特别有用。利用部分分式，我们将第 n 项分解为连续项的差 f(r) – f(r+1) 或 f(r) – f(r–1)。然后求和结果缩并为 f(1) – f(n+1)。
For example, to sum Σ from r=1 to n of 1/[(r+1)(r+2)], write the term as 1/(r+1) – 1/(r+2). Summing gives ½ – 1/(n+2). The same principle works for series with three factors in the denominator.
例如，要对 r=1 到 n 的 1/[(r+1)(r+2)] 求和，将项写作 1/(r+1) – 1/(r+2)。求和后得到 ½ – 1/(n+2)。同样的原理适用于分母中含有三个因式的级数。
When applying partial fractions, always match numerators and solve for constants A, B, etc. For terms like (2r+1)/[r(r+1)], we obtain A/r + B/(r+1). The sum then becomes a difference series.
应用部分分式时，要始终匹配分子并解出常数 A, B 等。对于 (2r+1)/[r(r+1)] 这样的项，我们得到 A/r + B/(r+1)。随后求和便化为差分级数。
6. Recurrence Relations and Modelling | 递归关系与建模
A first‑order recurrence relation takes the form uₙ₊₁ = f(uₙ). Given u₁, we can generate a sequence. Second‑order linear recurrences with constant coefficients, such as uₙ₊₂ = p uₙ₊₁ + q uₙ, are solved by forming the auxiliary equation λ² – pλ – q = 0.
一阶递推关系形如 uₙ₊₁ = f(uₙ)。给定 u₁，我们可以生成序列。常系数的二阶线性递推，如 uₙ₊₂ = p uₙ₊₁ + q uₙ，通过构造辅助方程 λ² – pλ – q = 0 来求解。
If the auxiliary equation has distinct real roots α and β, the general solution is uₙ = A αⁿ + B βⁿ. For repeated root α, uₙ = (A + Bn)αⁿ. The constants A and B are determined by initial conditions.
若辅助方程有相异实根 α 和 β，通解为 uₙ = A αⁿ + B βⁿ。对于重根 α，uₙ = (A + Bn)αⁿ。常数 A 和 B 由初始条件确定。
Recurrence relations model population growth, financial problems and computer algorithms. Increasing sequences may converge to a limit L found by setting uₙ₊₁ = uₙ = L and solving L = f(L).
递推关系可用于模拟人口增长、金融问题以及计算机算法。递增序列可能收敛至某个极限 L，通过设 uₙ₊₁ = uₙ = L 并求解 L = f(L) 得到该极限。
7. Hyperbolic Functions and Their Inverses | 双曲函数及其反函数
The hyperbolic functions are defined by sinh x = (eˣ – e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, and tanh x = sinh x / cosh x. They satisfy identities similar to trigonometric ones, for instance cosh²x – sinh²x = 1.
双曲函数定义为 sinh x = (eˣ – e⁻ˣ)/2，cosh x = (eˣ + e⁻ˣ)/2，tanh x = sinh x / cosh x。它们满足类似于三角恒等式的性质，例如 cosh²x – sinh²x = 1。
Osborn’s rule helps convert trigonometric identities into hyperbolic identities: replace sin²θ → –sinh²θ, or simply apply a change of sign whenever a product of two sines occurs.
奥斯本法则有助于将三角恒等式转化为双曲恒等式：每当出现两个正弦的乘积时改变符号，即用 –sinh²θ 替换 sin²θ。
Inverse hyperbolic functions are expressed in logarithms: arsinh x = ln(x + √(x²+1)), arcosh x = ln(x + √(x²–1)) for x ≥ 1, and artanh x = ½ ln((1+x)/(1–x)) for |x| < 1. These are essential when integrating certain functions.
反双曲函数用对数表示：arsinh x = ln(x + √(x²+1))；arcosh x = ln(x + √(x²–1))，其中 x ≥ 1；artanh x = ½ ln((1+x)/(1–x))，其中 |x| < 1。这些在积分某些函数时至关重要。
8. Polar Coordinates and Conic Sections | 极坐标与圆锥曲线
In polar coordinates a point is given by (r, θ), where r is the distance from the pole O and θ the angle from the initial line. The connection to Cartesian coordinates is x = r cosθ, y = r sinθ.
在极坐标系中，点的坐标记为 (r, θ)，其中 r 是到极点 O 的距离，θ 是从极轴出发的角度。与笛卡尔坐标的关系为 x = r cosθ，y = r sinθ。
Area enclosed by a polar curve r = f(θ) between θ = α and θ = β is ½ ∫ r² dθ. For curves with loops, careful attention to the limits is required to avoid double counting.
由极坐标曲线 r = f(θ) 在 θ = α 到 θ = β 之间所围成的面积由 ½ ∫ r² dθ 给出。对于带有环状的曲线，需仔细处理积分限以避免重复计算。
The general polar equation of a conic with focus at the pole and directrix x = d (ed = constant) is r = l / (1 + e cosθ). Here e is the eccentricity: e = 0 gives a circle, 0 < e < 1 an ellipse, e = 1 a parabola, and e > 1 a hyperbola.
以极点为焦点、以 x = d 为准线（ed = 常数）的圆锥曲线的一般极坐标方程为 r = l / (1 + e cosθ)。其中 e 为离心率：e = 0 为圆，0 < e < 1 为椭圆，e = 1 为抛物线，e > 1 为双曲线。
9. First Order Differential Equations | 一阶微分方程
Many Further Pure problems involve solving first‑order ODEs of the form dy/dx = f(x, y). Separable equations allow variables to be collected on opposite sides: (1/g(y)) dy = f(x) dx, leading to direct integration.
许多进阶纯数学问题涉及求解形如 dy/dx = f(x, y) 的一阶常微分方程。可分离变量方程允许将变量各自归到等号两侧：(1/g(y)) dy = f(x) dx，从而直接积分。
For a linear first‑order equation dy/dx + P(x) y = Q(x), the integrating factor is e^(∫ P dx). Multiplying through reduces the left‑hand side to the derivative of y × I.F. This method is systematic and exam‑friendly.
对于线性一阶方程 dy/dx + P(x) y = Q(x)，积分因子为 e^(∫ P dx)。乘以积分因子后，左边化为 y × I.F. 的导数。该方法系统性强，适合考试。
Homogeneous equations of the form dy/dx = F(y/x) are solved using the substitution y = vx. This turns the equation into a separable one in v and x. Boundary conditions are used to find particular solutions.
形如 dy/dx = F(y/x) 的齐次方程通过代换 y = vx 求解。这会将方程化为 v 和 x 的可分离变量方程。边界条件用于求得特解。
10. Numerical Methods for Equations | 方程的数值解法
When algebraic methods fail, numerical techniques locate roots of f(x) = 0. The Newton‑Raphson iteration xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ) converges quadratically if the initial guess is sufficiently close to the root.
当代数方法无法求解时，数值技术可用于定位 f(x) = 0 的根。牛顿‑拉弗森迭代 xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ) 若初始猜测充分靠近根，则具有二次收敛性。
The sign‑change method checks for a root in an interval where f(a) and f(b) have opposite signs. Linear interpolation or interval bisection narrows the interval until the desired accuracy is reached.
符号变化法通过检查区间 f(a) 和 f(b) 异号来确认存在根。线性插值或区间二分法不断缩小区间，直到达到所需精度。
Fixed point iteration xₙ₊₁ = g(xₙ) converges if |g'(x)| < 1 near the root. Rearranging the equation into a suitable form is crucial. Cobweb and staircase diagrams illustrate convergence behaviour graphically.
不动点迭代 xₙ₊₁ = g(xₙ) 若在根附近满足 |g'(x)| < 1 则收敛。将方程重新排列成适当形式至关重要。蛛网图和阶梯图可图解收敛行为。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导