📚 AQA AS Further Pure Maths 1 (FP1) Complete Revision Guide | AQA AS 进阶纯数 1（FP1）全面复习指南
Welcome to your comprehensive revision guide for AQA International AS Further Pure Maths 1 (FP1). This unit builds directly on your A-level Pure Mathematics knowledge, introducing powerful new tools such as complex numbers, matrices, and proof by induction. Master these core topics and you will have a solid foundation for the full A-level Further Mathematics qualification.
欢迎阅读 AQA 国际 AS 进阶纯数 1（FP1）全面复习指南。本单元直接建立在你 A-level 纯数知识的基础之上，引入了复数、矩阵和数学归纳法等一系列强大的新工具。掌握这些核心主题，你便为完整的 A-level 进阶数学资质打下了坚实基础。
1. Complex Numbers: Basics | 复数：基础
A complex number is expressed in the form z = a + bi, where a and b are real numbers, and i is the imaginary unit defined by i² = −1. The real part is written Re(z) = a, and the imaginary part Im(z) = b. Complex numbers extend our number system so that every quadratic equation has a solution.
复数以 z = a + bi 的形式表示，其中 a 和 b 是实数，i 是虚数单位，定义为 i² = −1。实部记作 Re(z) = a，虚部记作 Im(z) = b。复数扩展了我们的数系，使得每一个二次方程都有解。
Key operations | 关键运算：
Addition: (a + bi) + (c + di) = (a + c) + (b + d)i | 加法：(a + bi) + (c + di) = (a + c) + (b + d)i
Subtraction: (a + bi) − (c + di) = (a − c) + (b − d)i | 减法：(a + bi) − (c + di) = (a − c) + (b − d)i
Multiplication: (a + bi)(c + di) = (ac − bd) + (ad + bc)i | 乘法：(a + bi)(c + di) = (ac − bd) + (ad + bc)i
Complex conjugate: z̄ = a − bi | 共轭复数：z̄ = a − bi
To divide by a complex number, multiply the numerator and denominator by the conjugate of the denominator. For example, 1/(2 + 3i) = (2 − 3i)/((2 + 3i)(2 − 3i)) = (2 − 3i)/13.
要除以一个复数，需将分子和分母同时乘以分母的共轭复数。例如，1/(2 + 3i) = (2 − 3i)/((2 + 3i)(2 − 3i)) = (2 − 3i)/13。
z̄z = a² + b² = |z|²
This identity is invaluable for simplifying expressions and finding reciprocals of complex numbers.
这个恒等式在化简表达式和求复数倒数时极为有用。
2. Modulus and Argument | 模与辐角
Every complex number z = a + bi can be represented as a point (a, b) on an Argand diagram, where the horizontal axis is the real axis and the vertical axis is the imaginary axis.
每一个复数 z = a + bi 都可以表示为阿甘图（Argand 图）上的一个点 (a, b)，其中横轴是实轴，纵轴是虚轴。
The modulus of z is the distance from the origin to the point, given by:
复数 z 的模是从原点到该点的距离，由下式给出：
|z| = √a² + b²
The argument of z is the angle the line from the origin to the point makes with the positive real axis, measured anti-clockwise. It satisfies:
复数 z 的辐角是从原点到该点的连线与正实轴之间的夹角，逆时针方向测量。它满足：
tan θ = b/a, with −π < θ ≤ π
When calculating the argument, always consider which quadrant the complex number lies in. For example, z = −1 + i has argument 3π/4, not −π/4, because the point is in the second quadrant.
计算辐角时，务必考虑复数所在的象限。例如，z = −1 + i 的辐角是 3π/4，而不是 −π/4，因为该点位于第二象限。
In modulus-argument form, any complex number can be written as:
在模-辐角形式下，任何复数都可以写成：
z = r(cos θ + i sin θ), where r = |z|
3. de Moivre's Theorem | 棣莫弗定理
De Moivre's theorem is one of the most powerful tools in FP1. It states that for any integer n:
棣莫弗定理是 FP1 中最强大的工具之一。它指出，对于任何整数 n：
(cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ)
This theorem allows us to find powers and roots of complex numbers with remarkable ease. For example, to find (1 + i)⁸, first express 1 + i in modulus-argument form:
该定理使我们能够非常轻松地求复数的幂和根。例如，要求 (1 + i)⁸，首先将 1 + i 表示为模-辐角形式：
1 + i = √2(cos π/4 + i sin π/4)
Then apply de Moivre's theorem: (√2)⁸ (cos(8 × π/4) + i sin(8 × π/4)) = 16(cos 2π + i sin 2π) = 16.
然后应用棣莫弗定理：(√2)⁸ (cos(8 × π/4) + i sin(8 × π/4)) = 16(cos 2π + i sin 2π) = 16。
De Moivre's theorem also extends to negative and fractional powers, enabling us to find nth roots of complex numbers. The n distinct nth roots of a complex number r(cos θ + i sin θ) are:
棣莫弗定理也扩展到负幂和分数幂，使我们能够求复数的 n 次方根。复数 r(cos θ + i sin θ) 的 n 个不同的 n 次方根为：
r1/n [cos((θ + 2kπ)/n) + i sin((θ + 2kπ)/n)], k = 0, 1, 2, …, n−1
These roots always lie on a circle of radius r1/n centred at the origin, equally spaced around the circle.
这些根始终位于以原点为圆心、半径为 r1/n 的圆上，并且等间距地分布在圆周上。
4. Roots of Quadratic Equations | 二次方程的根
For a quadratic equation with real coefficients, ax² + bx + c = 0, the roots come in complex conjugate pairs. That is, if z is a root, then z̄ is also a root. This is a crucial fact for solving and factorising.
对于实系数二次方程 ax² + bx + c = 0，根以共轭复数对的形式出现。也就是说，如果 z 是一个根，那么 z̄ 也是它的根。这是求解和因式分解的关键事实。
Using the quadratic formula with negative discriminants:
使用二次公式处理负判别式：
x = (−b ± √b² − 4ac) / 2a
When b² − 4ac < 0, we write √negative as i√positive. For example, x² + 4x + 13 = 0 gives:
当 b² − 4ac < 0 时，我们将 √负数 写成 i√正数。例如，x² + 4x + 13 = 0 得到：
x = (−4 ± √16 − 52) / 2 = (−4 ± √−36) / 2 = (−4 ± 6i) / 2 = −2 ± 3i
So the roots are −2 + 3i and −2 − 3i, which are indeed a conjugate pair.
因此根为 −2 + 3i 和 −2 − 3i，它们确实是一对共轭复数。
5. Roots of Cubic and Quartic Equations | 三次与四次方程的根
For a cubic equation with real coefficients, either all three roots are real, or one root is real and the other two form a complex conjugate pair. The relationships between roots and coefficients are essential for solving many exam problems.
对于实系数三次方程，要么三个根都是实数，要么一个根是实数而另外两个根构成共轭复数对。根与系数之间的关系对于解决许多考试问题至关重要。
For the cubic equation az³ + bz² + cz + d = 0 with roots α, β, γ:
对于三次方程 az³ + bz² + cz + d = 0，设根为 α、β、γ：
α + β + γ = −b/a
αβ + βγ + γα = c/a
αβγ = −d/a
For a quartic equation az⁴ + bz³ + cz² + dz + e = 0 with roots α, β, γ, δ:
对于四次方程 az⁴ + bz³ + cz² + dz + e = 0，设根为 α、β、γ、δ：
α + β + γ + δ = −b/a, αβγδ = e/a
If you are told that one root is 2 + i, you immediately know 2 − i is also a root. You can then divide the original polynomial by the quadratic factor (x − (2 + i))(x − (2 − i)) = x² − 4x + 5 to find the remaining roots.
如果题目告诉你一个根是 2 + i，你立即知道 2 − i 也是根。然后你可以用原始多项式除以二次因式 (x − (2 + i))(x − (2 − i)) = x² − 4x + 5 来求其余根。
6. Summation of Series | 级数求和
FP1 introduces standard summation formulae that you must know and be able to apply fluently.
FP1 引入了你必须熟练掌握的标准求和公式。
Σ r = n(n + 1)/2
Σ r² = n(n + 1)(2n + 1)/6
Σ r³ = [n(n + 1)/2]²
These formulae sum from r = 1 to r = n. Using them, you can evaluate sums of expressions such as Σ (3r² − 2r + 1):
这些公式从 r = 1 求和到 r = n。利用它们，你可以求诸如 Σ (3r² − 2r + 1) 这样的表达式的和：
Σ (3r² − 2r + 1) = 3Σr² − 2Σr + Σ1 = 3·n(n+1)(2n+1)/6 − 2·n(n+1)/2 + n
Simplify this carefully to obtain a single polynomial expression in n. Always test your final answer for small values of n, such as n = 1, to verify your working.
仔细化简上述表达式，得到关于 n 的单一多项式。务必用较小的 n 值（如 n = 1）检验最终答案，以验证你的计算过程。
7. Method of Differences | 差分法
The method of differences is a technique for summing series whose general term can be written as a difference of consecutive terms of a related sequence.
差分法是一种对通项可以写成相关序列相邻项之差的级数进行求和的技术。
For example, consider Σ (1/(r(r+1))) from r = 1 to n. We use partial fractions:
例如，考虑从 r = 1 到 n 的 Σ (1/(r(r+1)))。我们使用部分分式：
1/(r(r+1)) = 1/r − 1/(r+1)
Then the sum becomes (1/1 − 1/2) + (1/2 − 1/3) + (1/3 − 1/4) + … + (1/n − 1/(n+1)). All intermediate terms cancel, leaving:
然后该和变为 (1/1 − 1/2) + (1/2 − 1/3) + (1/3 − 1/4) + … + (1/n − 1/(n+1))。所有中间项都相消，余下：
1 − 1/(n+1) = n/(n+1)
Notice how the method of differences is particularly effective for telescoping series. Exam questions often combine partial fractions with the method of differences, so practise identifying suitable decompositions.
请注意，差分法对望远镜级数特别有效。考试题目经常将部分分式与差分法结合，因此要练习识别合适的分拆方式。
8. Matrices: Operations and Determinants | 矩阵：运算与行列式
A matrix is a rectangular array of numbers. In FP1, we focus on 2×2 and 3×3 square matrices. The determinant of a 2×2 matrix is a scalar value that determines whether the matrix has an inverse.
矩阵是一个矩形的数字阵列。在 FP1 中，我们专注于 2×2 和 3×3 方阵。2×2 矩阵的行列式是一个标量值，它决定了矩阵是否有逆矩阵。
For a 2×2 matrix A = [[a, b], [c, d]]:
对于 2×2 矩阵 A = [[a, b], [c, d]]：
det(A) = ad − bc
The inverse of a 2×2 matrix exists if and only if det(A) ≠ 0, and is given by:
2×2 矩阵的逆矩阵存在当且仅当 det(A) ≠ 0，且由下式给出：
A⁻¹ = (1/(ad − bc)) [[d, −b], [−c, a]]
For matrix multiplication, the order matters: AB ≠ BA in general. The identity matrix I acts as the multiplicative identity: AI = IA = A. The inverse satisfies AA⁻¹ = A⁻¹A = I.
矩阵乘法中顺序很重要：一般地 AB ≠ BA。单位矩阵 I 起乘法恒等元的作用：AI = IA = A。逆矩阵满足 AA⁻¹ = A⁻¹A = I。
9. Matrix Transformations | 矩阵变换
Matrices can represent geometric transformations in the plane. A 2×2 matrix M maps the point (x, y) to (x', y') via:
矩阵可以表示平面上的几何变换。一个 2×2 矩阵 M 将点 (x, y) 映射到 (x', y')，其方式为：
[x'] = M [x], i.e. [x'; y'] = [[a, b], [c, d]] [x; y]
Standard transformation matrices you must memorise:
你必须记住的标准变换矩阵：
Reflection in x-axis: [[1, 0], [0, −1]] | 关于 x 轴的反射：[[1, 0], [0, −1]]
Reflection in y-axis: [[−1, 0], [0, 1]] | 关于 y 轴的反射：[[−1, 0], [0, 1]]
Reflection in y = x: [[0, 1], [1, 0]] | 关于 y = x 的反射：[[0, 1], [1, 0]]
Rotation clockwise through angle θ about origin: [[cos θ, sin θ], [−sin θ, cos θ]] | 绕原点顺时针旋转角 θ：[[cos θ, sin θ], [−sin θ, cos θ]]
Rotation anticlockwise through angle θ: [[cos θ, −sin θ], [sin θ, cos θ]] | 绕原点逆时针旋转角 θ：[[cos θ, −sin θ], [sin θ, cos θ]]
Enlargement scale factor k: [[k, 0], [0, k]] | 缩放因子 k：[[k, 0], [0, k]]
When applying successive transformations, remember that the matrix closest to the vector is applied first. A transformation T₁ followed by T₂ is represented by the product T₂T₁.
当依次应用多个变换时，请记住离向量最近的矩阵最先应用。先 T₁ 后 T₂ 的变换由乘积 T₂T₁ 表示。
10. Proof by Induction | 数学归纳法
Proof by induction is a rigorous method for proving statements that are claimed to be true for all positive integers n. The method has three essential steps.
数学归纳法是一种严格的证明方法，用于证明声称对所有正整数 n 都成立的命题。该方法包含三个基本步骤。
Step 1 (Base case): Show the statement is true for the smallest integer in question, usually n = 1.
步骤 1（基础情形）：证明命题对所考虑的最小整数成立，通常为 n = 1。
Step 2 (Inductive assumption): Assume the statement is true for n = k, where k is some positive integer.
步骤 2（归纳假设）：假设命题对 n = k 成立，其中 k 是某个正整数。
Step 3 (Inductive step): Using this assumption, prove the statement is true for n = k + 1.
步骤 3（归纳步骤）：利用该假设，证明命题对 n = k + 1 成立。
Once you have completed all three steps, you conclude that the statement is true for all positive integers n by the principle of mathematical induction.
完成上述三个步骤后，由数学归纳法原理即可得出结论：该命题对所有正整数 n 成立。
Proof by induction can be applied to summations, divisibility, matrices, and inequalities. For divisibility proofs, show that if the expression is divisible by a given number for n = k, then it is also divisible for n = k + 1, by writing the (k + 1)-case in terms of the k-case.
数学归纳法可以应用于求和、整除性、矩阵和不等式。对于整除性证明，你需要证明如果表达式在 n = k 时能被给定数整除，那么在 n = k + 1 时也能被整除，方法是把 (k + 1) 情况写成 k 情况的形式。
11. Solving Inequalities | 求解不等式
FP1 requires you to solve inequalities involving rational expressions, such as (x − 1)/(x + 2) > 3. The safest method is to multiply through by the square of the denominator, which is always positive.
FP1 要求你求解涉及有理表达式的不等式，例如 (x − 1)/(x + 2) > 3。最安全的方法是在不等式两边乘以分母的平方，因为它始终为正。
Example: solve (x − 1)/(x + 2) > 3.
示例：求解 (x − 1)/(x + 2) > 3。
(x − 1)(x + 2)² / (x + 2) > 3(x + 2)²
Since (x + 2)² > 0 for all x ≠ −2, multiplication preserves the inequality direction. This simplifies to (x − 1)(x + 2) > 3(x + 2)². Expanding and rearranging yields a quadratic inequality:
由于对所有 x ≠ −2 都有 (x + 2)² > 0，乘法保持不等号方向不变。这化简为 (x − 1)(x + 2) > 3(x + 2)²。展开并整理得到一个二次不等式：
x² + x − 2 > 3x² + 12x + 12 ⇒ 0 > 2x² + 11x + 14
Factorise: 2x² + 11x + 14 = (2x + 7)(x + 2). So (2x + 7)(x + 2) < 0, giving the critical values x = −7/2 and x = −2. Testing intervals yields the final solution: −7/2 < x < −2.
因式分解：2x² + 11x + 14 = (2x + 7)(x + 2)。因此 (2x + 7)(x + 2) < 0，得到临界值 x = −7/2 和 x = −2。对各区间进行检验，得到最终解：−7/2 < x < −2。
12. Exam Strategy and Common Pitfalls | 考试策略与常见陷阱
In the FP1 examination, method marks are generous, but accuracy and structured working are essential. Here are key strategies to maximise your score.
在 FP1 考试中，方法分给得比较宽松，但准确性和规范的计算步骤至关重要。以下是帮你最大化得分的关键策略。
When finding the argument of a complex number, always draw a sketch of the Argand diagram to determine the correct quadrant. | 求复数辐角时，务必画出阿甘图草图以确定正确的象限。
When using de Moivre's theorem, check whether the angle should be measured in radians or degrees; examination papers usually specify 'radians'. | 使用棣莫弗定理时，检查角度应以弧度还是度数为单位；考试卷通常会注明"弧度"。
For matrix transformations, state clearly the order of multiplication when combining transformations; matrix multiplication is not commutative. | 对于矩阵变换，明确说明组合变换时的乘法顺序；矩阵乘法不满足交换律。
In proof by induction, never omit the base case — it is explicitly worth marks. | 在数学归纳法证明中，切勿遗漏基础情形——它明确占有分数。
When solving rational inequalities, remember to exclude values that make the denominator zero. | 求解有理不等式时，记住排除使分母为零的值。
Check your final answer by substituting a convenient value, such as n = 1 or n = 2, for summation formulae. | 通过代入一个方便的数值（如 n = 1 或 n = 2）来检验求和的最终答案。
Regular practice with past papers is the most effective way to build familiarity with the question styles and timing required for AQA AS FP1. Aim to reach a level where every problem type is recognisable at a glance.
定期练习往年真题是熟悉 AQA AS FP1 题型和考试时间分配的最有效方法。努力达到一眼就能识别每种题型的水准。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图