📚 PDF资源导航

A-Level Further Maths Unit 4 Jan 21: Key Concepts Explained | A-Level 进阶数学 单元4 2021年1月卷知识点精讲

📚 A-Level Further Maths Unit 4 Jan 21: Key Concepts Explained | A-Level 进阶数学 单元4 2021年1月卷知识点精讲

The January 2021 Unit 4 paper for A-Level Further Mathematics challenges students with a broad range of advanced pure topics, from complex numbers and matrices to differential equations and series expansions. This article breaks down the core knowledge tested in the paper, providing clear explanations and examples for each area, helping you revise effectively and build confidence for your exams.

2021年1月的A-Level进阶数学单元4试卷涵盖复数、矩阵、微分方程和级数展开等广泛的纯数进阶主题。本文拆解试卷考查的核心知识点,逐一给出清晰的讲解与示例,助你高效复习,从容应考。


1. Complex Numbers and De Moivre’s Theorem | 复数与棣莫弗定理

Complex numbers appear throughout Further Maths, and De Moivre’s theorem is essential for simplifying powers and roots. For a complex number in polar form z = r(cos θ + i sin θ), the theorem states zⁿ = rⁿ(cos nθ + i sin nθ) for any integer n.

复数贯穿进阶数学,棣莫弗定理是化简幂与方根的关键。对极坐标形式的复数 z = r(cos θ + i sin θ),定理指出对任意整数 n,zⁿ = rⁿ(cos nθ + i sin nθ)。

This allows rapid evaluation of expressions like (1 + i)¹⁰. Convert 1 + i to polar form: r = √2, θ = π/4. Then (√2)¹⁰(cos(10π/4) + i sin(10π/4)) = 2⁵(cos(5π/2) + i sin(5π/2)) = 32(0 + i) = 32i.

由此可快速计算 (1 + i)¹⁰:先将 1 + i 化为极形式,r = √2,θ = π/4,则 (√2)¹⁰(cos(10π/4) + i sin(10π/4)) = 2⁵(cos(5π/2) + i sin(5π/2)) = 32(0 + i) = 32i。

The theorem also extends to fractional indices to find nth roots. The n nth roots of a complex number w are given by zₖ = r^(1/n)[cos((θ+2πk)/n) + i sin((θ+2πk)/n)] for k = 0,1,…,n-1, forming a regular n-gon on the Argand diagram.

该定理还可推广至分数指数以求解 n 次方根。复数 w 的 n 个 n 次方根为 zₖ = r^(1/n)[cos((θ+2πk)/n) + i sin((θ+2πk)/n)],k = 0,1,…,n-1,在阿根图上构成正 n 边形。


2. Roots of Unity and Geometric Interpretations | 单位根与几何意义

The nth roots of unity are the solutions of zⁿ = 1, given by e^(2πik/n) for k = 0,1,…,n-1. They are symmetrically spaced on the unit circle, and their sum is always zero.

n 次单位根是方程 zⁿ = 1 的解,为 e^(2πik/n),k = 0,1,…,n-1。它们均匀分布在单位圆上,其和恒为零。

These roots help factorise polynomials. For instance, z⁵ – 1 = (z – 1)(z⁴ + z³ + z² + z + 1). The non-real roots satisfy the quartic, and by pairing conjugates we can express this product as (z² – 2z cos(2π/5) + 1)(z² – 2z cos(4π/5) + 1).

单位根可辅助因式分解。例如 z⁵ – 1 = (z – 1)(z⁴ + z³ + z² + z + 1),非实根满足四次式,结合共轭可写成 (z² – 2z cos(2π/5) + 1)(z² – 2z cos(4π/5) + 1)。

Geometric problems often ask for the smallest positive angle between roots or the area of the polygon formed by the roots. Knowing the symmetry reduces calculation significantly.

几何题常求根的最小正夹角或根所构成多边形的面积,利用对称性可大量简化计算。


3. Loci in the Complex Plane | 复平面上的轨迹

Loci in the Argand diagram are described by conditions on z, such as |z – (a + bi)| = r (a circle with centre a + bi and radius r), or |z – z₁| = |z – z₂| (the perpendicular bisector of the segment joining z₁ and z₂).

阿根图中的轨迹由关于 z 的条件描述,如 |z – (a + bi)| = r 表示以 a + bi 为圆心、半径为 r 的圆;|z – z₁| = |z – z₂| 表示连接 z₁ 与 z₂ 线段的中垂线。

The argument condition arg(z – z₀) = α gives a half-line from z₀, excluding the point itself. Combined loci often test the ability to find intersections by solving simultaneous equations in x and y.

辐角条件 arg(z – z₀) = α 给出从 z₀ 出发的一条射线,不含端点。复合轨迹常需通过求解 x 与 y 的联立方程组来求交点。

Example: the region satisfying |z – 3| ≤ 2 and 0 ≤ arg(z) ≤ π/4 is a circular sector. Sketching helps visualise such regions.

例如,满足 |z – 3| ≤ 2 且 0 ≤ arg(z) ≤ π/4 的区域是一个扇形区域,绘图有助于直观理解。


4. Matrix Transformations and Invariant Lines | 矩阵变换与不变线

A 2×2 matrix M represents a linear transformation in the plane. Invariant lines satisfy the condition that the image of any point on the line lies on the same line. This does not mean points are fixed, only that the line is mapped onto itself.

2×2 矩阵 M 代表平面上的线性变换。不变线满足线上任一点的像仍在该线上。这并不意味着点是固定的,仅表示该线被映射到自身。

To find invariant lines passing through the origin, set M(x, y) = λ(x, y), which is an eigenvalue problem. For lines not through the origin, solve M(x, y) = (x’, y’) and require (y’/x’) = m for some gradient m, yielding a quadratic in m.

求过原点的不变线时,设 M(x, y) = λ(x, y),这是一个特征值问题。对不经过原点的不变线,解 M(x, y) = (x’, y’) 并令 y’/x’ = m(某斜率),导出关于 m 的二次方程。

Typical exam questions ask for lines of invariant points (solutions of Mx = x) and invariant lines. Distinguishing these two concepts is crucial.

典型考题要求找出不变点所在的直线(满足 Mx = x)与不变线,区分这两者至关重要。


5. Eigenvalues and Diagonalization | 特征值与对角化

For a square matrix A, eigenvalues λ satisfy det(A – λI) = 0. The corresponding eigenvectors v solve (A – λI)v = 0. Diagonalization is possible when A has n linearly independent eigenvectors.

对于方阵 A,特征值 λ 满足 det(A – λI) = 0,对应的特征向量 v 满足 (A – λI)v = 0。当 A 有 n 个线性无关的特征向量时,可对角化。

If P is the matrix whose columns are eigenvectors, then P⁻¹AP = D, where D is a diagonal matrix of eigenvalues. This greatly simplifies computing powers of A: Aᵏ = PDᵏP⁻¹.

若 P 以特征向量为列,则 P⁻¹AP = D,D 是由特征值构成的对角矩阵。这能极大简化 A 的幂运算:Aᵏ = PDᵏP⁻¹。

This technique appears in solving systems of linear recurrence relations. For example, if uₙ₊₁ = A uₙ, then uₙ = Aⁿu₀, and diagonalizing A yields a closed-form solution.

该技巧用于解线性递推方程组。例如,若 uₙ₊₁ = A uₙ,则 uₙ = Aⁿu₀,对 A 对角化即得通解。


6. Series Expansions: Maclaurin and Taylor Series | 级数展开:麦克劳林与泰勒级数

The Maclaurin series of f(x) is f(x) = f(0) + f'(0)x + f”(0)x²/2! + f”'(0)x³/3! + … . It is a Taylor series centred at zero. Standard expansions for eˣ, sin x, cos x, and ln(1+x) must be memorised.

麦克劳林级数是指 f(x) = f(0) + f'(0)x + f”(0)x²/2! + f”'(0)x³/3! + …,即中心在 0 处的泰勒级数。必须熟记 eˣ、sin x、cos x、ln(1+x) 的标准展开式。

The Taylor series generalises this to any centre a: f(x) = f(a) + f'(a)(x-a) + f”(a)(x-a)²/2! + … . These are used to approximate functions locally and to evaluate limits.

泰勒级数推广至任意中心 a:f(x) = f(a) + f'(a)(x-a) + f”(a)(x-a)²/2! + …,用于局部逼近函数与计算极限。

You can also derive series for composite functions, like e^(sin x), by substituting one series into another. Care with the radius of convergence ensures validity.

也可通过将一个级数代入另一个级数求得复合函数的展开式,如 e^(sin x),同时需注意收敛半径以确保有效性。


7. First-Order Differential Equations | 一阶微分方程

Separable equations of the form dy/dx = f(x)g(y) are solved by separating variables: ∫(1/g(y)) dy = ∫f(x) dx. Always include the constant of integration and use initial conditions to find particular solutions.

形如 dy/dx = f(x)g(y) 的可分离变量方程通过分离变量求解:∫(1/g(y)) dy = ∫f(x) dx。务必加上积分常数,并利用初始条件求特解。

Integrating factor method tackles linear equations dy/dx + P(x)y = Q(x). Multiply by the factor e^(∫P(x) dx), then the left side becomes the derivative of y × integrating factor.

积分因子法处理线性方程 dy/dx + P(x)y = Q(x)。乘上积分因子 e^(∫P(x) dx),左端即变为 y 乘积分因子的导数。

Example: dy/dx + 2xy = x. Here P(x) = 2x, so I.F. = e^(x²). Hence d/dx(ye^(x²)) = x e^(x²). Integrate both sides to obtain ye^(x²) = ½e^(x²) + C, giving y = ½ + Ce^(-x²).

示例:dy/dx + 2xy = x。此时 P(x) = 2x,积分因子 I.F. = e^(x²),于是 d/dx(ye^(x²)) = x e^(x²)。两边积分得 ye^(x²) = ½e^(x²) + C,得 y = ½ + Ce^(-x²)。


8. Second-Order Linear Differential Equations | 二阶线性微分方程

The homogeneous equation a d²y/dx² + b dy/dx + c y = 0 is solved using the auxiliary equation ar² + br + c = 0. Real distinct roots r₁, r₂ give y = Ae^(r₁x) + Be^(r₂x); repeated root r gives y = (A + Bx)e^(rx); complex roots α ± iβ give y = e^(αx)(A cos βx + B sin βx).

齐次方程 a d²y/dx² + b dy/dx + c y = 0 用辅助方程 ar² + br + c = 0 求解。两不等实根 r₁, r₂ 给出 y = Ae^(r₁x) + Be^(r₂x);重根 r 给出 y = (A + Bx)e^(rx);共轭复根 α ± iβ 给出 y = e^(αx)(A cos βx + B sin βx)。

For the non-homogeneous case a d²y/dx² + b dy/dx + c y = f(x), find the complementary function (CF) from the homogeneous equation and a particular integral (PI) by trial function. Standard trial functions: for f(x) = e^(kx) try PI = λe^(kx); for polynomial try general polynomial of same degree; for trigonometric try λ cos ωx + μ sin ωx.

对于非齐次情形 a d²y/dx² + b dy/dx + c y = f(x),先由齐次方程求补函数(CF),再用试函数法求特解(PI)。标准试函数:f(x) = e^(kx) 试 PI = λe^(kx);多项式则试同次一般多项式;三角函数试 λ cos ωx + μ sin ωx。

If f(x) overlaps with CF, multiply the trial function by x (or x²) until it no longer coincides. The general solution is y = CF + PI.

若 f(x) 与 CF 重叠,将试函数乘以 x(或 x²)直至不再重叠。通解为 y = CF + PI。


9. Hyperbolic Functions | 双曲函数

Hyperbolic functions are defined as sinh x = (eˣ – e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, and tanh x = sinh x / cosh x. They satisfy identities similar to trigonometric ones, notably cosh²x – sinh²x = 1.

双曲函数定义为 sinh x = (eˣ – e⁻ˣ)/2,cosh x = (eˣ + e⁻ˣ)/2,tanh x = sinh x / cosh x。它们满足与三角恒等式类似的公式,尤其是 cosh²x – sinh²x = 1。

Derivatives: d/dx(sinh x) = cosh x, d/dx(cosh x) = sinh x. Osborn’s rule helps convert trigonometric identities to hyperbolic ones: replace cos → cosh, sin → i sinh, and flip sign of any product of two sins.

导数:d/dx(sinh x) = cosh x,d/dx(cosh x) = sinh x。奥斯本规则可将三角恒等式转化为双曲形式:cos 变为 cosh,sin 变为 i sinh,并翻转含两个 sin 乘积的符号。

Inverse hyperbolic functions, arsinh x = ln(x + √(x²+1)), arcosh x = ln(x + √(x²-1)), artanh x = ½ ln((1+x)/(1-x)), are tested in integration and solving equations.

反双曲函数 arsinh x = ln(x + √(x²+1)),arcosh x = ln(x + √(x²-1)),artanh x = ½ ln((1+x)/(1-x)),常用于积分与解方程。


10. Polar Coordinates and Curve Sketching | 极坐标与曲线

Polar coordinates (r, θ) locate points by distance from the pole and angle from the initial line. A curve is defined by r = f(θ). The area enclosed by a polar curve from θ = α to θ = β is ½ ∫ r² dθ.

极坐标 (r, θ) 用极径与极角定位点。曲线由 r = f(θ) 定义。曲线在 θ = α 至 θ = β 范围内围成的面积为 ½ ∫ r² dθ。

Common curves include cardioids r = a(1 + cos θ), limacons, and roses r = a cos nθ or r = a sin nθ. Sketching involves finding symmetry, maximum r, and tangents at the pole where r = 0.

常见曲线有心形线 r = a(1 + cos θ)、蚶线和玫瑰线 r = a cos nθ 或 r = a sin nθ。画图时需找对称性、最大 r 以及极点的切线(r = 0 处)。

Finding intersections between two polar curves requires solving f(θ) = g(θ), but also checking if the pole lies on both curves. Sometimes extra intersections appear by considering negative r or equivalent angles.

求两曲线的交点需解 f(θ) = g(θ),同时检查极点是否同时位于两曲线上。有时需考虑负 r 或等值角以找出隐蔽交点。


11. Proof by Induction for Series and Divisibility | 数学归纳法在级数与整除性中的应用

Proof by induction verifies a statement for all positive integers n. The base case (usually n=1) must be shown true. The inductive step assumes true for n = k and proves for n = k+1.

数学归纳法用于证明对所有正整数 n 成立的命题。需验证基础情形(通常 n=1),再假设 n = k 成立,推证 n = k+1 成立。

Common induction problems include summation formulae, e.g., proving Σᵣ₌₁ⁿ r² = n(n+1)(2n+1)/6, and divisibility, e.g., proving 3²ⁿ – 1 is divisible by 8. For the latter, write 3²⁽ᵏ⁺¹⁾ – 1 = 9·3²ᵏ – 1 = 9(3²ᵏ – 1) + 8 and use the inductive hypothesis.

常见归纳题包括求和公式,如证 Σᵣ₌₁ⁿ r² = n(n+1)(2n+1)/6,以及整除性,如证 3²ⁿ – 1 能被 8 整除。对于后者,写成 3²⁽ᵏ⁺¹⁾ – 1 = 9·3²ᵏ – 1 = 9(3²ᵏ – 1) + 8 并利用归纳假设。

Matrix multiplication induction may prove expressions like Mⁿ for specific matrix M. For Fibonacci-type sequences, induction is the standard rigorous method.

矩阵乘幂的归纳可证明特定矩阵 Mⁿ 的表达式。对斐波那契型数列,归纳法是标准的严谨方法。


12. Summation of Series Using Standard Results | 使用标准结果求和级数

Standard summations Σᵣ₌₁ⁿ r = n(n+1)/2, Σ r² = n(n+1)(2n+1)/6, Σ r³ = [n(n+1)/2]² are used to sum polynomial series quickly. Any polynomial function of r can be broken into these forms.

标准求和式 Σᵣ₌₁ⁿ r = n(n+1)/2,Σ r² = n(n+1)(2n+1)/6,Σ r³ = [n(n+1)/2]² 可用于快速求多项式级数和。任何关于 r 的多项式函数均可拆成这些形式。

For example, Σ (2r – 1)² = Σ(4r² – 4r + 1) = 4Σr² – 4Σr + Σ1, then substitute the standard formulae. Manipulating constants and indices is key.

例如 Σ (2r – 1)² = Σ(4r² – 4r + 1) = 4Σr² – 4Σr + Σ1,然后代入标准公式。处理常数与指标是关键。

Telescoping sums also appear, where terms cancel out leaving only the first and last terms. Recognising partial fractions is often the starting point.

裂项相消和也常出现,各项相互抵消仅剩首尾。识别部分分式往往是突破口。

The method of differences for sequences like 1/(r(r+1)) = 1/r – 1/(r+1) provides an exact sum in closed form, essential for deriving formulas or evaluating convergence.

差分法用于形如 1/(r(r+1)) = 1/r – 1/(r+1) 的数列,可得闭式的精确和,是推导公式或判断收敛性的重要工具。

Published by TutorHao | Further Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022(同微信)

Comments

屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导,国外大学本科硕士研究生博士课程论文辅导

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Discover more from aleveler.com

Subscribe now to keep reading and get access to the full archive.

Continue reading

Exit mobile version