📚 9665-FM03 International A-Level Further Mathematics: Key Points Explained | 9665-FM03国际A-Level进阶数学知识点精讲
This article provides a focused breakdown of the essential topics covered in the 9665-FM03 specimen paper for the International A-Level Further Mathematics qualification. It is designed to help students consolidate their understanding of advanced pure mathematics concepts, from complex numbers and hyperbolic functions to differential equations and matrix algebra. Each section pairs key theoretical points with practical exam-style insights, ensuring you are well-prepared for the types of questions that frequently appear.
本文针对国际A-Level进阶数学9665-FM03样本试卷中的核心知识点进行精炼讲解，旨在帮助同学们巩固高级纯数学概念，包括复数、双曲函数、微分方程、矩阵代数等。每个小节将关键理论点与实用解题洞察相结合，确保你为频繁出现的考试题型做好充分准备。
1. Complex Numbers and De Moivre's Theorem | 复数与棣莫弗定理
De Moivre' i sin nθ). This is fundamental for raising complex numbers to integer powers and for extracting roots.
棣莫弗定理指出，对于任何实数n，有 (r(cos θ + i sin θ))ⁿ = rⁿ (cos nθ + i sin nθ)。这是将复数进行整数次幂运算和求复数根的基础。
To find the nth roots of a complex number z = r(cos θ + i sin θ), use the formula z1/n = r1/n ((θ + 2kπ)/n)], for k = 0, 1, ..., n-1. The roots are equally spaced on an Argand diagram.
求复数 z = r(cos θ + i sin θ) 的 n 次方根，使用公式 z1/n = r1/n [cos((θ + 2kπ)/n) + i sin((θ + 2kπ)/n)]，其中 k = 0, 1, ..., n-1。这些根在阿冈图上等距分布。
Using De Moivre' os θ can be derived by expanding (cos θ + i sin θ)³ and equating real and imaginary parts.
利用棣莫弗定理，可以通过展开 (cos θ + i sin θ)³ 并令实部和虚部分别相等，推导出恒等式 sin 3θ = 3 sin θ - 4 sin³θ 和 cos 3θ = 4 cos³θ - 3 cos θ。
2. Hyperbolic Functions | 双曲函数
The hyperbolic functions are defined by sinh x = (eˣ - e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ hey are analogous to trigonometric functions but relate to hyperbolas rather than circles.
双曲函数定义为 sinh x = (eˣ - e⁻ˣ)/2，cosh x = (eˣ + e⁻ˣ)/2，tanh x = sinh x / cosh x。它们类似于三角函数，但与双曲线相关而非圆。
x - 1 = 2 sinh² x + 1. These parallel trigonometric identities but with sign differences.
关键恒等式包括 cosh² x - sinh² x = 1，sinh 2x = 2 sinh x cosh x，以及 cosh 2x = cosh² x + sinh² x = 2 cosh² x - 1 = 2 sinh² x + 1。它们与三角恒等式对应，但符号有所不同。
tegration results are straightforward: ∫ sinh x dx = cosh x + C, ∫ cosh x dx = sinh x + C.
双曲函数的微分：d/dx (sinh x) = cosh x，d/dx (cosh x) = sinh x，d/dx (tanh x) = sech² x。积分结果直接：∫ sinh x dx = cosh x + C，∫ cosh x dx = sinh x + C。
3. Inverse Hyperbolic Functions and Logarithmic Forms | 反双曲函数及其对数形式
se hyperbolic functions can be expressed in terms of natural logarithms: arsinh x = ln(x + √x² + 1), arcosh x = ln(x + √x² - 1) for x ≥ 1, and artanh x = (1/2) ln((1 + x)/(1 - x)) for |x| < 1.
反双曲函数可用自然对数表示：arsinh x = ln(x + √x² + 1)，arcosh x = ln(x + √x² - 1)（x ≥ 1），artanh x = (1/2) ln((1 + x)/(1 - x))（|x| < 1）。
rforming certain integrations. Differentiating these functions yields d/dx (arsinh x) = 1/√x² + 1, d/dx (arcosh x) = 1/√x² - 1, and d/dx (artanh x) = 1/(1 - x²).
这些对数形式对于解含反双曲函数的方程和执行特定积分至关重要。对这些函数求导得 d/dx (arsinh x) = 1/√x² + 1，d/dx (arcosh x) = 1/√x² - 1，d/dx (artanh x) = 1/(1 - x²)。
or implicit differentiation approach, often starting from y = arsinh x so that sinh y = x.
考试中常见的任务是证明这些导数，通常使用参数化或隐函数求导法，例如设 y = arsinh x，使得 sinh y = x。
4. Matrices: Eigenvalues and Eigenvectors | 矩阵：特征值与特征向量
envalue. The eigenvalues are found by solving the characteristic equation det(A - λI) = 0.
对于方阵 A，特征向量 v 满足 Av = λv，其中 λ 为对应的特征值。通过求解特征方程 det(A - λI) = 0 可得特征值。
neous system. The eigenvectors are not unique; any non-zero scalar multiple is also an eigenvector.
然后，将每个特征值代回 (A - λI)v = 0 并求解齐次方程组来确定特征向量。特征向量不唯一；任何非零标量倍数也是特征向量。
, where D is a diagonal matrix of eigenvalues and P has eigenvectors as columns. This greatly simplifies computing powers of A.
对角化：如果一个矩阵有一组完整的线性无关特征向量，则可写为 A = PDP⁻¹，其中 D 是由特征值构成的对角矩阵，P 的列为特征向量。这极大地简化了 A 的幂次计算。
5. First- and Second-Order Differential Equations | 一阶与二阶微分方程
al equations of the form dy/dx + P(x)y = Q(x) are solved using an integrating factor I = e∫ P dx. Multiply through by I to obtain d/dx (I y) = I Q, then integrate.
形如 dy/dx + P(x)y = Q(x) 的一阶线性微分方程使用积分因子 I = e∫ P dx 求解。将原方程乘以 I，得到 d/dx (I y) = I Q，然后积分。
e auxiliary equation am² + bm + c = 0. The form of CF depends on whether the roots are real and distinct, repeated, or complex.
具有常系数的二阶线性方程 a d²y/dx² + b dy/dx + c y = f(x) 需要从辅助方程 am² + bm + c = 0 求出余函数（CF）。CF 的形式取决于根是相异实根、重根还是复根。
For the particular integral (PI), choose a trial function based on f(x): polynomials require a general polynomial of the same degree; exponentials use C ekx; trigonometric inputs use C cos ωx + D sin ωx. Adjust the trial function if it overlaps with the CF.
对于特积分（PI），根据 f(x) 选择试探函数：多项式需要同次的一般多项式；指数函数用 C ekx；三角函数输入用 C cos ωx + D sin ωx。若试探函数与 CF 重叠，需做调整（如乘以 x）。
6. Polar Coordinates and Area/Arc Length | 极坐标与面积/弧长
initial line. Curves like r = a(1 + cos θ) (cardioid) and r = a cos 2θ (rose) are common.
在极坐标中，点由 (r, θ) 定义，其中 r 是到极点的距离，θ 是与极轴的夹角。常见曲线如 r = a(1 + cos θ)（心形线）和 r = a cos 2θ（玫瑰线）。
The area enclosed by a polar curve r = f(θ) from θ = α to β is given by (1/2) ∫α^β r² dθ. This formula derives from the sum of infinitesimal circular sectors.
极坐标曲线 r = f(θ) 在 θ = α 到 β 之间所围成的面积由 (1/2) ∫α^β r² dθ 给出。该公式源自无穷小扇形面积之和。
The arc length of a polar curve between α and β is L = ∫α evaluating the derivative of r with respect to θ and simplifying the integrand, often using trigonometric identities.
极坐标曲线在 α 与 β 之间的弧长为 L = ∫α^β √(r² + (dr/dθ)²) dθ。这需要计算 r 关于 θ 的导数并化简被积函数，经常用到三角恒等式。
7. Maclaurin and Taylor Series | 麦克劳林与泰勒级数
The Maclaurin series is a Taylor series expansion about x = 0: f(x) = f(0) + f'(0) x + f''(0) x²/2! + f'''(0) x³/3! + ... . Standard expansions include eˣ = Σ xⁿ/n!, sin x = Σ (-1)ⁿ x²ⁿ⁺¹/(2n+1)!, and ln(1+x) = Σ (-1)ⁿ⁺¹ xⁿ/n.
麦克劳林级数是关于 x = 0 的泰勒展开：f(x) = f(0) + f'(0) x + f''(0) x²/2! + f'''(0) x³/3! + ...。标准展开包括 eˣ = Σ xⁿ/n!、sin x = Σ (-1)ⁿ x²ⁿ⁺¹/(2n+1)! 以及 ln(1+x) = Σ (-1)ⁿ⁺¹ xⁿ/n。
A Taylor series centred at x = a is f(x) = f(a) + f'(a) (x-a) + f''(a) (x-a)²/2! mating function values near a and for solving differential equations by the series method.
以 x = a 为中心的泰勒级数为 f(x) = f(a) + f'(a) (x-a) + f''(a) (x-a)²/2! + ...。它在逼近 a 附近的函数值以及用级数法解微分方程时特别有用。
When asked to find the series expansion for a composite function, differentiate repeatedly using the product, quotient, or chain rules, evaluate at the centre, and then assemble the terms.
当求复合函数的级数展开时，需反复使用乘积、商或链式法则求导，在中心点求值，然后组合各项。
8. Further Vectors: Lines, Planes and Distances | 进阶向量：直线、平面与距离
ctor. For two points A and B, the line through them can be written as r = OA + λ(OB - OA).
三维空间中直线的向量方程为 r = a + λb，其中 a 是直线上一点的位置向量，b 是方向向量。对于两点 A 和 B，过它们的直线可写为 r = OA + λ(OB - OA)。
ying in the plane, or in Cartesian form ax + by + cz = d. The normal vector n = (a, b, c).
平面可以表示为 r = a + λb + μc，其中 b 和 c 是位于平面内的不平行方向向量；或者用笛卡尔形式 ax + by + cz = d，法向量为 n = (a, b, c)。
To find the shortest distance from a point P to a line, use d = |(AP × b)| / |b|, where A is a point on the line. For distance from a point to a plane, use the formula |(ax₁ + by₁ + cz₁ - d)| / √a² + b² + c².
求点 P 到直线的最短距离，使用 d = |(AP × b)| / |b|，其中 A 为直线上一点。点到平面的距离公式为 |(ax₁ + by₁ + cz₁ - d)| / √a² + b² + c²。
9. Integration Techniques: Reduction Formulas | 积分技巧：递推公式
assic example is Iₙ = ∫ sinⁿ x dx, leading to Iₙ = -(1/n) sinⁿ⁻¹ x cos x + ((n-1)/n) Iₙ₋₂.
递推公式利用分部积分法将某个积分表示为具有较低指数的类似积分。典型例子 Iₙ = ∫ sinⁿ x dx 可导出 Iₙ = -(1/n) sinⁿ⁻¹ x cos x + ((n-1)/n) Iₙ₋₂。
To derive a reduction formula, choose u and dv strategically so that the new integral produced has a power reduced by 1 or 2. The base cases, like I₀ or I₁, are evaluated directly to complete the reduction process.
推导递推公式时，策略性地选取 u 和 dv，使新产生的积分幂次降低 1 或 2。基本情况如 I₀ 或 I₁ 可直接求值以完成递推。
formulas are heavily tested with trigonometric and logarithmic integrands, such as ∫ xⁿ eˣ dx or ∫ (ln x)ⁿ dx. Recognising the pattern saves time in exam calculations.
递推公式在含三角函数和对数的被积函数中频繁考查，如 ∫ xⁿ eˣ dx 或 ∫ (ln x)ⁿ dx。识别这种模式可以节省考试中的计算时间。
10. Numerical Methods for Differential Equations | 微分方程数值方法
Euler's method approximates the solution of a first-order ODE y' ion y(x₀) = y₀. The stepwise formula is yₙ₊₁ = yₙ + h f(xₙ, yₙ), where h is the step size.
欧拉方法逼近一阶常微分方程 y' = f(x, y) 及初始条件 y(x₀) = y₀ 的解。步进公式为 yₙ₊₁ = yₙ + h f(xₙ, yₙ)，其中 h 为步长。
The improved Euler method (Heun' ₙ + h f(xₙ, yₙ), then yₙ₊₁ = yₙ + (h/2)[f(xₙ, yₙ) + f(xₙ₊₁, yₚ)], giving greater accuracy.
改进欧拉法（休恩法）采用预测-校正方法：yₚ = yₙ + h f(xₙ, yₙ)，然后 yₙ₊₁ = yₙ + (h/2)[f(xₙ, yₙ) + f(xₙ₊₁, yₚ)]，可获得更高精度。
der equations can be handled by converting to a system of first-order ODEs. For example, y'' = g(x, y, y') becomes y' = z, z' = g(x, y, z), allowing step-by-step numerical estimation using coupled Euler iterations.
二阶方程可转化为一阶方程组来处理。例如，y'' = g(x, y, y') 变为 y' = z，z' = g(x, y, z)，从而利用耦合的欧拉迭代逐步进行数值估计。
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图