📚 Complex Numbers for CCEA A-Level Maths: Key Exam Points | CCEA 数学：复数 考点精讲
Complex numbers form a core pillar of the CCEA A-Level Mathematics specification, extending the real number system to solve equations that have no real roots and to model two‑dimensional phenomena. This guide walks you through the essential concepts – from the Cartesian form a + bi to polar representation, De Moivre’s theorem, roots, loci and exponential form – with a sharp focus on the most common exam challenges. Whether you are aiming for a top grade or consolidating your understanding, these bilingual notes will help you build confidence and precision.
复数是 CCEA A-Level 数学课程的核心单元，它将实数系延拓到虚数领域，用于求解无实根的方程以及描述二维现象。本文梳理复数考点的全部重点：从代数形式 a + bi 到极坐标表示、棣莫弗定理、根的求解、轨迹以及指数形式，并针对高频易错点给出应试建议。无论你的目标是冲刺高分，还是巩固基础，这份中英双语考点精讲都能帮你提升准确度和应试信心。
1. Introduction to Complex Numbers | 复数简介
d i is the imaginary unit satisfying i² = −1. The set of all complex numbers is denoted by ℂ. The real part of z is Re(z) = a, and the imaginary part is Im(z) = b.
复数是形如 z = a + bi 的表达式，其中 a 和 b 是实数，i 是虚数单位，满足 i² = −1。全体复数的集合记作 ℂ。z 的实部 Re(z) = a，虚部 Im(z) = b。
lows us to solve any polynomial equation, such as x² + 1 = 0, whose solutions are x = ± i.
当 b = 0 时，复数为纯实数；当 a = 0 时，则为纯虚数。复数系的推广使得任何多项式方程均可解，例如 x² + 1 = 0 的解为 x = ± i。
2. Cartesian Form and Operations | 复数的代数形式与运算
rtesian (or rectangular) form z = a + bi, addition and subtraction are performed component‑ together with i² = −1: (a + bi)(c + di) = ac + adi + bci + bdi² = (ac − bd) + (ad + bc)i.
在代数标准形式 z = a + bi 下，加减法按分量进行：(a + bi) ± (c + di) = (a ± c) + (b ± d)i。乘法利用分配律并结合 i² = −1，即 (a + bi)(c + di) = ac + adi + bci + bdi² = (ac − bd) + (ad + bc)i。
Division requires the conjugate. To simplify (a + bi) ÷ (c + di), multiply numerator and denominator by the conjugate of the denominator: c + di = c − di. This gives a real denominator and separates the real and imaginary parts.
除法需要借助共轭复数。计算 (a + bi) ÷ (c + di) 时，分子分母同乘以分母的共轭 c − di，使分母化为实数，再拆分实部与虚部。
3. Conjugate and Modulus | 共轭与模
The complex conjugate of z = a + bi is z = a − bi. Geometrically, it represents a reflection in the real axis. The product zz = a² + b² is always a non‑negative real number, key to division and modulus calculations.
复数 z = a + bi 的共轭为 z = a − bi，几何上表示对实轴的反射。乘积 zz = a² + b² 是一个非负实数，在除法和模的计算中至关重要。
The modulus (or absolute value) of z is |z| = √a² + b² nce from the origin to the point (a, b) in the complex plane. For any two complex numbers, |zw| = |z||w| and |z / w| = |z| / |w| (w ≠ 0).
复数 z 的模（或绝对值）为 |z| = √a² + b²，表示复平面上点 (a, b) 到原点的距离。对于任意两个复数，有 |zw| = |z||w| 以及 |z / w| = |z| / |w|（w ≠ 0）。
4. Argument and Principal Argument | 辐角与主辐角
cipal argument, Arg(z), is usually taken in the interval (−π, π]. To find θ, use tan θ = b/a, but adjust the quadrant according to the signs of a and b.
复数 z 的辐角记作 arg(z)，是连接 z 与原点的射线与正实轴之间的夹角，以弧度为单位。主辐角 Arg(z) 通常限定在区间 (−π, π] 内。计算时利用 tan θ = b/a，但必须根据 a 和 b 的符号确定正确象限。
uadrant, so Arg(z) = −π/4, not π/4. Always sketch the Argand diagram to avoid sign errors.
例如 z = 1 − i，b/a = −1，点位于第四象限，因此 Arg(z) = −π/4 而非 π/4。建议始终画出阿尔冈图辅助判断，以避免符号错误。
5. Polar Form (Modulus-Argument Form) | 极坐标形式
Using r = |z| ghlights the geometric interpretation: r scales the point’s distance from the origin and θ gives its direction.
令 r = |z|，θ = arg(z)，则可写成极坐标形式 z = r(cos θ + i sin θ)。这一表示在乘除、乘方和开方运算中优势明显，并且突出了几何意义：r 决定点到原点的距离，θ 给出方向。
To convert from a + bi to polar form, compute r = √a² + b² and θ = Arg(a + bi). Remember that θ is not unique; adding 2πk (k ∈ ℤ nt. The principal argument is preferred unless the question requires the general argument.
将代数形式转化为极坐标形式时，计算 r = √a² + b² 和 θ = Arg(a + bi)。注意辐角并不唯一，增加 2πk（k 为整数）表示同一点。除非题目要求写出一般辐角，否则使用主辐角。
6. Multiplication and Division in Polar Form | 极坐标形式的乘除法
d. Division yields z₁/z₂ = (r₁/r₂)[cos(θ₁ − θ₂) + i sin(θ₁ − θ₂)], with moduli dividing and arguments subtracting.
若 z₁ = r₁(cos θ₁ + i sin θ₁)，z₂ = r₂(cos θ₂ + i sin θ₂)，则乘法规则为 z₁z₂ = r₁r₂[cos(θ₁ + θ₂) + i sin(θ₁ + θ₂)]：模相乘，辐角相加。除法规则为 z₁/z₂ = (r₁/r₂)[cos(θ₁ − θ₂) + i sin(θ₁ − θ₂)]：模相除，辐角相减。
These results follow directly from compound‑angle trigonometric identities and underpin De Moivre’s theorem. In exams, you are often asked to express a product or quotient in polar form and then convert back to Cartesian form.
以上结果可直接由三角恒等式推出，也是棣莫弗定理的基础。考试中常要求将积或商表示为极坐标形式，再转回代数形式。
7. De Moivre's Theorem | 棣莫弗定理
(nθ) + i sin(nθ)). This theorem is valid for all real n, but for rational exponents it must be used with care to obtain all possible roots.
对于任意整数 n，棣莫弗定理指出：(cos θ + i sin θ)ⁿ = cos(nθ) + i sin(nθ)。结合模长，若 z = r(cos θ + i sin θ)，则 zⁿ = rⁿ (cos(nθ) + i sin(nθ))。该定理对任意实数 n 都成立，但当指数为有理数时，必须小心使用以得到所有可能的根。
Typical exam applications include evaluating powers such as (1 + i√3)⁵, simplifying trigonometric multiple‑angle expressions, and deriving trigonometric identities like cos 3θ = 4 cos³ θ − 3 cos θ.
常见考试应用包括计算高次幂如 (1 + i√3)⁵、化简三角函数多倍角表达式以及推导三角恒等式，例如 cos 3θ = 4 cos³ θ − 3 cos θ。
8. Roots of Complex Numbers | 复数的根
number w, write w = r(cos θ + i sin θ) in polar form. The n distinct roots are given by zk = n√r [cos((θ + 2πk)/n) + i sin((θ + 2πk)/n)] for k = 0, 1, …, n−1. The principal root is usually the one with the smallest non‑negative argument.
要求复数 w 的 n 次方根，先将 w 写成极坐标形式 w = r(cos θ + i sin θ)。n 个不同的根为 zk = n√r [cos((θ + 2πk)/n) + i sin((θ + 2πk)/n)]，其中 k = 0, 1, …, n−1。主值根通常取辐角最小的非负值。
Geometrically, the nth roots lie on a circle of radius n√r centred at the origin, equally spaced by angle 2π/n. This symmetry is often exploited to sketch the roots or to deduce their sum, which is always zero.
几何上，n 个根均匀分布在以原点为圆心、半径为 n√r 的圆周上，彼此间隔角度 2π/n。这一对称性常用于快速画出根的位置，或推导所有根的总和——其结果恒为零。
9. Loci in the Argand Diagram | 阿尔冈图上的轨迹
ribe or sketch sets of points z that satisfy a given condition. The most common types are: |z − z₀| = r, a circle centre z₀ radius r; |z − z₁| = |z − z₂|, the perpendicular bisector of the segment joining z₁ and z₂; and arg(z − z₀) = α, a half‑line emanating from z₀ at angle α (excluding z₀).
轨迹问题要求描述或画出满足给定条件的点 z 的集合。最常见的类型包括：|z − z₀| = r，表示以 z₀ 为圆心、r 为半径的圆；|z − z₁| = |z − z₂|，表示连接 z₁ 与 z₂ 线段的垂直平分线；arg(z − z₀) = α，表示从 z₀ 出发、辐角为 α 的射线（不含 z₀）。
Combining loci is a favourite exam challenge: for instance, |z − 2| = |z − 2i| ique point. Always draw a clear, labelled sketch and justify your reasoning algebraically.
组合轨迹是考试热门题型，例如同时满足 |z − 2| = |z − 2i| 和 arg(z − 1) = π/4 的条件可确定唯一一点。答题时应画出清晰标注的草图，并用代数推导加以论证。
10. Solving Equations Involving Complex Numbers | 复数方程的求解
Equations may involve finding complex roots of polynomials with real coefficients, where non‑real roots occur in conjugate pairs. If 2 + i is a root, then 2 − i must also be a root. This property helps factorise cubic or quartic equations and find all solutions efficiently.
涉及复数求解的方程常包括求实系数多项式的复根。此时非实根总是成对共轭出现，即如果 2 + i 是一个根，则 2 − i 也必定是根。借助这一性质可以有效地分解三次或四次多项式，找出所有解。
Complex methods can also solve simultaneous equations with complex coefficients. Treat z and its conjugate as variables where needed; standard algebraic elimination techniques still apply, but you must carefully equate real and imaginary parts.
复数方法也可用于求解复系数的方程组。需要时可把 z 及其共轭当作变量处理，常规的代数消元法仍然适用，但必须仔细比较实部与虚部。
11. Exponential Form and Euler's Formula | 指数形式与欧拉公式
Euler’s formula eiθ = cos θ + i sin θ gives a compact exponential representation: z = r eiθ simplifies multiplication, division, powers and roots even further. For example, zⁿ = rⁿ einθ and the nth roots are n√r ei(θ + 2πk)/n.
欧拉公式 eiθ = cos θ + i sin θ 提供了极其简洁的指数表示：z = r eiθ。这一形式进一步简化乘除、乘方和开方运算，例如 zⁿ = rⁿ einθ，n 次根为 n√r ei(θ + 2πk)/n。
CCEA often expects you to convert between Cartesian, polar and exponential forms fluently. Be comfortable with relationships such as eiπ + 1 = 0 and e2πi = 1. Differentiation and integration of functions using eiθ also appear in more advanced questions.
CCEA 考试要求考生能在代数、极坐标和指数形式之间熟练转换。需熟悉 eiπ + 1 = 0 以及 e2πi = 1 等恒等关系。在高级题型中，还会出现利用 eiθ 对函数进行微分和积分的情况。
12. Common Exam Traps and Tips | 常见考点与解题技巧
t forget that the arctan function only returns values in (−π/2, π/2). Always correct for the correct quadrant using the signs of a and b, and give the principal argument in the required range.
注意辐角的象限陷阱：许多学生只算 tan θ = b/a，却忘记反正切函数仅返回 (−π/2, π/2) 内的值。务必根据 a 和 b 的符号修正象限，并按要求给出主辐角范围。
o find all n distinct roots. Missing roots is a common mistake; explicitly write k = 0, 1, …, n−1. Also, neat Argand diagrams earn method marks even if the algebra goes awry.
使用棣莫弗定理求分数次幂时，必须先在辐角中加上 2πk，再除以 n，才能得到全部 n 个不同的根。遗漏复根是丢分主因之一；务必明确写出 k = 0, 1, …, n−1。此外，整洁的阿尔冈图即使代数部分出错，也能获得方法分。
Finally, practise checking your answers: multiply roots back, substitute into equations, and verify conjugate‑pair properties for real‑coefficient polynomials. Systematic checking is particularly valuable in the exam to catch sign errors.
最后，养成验证习惯：将根乘回原式、代入方程检验，以及对实系数多项式核对共轭成对性质。系统的检查在考试中尤为珍贵，能有效揪出符号错误。
Published by TutorHao | CCEA A-Level Maths Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图