📚 Mastering IB HL Number and Algebra: Complex Numbers, Induction & Polynomials | 掌握 IB 高等数学数与代数：复数、归纳法与多项式
The IB Higher Level Number and Algebra topic extends far beyond the SL content, diving into complex numbers, De Moivre's theorem, polynomial root theorems, partial fractions with irreducible quadratics, and formal proof by induction. These HL-only concepts are essential for any student aiming for a top grade, as they form the backbone of many problem-solving questions and appear frequently in Paper 1 and Paper 2 exams.
IB 高等数学“数与代数”专题远远超出标准水平内容，深入到复数、棣莫弗定理、多项式根定理、含不可约二次式的部分分式以及正式的数学归纳法证明。这些 HL 专属概念是每位冲刺高分学生必须掌握的，它们构成了大量解题型问题的主干，并在试卷一和试卷二中频繁出现。
1. Complex Numbers: Cartesian and Polar Forms | 复数：代数形式与极坐标形式
A complex number is written in Cartesian form as z = a + bi, where a, b ∈ ℝ and i² = –1. The complex conjugate is z̄ = a – bi, obtained by reflecting the point across the real axis.
复数可用代数形式表示为 z = a + bi，其中 a, b 为实数且 i² = –1。复共轭为 z̄ = a – bi，可看作点关于实轴的对称。
The modulus r = |z| = √a² + b² quadrant). The polar form is z = r(cos θ + i sin θ), while the exponential form is z = r eiθ.
模 r = |z| = √a² + b² 表示到原点的距离，辐角 θ 满足 tan θ = b/a（需根据象限调整）。极坐标形式为 z = r(cos θ + i sin θ)，指数形式可写成 z = r eiθ。
z = r eiθ = r (cos θ + i sin θ)
2. Modulus, Argument and the Complex Conjugate | 模、辐角与共轭复数的性质
For any complex numbers z and w, the modulus satisfies |zw| = |z||w| and |z/w| = |z|/|w|. The argument obeys arg(zw) = arg z + arg w (modulo 2π).
对于任意复数 z 和 w，模满足 |zw| = |z||w| 及 |z/w| = |z|/|w|。辐角满足 arg(zw) = arg z + arg w（模 2π 意义下）。
The conjugate of a sum is the sum of conjugates: (z + w)¯ = z̄ + w̄. Importantly, z z̄ = a² + b² = |z| plex numbers by multiplying numerator and denominator by the conjugate of the denominator.
和的共轭等于共轭的和：(z + w)¯ = z̄ + w̄。尤为重要的是 z z̄ = a² + b² = |z|²，这为复数除法提供了便利：分子分母同乘以分母的共轭即可。
(a + bi) / (c + di) = (a + bi)(c – di) / (c² + d²)
3. De Moivre's Theorem and Trigonometric Identities | 棣莫弗定理与三角恒等式
De Moivre's theorem states that for any integer n, (cos θ + i sin θ)n = cos(nθ) + i sin(nθ). It can be proved by mathematical induction for n ∈ ℕ and then extended to negative integers using the conjugate property.
棣莫弗定理指出，对任意整数 n，(cos θ + i sin θ)n = cos(nθ) + i sin(nθ)。可通过数学归纳法对自然数 n 进行证明，再利用共轭性质推广到负整数。
)³ using the binomial theorem and equating real and imaginary parts yields cos 3θ = 4cos³θ – 3cos θ and sin 3θ = 3sin θ – 4sin³θ.
该定理是推导三角恒等式的利器。例如，用二项式定理展开 (cos θ + i sin θ)³，比较实部和虚部，即可得到 cos 3θ = 4cos³θ – 3cos θ 与 sin 3θ = 3sin θ – 4sin³θ。
4. Roots of Complex Numbers and the n-th Roots of Unity | 复数的 n 次方根与单位根
To find the n-th roots of a complex number z = r eiθ, we solve wⁿ = z. The n distinct roots are given by wk = r1/n e^(i(θ + 2kπ)/n) for k = 0, 1, ..., n – 1. These roots are equally spaced on a circle of radius r1/n in the complex plane.
为求复数 z = r eiθ 的 n 次方根，需解方程 wⁿ = z。n 个互异的根可表示为 wk = r1/n e^(i(θ + 2kπ)/n)，其中 k = 0, 1, …, n – 1。这些根均匀分布在复平面内半径为 r1/n 的圆上。
The special case z = 1 gives the n-th roots of unity: 1, ω, ω², …, ωⁿ⁻¹, where ω = e2πi/n. Their sum is always zero, and they form the vertices of a regular n-gon inscribed in the unit circle.
当 z = 1 时，得到 n 次单位根：1, ω, ω², …, ωⁿ⁻¹，其中 ω = e2πi/n。它们的和恒为零，且构成内接于单位圆的正 n 边形的顶点。
1 + ω + ω² + … + ωⁿ⁻¹ = 0
5. Polynomial Theorems: Remainder, Factor and Rational Root Theorem | 多项式定理：余数、因式与有理根定理
The Remainder Theorem states that when a polynomial P(x) is divided by (x – c), the remainder is P(c). The Factor Theorem follows directly: (x – c) is a factor of P(x) if and only if P(c) = 0.
余数定理指出，多项式 P(x) 除以 (x – c) 所得的余数为 P(c)。由此直接得到因式定理：(x – c) 是 P(x) 的因式当且仅当 P(c) = 0。
For polynomials with integer coefficients, the Rational Root Theorem gives a finite list of possible rational roots p/q, where p divides the constant term and q divides the leading coefficient. This greatly restricts trial-and-error factoring in HL problems.
对于整系数多项式，有理根定理给出了可能的有理根 p/q 的有限列表，其中 p 整除常数项，q 整除首项系数。这一下大大缩小了 HL 题目中试错因式分解的范围。
6. Sum and Product of Roots (Vieta's Formulas) | 根的和与积（韦达定理）
For a quadratic ax² + bx + c = 0 with roots α and β, Vieta's formulas give α + β = –a and αβ = c/a. For a cubic ax³ + bx² + cx + d = 0 with roots α, β, γ, we have α + β + γ = –b/a, αβ + βγ + γα = c/a, and αβγ = –d/a.
对于二次方程 ax² + bx + c = 0 及其根 α, β，韦达定理给出 α + β = –b/a 与 αβ = c/a。对于三次方程 ax³ + bx² + cx + d = 0 及其根 α, β, γ，则有 α + β + γ = –b/a，αβ + βγ + γα = c/a，αβγ = –d/a。
These relationships hold for complex roots as well as real roots. HL problems often ask you to find a new polynomial whose roots are related to the original ones (e.g., α², 1/α, α + 2) without solving for the roots explicitly.
这些关系对实根和复根均成立。HL 考题常常要求不直接求出根，而是根据原根的关系构造一个新多项式（例如根为 α², 1/α, α + 2）。
7. Complex Roots of Real Polynomials | 实系数多项式的复数根
lex roots occur in conjugate pairs. That is, if z = a + bi is a root, then its conjugate a – can always be factored into real linear and irreducible quadratic factors over the reals.
若多项式具有实系数，则任何非实的复数根均成共轭对出现。即如果 z = a + bi 是根，那么其共轭 a – bi 也是根。这意味着实数多项式总可以在实数范围内分解为实一次式与不可约二次式的乘积。
For example, given that 2 + i is a root of x³ – 5x² + 9x – 5 = 0, you can immediately identify 2 – i as another root and then find the third real root by Vieta's formulas or polynomial division.
例如，已知 2 + i 是 x³ – 5x² + 9x – 5 = 0 的一个根，可立即推知 2 – i 亦为根，再通过韦达定理或多项式除法求出第三个实数根。
8. Partial Fractions with Repeated and Irreducible Quadratic Factors | 含重复与不可约二次因式的部分分式
In HL, partial fraction decomposition extends beyond distinct linear factors to cases where the denominator contains repeated linear factors (x – a)ⁿ or irreducible quadratic factors (ax² + bx + c) that cannot be factorised over ℝ. For a quadratic factor, the numerator takes the form (Ax + B).
在高等水平课程中，部分分式分解不再局限于互异的一次因式，还要处理分母含重复一次因式 (x – a)ⁿ，或在实数范围不能分解的不可约二次因式 (ax² + bx + c)。对于二次因式，分子设为 (Ax + B) 的形式。
A typical HL decomposition looks like: (3x² + 5)/((x – 1)(x² + 2x + 2)) = A/(x – . You then solve for A, B, C by equating coefficients or substituting convenient x-values.
一个典型的 HL 型分解如：(3x² + 5)/((x – 1)(x² + 2x + 2)) = A/(x – 1) + (Bx + C)/(x² + 2x + 2)。然后可通过比较系数或代入便利的 x 值解出 A, B, C。
9. Introduction to Proof by Mathematical Induction | 数学归纳法证明入门
tement P(n) holds for all integers n ≥ k. The proof consists of three steps: (1) Base case – verify P(k) is true. (2) Induction hypothesis – assume P(n) is true for some arbitrary n ≥ k. (3) Induction step – prove P(n + 1) follows from the hypothesis.
数学归纳法是一种形式化的证明技术，用于确立命题 P(n) 对所有整数 n ≥ k 成立。证明包含三步：(1) 奠基情形——验证 P(k) 为真；(2) 归纳假设——假定对某个 n ≥ k，P(n) 为真；(3) 归纳递推——由假设证明 P(n + 1) 成立。
A classic first example is proving the sum of the first n positive integers: 1 + 2 + … , the sum for n + 1 becomes n(n + 1)/2 + (n + 1) = (n + 1)(n + 2)/2, completing the proof.
一个经典的首例是证明前 n 个正整数的和：1 + 2 + … + n = n(n + 1)/2。奠基情形 n = 1 成立。假设 n 时成立，则 n + 1 的和为 n(n + 1)/2 + (n + 1) = (n + 1)(n + 2)/2，证明完成。
10. Applications of Induction: Divisibility, Inequalities and Recurrence | 归纳法的应用：整除性、不等式与递推数列
Induction is heavily examined in HL with three common types: divisibility proofs, inequality proofs, and recurrence relations. For divisibility, a typical problem is to prove that 7ⁿ – 1 is divisible by 6 for all n ∈ ℕ. The induction step uses 7n+1 – 1 = 7·7ⁿ – 1 = 7(6k + 1) – 1 = 42k + 6 = 6(7k + 1).
HL 考试中归纳法常见三种类型：整除性证明、不等式证明和递推关系。对于整除性，典型题目如证明对所有自然数 n，7ⁿ – 1 被 6 整除。归纳步运用 7n+1 – 1 = 7·7ⁿ – 1 = 7(6k + 1) – 1 = 42k + 6 = 6(7k + 1)。
Inequality proofs, such as showing 2ⁿ > n² for n ≥ 5, require careful manipulation: from 2n+1 = 2·2ⁿ > 2n², you must then prove 2n² ≥ (n + 1)² for n ≥ 3 to complete the chain.
不等式证明，例如证明 n ≥ 5 时 2ⁿ > n²，需要进行精细的代数操作：由 2n+1 = 2·2ⁿ > 2n²，需再证 n ≥ 3 时 2n² ≥ (n + 1)² 以完成逻辑链。
Recurrence sequences defined by u_(n+1) = f(un) are also common; you may be asked to prove a closed form for un by induction using the given recurrence.
由递推定义 u_(n+1) = f(un) 的数列也很常见；题目常要求利用给定的递推关系，通过归纳法证明 un 的封闭形式。
u_(n+1) = 2u_n + 1, u₁ = 1 ⇒ un = 2ⁿ – 1
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图