AQA International A-Level FP2 Pure Maths: Core Methods and Exam Focus | AQA国际A-Level纯数学FP2：核心方法与考点精讲

📚 AQA International A-Level FP2 Pure Maths: Core Methods and Exam Focus | AQA国际A-Level纯数学FP2：核心方法与考点精讲

FP2 is the second pure unit in the AQA International A-Level Further Mathematics route. It brings together complex numbers, advanced calculus, hyperbolic functions, polar coordinates, series and differential equations. This revision guide walks through the main methods and common exam traps.

FP2 是 AQA 国际 A-Level 进阶数学的第二门纯数单元。它把复数、进阶微积分、双曲函数、极坐标、级数和微分方程整合在一起。本复习指南梳理主要方法与常见考试陷阱。

1. Complex Numbers: Exponential Form and De Moivre’s Theorem | 复数：指数形式与棣莫弗定理

A complex number z = x + iy can be written in modulus-argument form as r(cos θ + i sin θ). Euler’s relation e^(iθ) = cos θ + i sin θ gives the exponential form z = re^(iθ). De Moivre’s theorem states that for integer n:

复数 z = x + iy 可写成模-辐角形式 r(cos θ + i sin θ)。欧拉公式 e^(iθ) = cos θ + i sin θ 给出指数形式 z = re^(iθ)。棣莫弗定理指出，对整数 n 有：

(cos θ + i sin θ)ⁿ = cos nθ + i sin nθ

To raise a complex number to a power, convert to exponential form, multiply the argument by n, then convert back to rectangular form. For roots, use the general formula zₖ = r^(1/n)e^(i(θ + 2πk)/n) with k = 0, 1, …, n – 1. This avoids expanding brackets and is much faster under exam conditions.

求复数幂时，先化为指数形式，将辐角乘以 n，再转回直角坐标形式。开 n 次根时，使用通式 zₖ = r^(1/n)e^(i(θ + 2πk)/n)，其中 k = 0, 1, …, n – 1。这样可避免展开括号，考试时更快。

2. Roots of Unity and Loci | 单位根与轨迹

The n-th roots of unity are the solutions of zⁿ = 1, given by z = e^(2πki/n) for k = 0, 1, …, n – 1. They are equally spaced around the unit circle and their sum is zero. If ω is a non-real cube root of unity, then 1 + ω + ω² = 0.

n 次单位根是 zⁿ = 1 的解，由 z = e^(2πki/n) 给出，其中 k = 0, 1, …, n – 1。它们在单位圆上等距分布，且和为零。若 ω 是非实数三次单位根，则 1 + ω + ω² = 0。

Loci in the Argand diagram include |z – a| = r, which describes a circle centre a; |z – a| = |z – b|, the perpendicular bisector of the segment joining a and b; and arg(z – a) = θ, a half-line from a. Always sketch the locus before attempting geometric problems.

阿甘图上的轨迹包括 |z – a| = r，表示以 a 为圆心的圆；|z – a| = |z – b|，表示连接 a 与 b 的线段的垂直平分线；arg(z – a) = θ，表示从 a 出发的射线。解几何题前务必先画出轨迹。

3. Roots of Polynomials | 多项式根与系数

For a cubic ax³ + bx² + cx + d = 0 with roots α, β, γ, the elementary symmetric sums are:

对于有根 α、β、γ 的三次方程 ax³ + bx² + cx + d = 0，基本对称和为：

Σα = -b/a, Σαβ = c/a, αβγ = -d/a

For quartics the pattern extends to sums of roots, sums of paired products, sums of triples and the product. When a new root transformation is given, such as β = α², substitute into the original equation or use symmetric sums. In exam answers, always relate the target expression to Σα, Σαβ and αβγ before substituting values.

四次方程则推广到根之和、两两根乘积之和、三根乘积之和以及所有根之积。当给定新根变换（如 β = α²）时，可代入原方程或使用对称和。答题时应先将目标表达式与 Σα、Σαβ、αβγ 联系起来，再代入数值。

4. Summation of Finite Series | 有限级数求和

Standard results for polynomial series are:

多项式级数的标准求和公式为：

Σ r = n(n + 1)/2, Σ r² = n(n + 1)(2n + 1)/6, Σ r³ = [n(n + 1)/2]²

To sum expressions such as Σ(3r² – 2r + 1), split the sum, factor out constants, and substitute the standard formulae separately. The method of differences applies when a term can be written as f(r) – f(r + 1) or f(r) – f(r – 1). Most terms cancel, leaving only the first and last pieces. This is common with fractions involving r(r + 1).

求和如 Σ(3r² – 2r + 1) 时，拆开求和、提出常数，再分别代入标准公式。差分法适用于某项能写成 f(r) – f(r + 1) 或 f(r) – f(r – 1) 的情况。大多数项相消，只剩首尾部分。这常见于含 r(r + 1) 的分式。

5. Proof by Induction | 数学归纳法

A standard induction proof has four parts: basis case, assumption, inductive step and conclusion. For summation identities, show that the next term is added to the assumed formula. For divisibility, write the n = k + 1 expression as a multiple of the divisor plus a term containing the assumption.

标准归纳法证明包括四部分：基础情形、假设、归纳步骤和结论。对于求和恒等式，证明在假设公式上加上下一项即可。对于整除性，可将 n = k + 1 的表达式写成除数的倍数加上含有假设的项。

A common error is assuming the conclusion or failing to state explicitly that P(k) implies P(k + 1). In exams, always write ‘Assume true for n = k’ rather than ‘assume true for n = n’. State the conclusion clearly: ‘Since P(1) is true and P(k) ⇒ P(k + 1), P(n) is true for all positive integers n.’

常见错误是预先假设结论

Published by TutorHao | A-Level Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）