Year 13 CIE Further Math: Glossary & Memorization Guide | Year 13 CIE 进阶数学：词汇术语速记指南

📚 Year 13 CIE Further Math: Glossary & Memorization Guide | Year 13 CIE 进阶数学：词汇术语速记指南

Mastering the advanced terminology in CIE Year 13 Further Mathematics is essential for interpreting exam questions accurately and expressing solutions clearly. This guide walks you through core concepts across Pure Mathematics, Mechanics, and Statistics, pairing each technical term with a concise explanation and a memory anchor to help you internalise the vocabulary rapidly.

掌握 CIE 进阶数学 Year 13 的高级术语，是准确理解考题、清晰表达解题过程的关键。本指南带你梳理纯数学、力学和统计中的核心概念，为每个专业术语配上简洁释义和记忆锚点，帮助你在短时间内内化这些词汇。

1. Hyperbolic Functions & Their Inverses | 双曲函数及其反函数

Hyperbolic functions are analogues of trigonometric functions but based on the hyperbola instead of the circle. The notation sinh x, cosh x, and tanh x can be remembered by the 'h' for hyperbolic. A common mix-up is thinking cosh x is even and sinh x is odd — exactly like cosine and sine. Their inverses are written as arsinh x, arcosh x, artanh x; the 'ar-' prefix stands for 'area', hinting at the area interpretation of the inverse hyperbolic angle.

双曲函数是三角函数的类似形式，只不过基于双曲线而非圆。sinh x、cosh x 和 tanh x 的符号可以用 "h" 代表双曲（hyperbolic）来记忆。常见的混淆是，cosh x 是偶函数而 sinh x 是奇函数——恰好与余弦和正弦的性质一致。它们的反函数写作 arsinh x、arcosh x、artanh x；前缀 "ar-" 代表 "area"（面积），暗示反双曲角的面积解释。

The definitions in terms of exponentials serve as the ultimate memory tool: sinh x = (eˣ – e⁻ˣ)/2, cosh x = (eˣ + e⁻ˣ)/2, tanh x = (eˣ – e⁻ˣ)/(eˣ + e⁻ˣ). Think of 'sinh' as the difference, 'cosh' as the sum — a lightweight pattern that also helps derive identities such as cosh²x – sinh²x = 1.

用指数表达的定义是最终的记忆工具：sinh x = (eˣ – e⁻ˣ)/2，cosh x = (eˣ + e⁻ˣ)/2，tanh x = (eˣ – e⁻ˣ)/(eˣ + e⁻ˣ)。把 sinh 想象成差值，cosh 想象成和值——这个轻巧的规律也有助于推导恒等式，如 cosh²x – sinh²x = 1。

---

2. Complex Numbers: Modulus, Argument & Polar Form | 复数：模、辐角与极形式

The modulus of a complex number z = x + iy is its distance from the origin: |z| = √x² + y² ), is the angle measured anticlockwise from the positive real axis, usually in the range (– nθ) is often compressed to r cis θ, though CIE expects you to use the exponential form r e^iθ in advanced manipulation.

复数 z = x + iy 的模是其到原点的距离：|z| = √x² + y²。辐角 arg(z) 是从正实轴逆时针测量的角度，通常范围为 (–π, π]。为避免象限混淆，每次都要画出 Argand 图。极形式 z = r(cosθ + i sinθ) 常被简写为 r cis θ，不过 CIE 要求你在高阶运算中使用指数形式 r e^iθ。

A powerful memory hack for the exponential form is Euler's formula: e^iθ = cosθ + i sinθ. The conjugate z̄ = x – to simplify division and to express 1/z neatly. Be ready to convert between x + iy and re^iθ fluently — most De Moivre and root problems depend on this skill.

指数形式的一个强大记忆技巧是欧拉公式：e^iθ = cosθ + i sinθ。共轭复数 z̄ = x – iy 只需翻转虚部的符号；它用来简化除法并整洁地表达 1/z。要熟练地在 x + iy 和 re^iθ 之间转换——大多数棣莫弗和求根问题都依赖这一技能。

---

3. Matrices: Determinants, Inverses & Transformations | 矩阵：行列式、逆与变换

A determinant of a 2×2 matrix [a b; c d] is ad – inant tells you whether a matrix is singular (det = 0) or invertible (det ≠ 0). The phrase 'non-singular' means the matrix has an inverse. For the inverse of a 2×2, swap a and d, change the signs of b and c, and multiply by 1/det — a rhythm many students chant to memorise it.

2×2 矩阵 [a b; c d] 的行列式为 ad – bc；对于 3×3，要学会沿一行展开的余子式方法。行列式告诉你矩阵是奇异矩阵（det = 0）还是可逆矩阵（det ≠ 0）。短语 "non-singular" 指矩阵存在逆矩阵。对于 2×2 的逆，交换 a 和 d，改变 b 和 c 的符号，再乘以 1/det——许多学生靠这个口诀记忆。

orresponds to [cosθ -sinθ; sinθ cosθ]; a reflection in the x-axis is [1 0; 0 -1]. The term 'invariant line' refers to a straight line whose points are mapped to points on the same line; an 'invariant point' is a point mapped to itself. In practice, you solve (M – λI)x = 0 to find invariant lines and eigenvectors.

线性变换由矩阵描述：旋转 θ 角的矩阵是 [cosθ -sinθ; sinθ cosθ]；关于 x 轴的对称是 [1 0; 0 -1]。"不变线"（invariant line）指直线上的点被映射到同一条直线上；"不变点"（invariant point）是被映射到自身的点。实际计算中，你通过解 (M – λI)x = 0 来寻找不变线和特征向量。

---

4. Eigenvalues & Eigenvectors | 特征值与特征向量

eigenvector v is a non-zero vector such that Av = λv, where λ is the eigenvalue. The term 'eigen' comes from German meaning 'own' or 'characteristic'. Solve det(A – genvalues, then substitute each λ back to find the corresponding eigenvectors. Memory aid: 'lambda is the scalar that stretches the eigenvector without rotating it.'

对于 n×n 矩阵 A，特征向量 v 是一个满足 Av = λv 的非零向量，其中 λ 是特征值。"eigen" 这个词来源于德文，意为 "自身的" 或 "特征的"。解 det(A – λI) = 0 找到特征值，然后将每个 λ 代回方程解出对应的特征向量。记忆技巧："lambda 是将特征向量伸缩而不旋转它的标量。"

agonal matrix of eigenvalues and P is the matrix of eigenvectors. Be precise with normalisation — pretation is that the matrix A scales space along the directions of its eigenvectors by the corresponding eigenvalues.

在 CIE 考试中，你经常需要将一个矩阵对角化：写出 P⁻¹AP = D，其中 D 是对角元素为特征值的对角矩阵，P 是特征向量组成的矩阵。要特别留意规范化——有时题目要求单位特征向量。几何解释为：矩阵 A 沿特征向量方向以相应的特征值伸缩空间。

---

5. Differential Equations: First & Second Order | 微分方程：一阶与二阶

A first-order linear ODE has the form dy/dx + P(x)y = Q(x). The integrating factor is e^{∫P dx}. Remember it as 'IF = e to the power of the integral of the coefficient of y' e of y'. Multiply through by the IF to collapse the left side into the derivative of a product, then integrate. For separable equations, 'separate then integrate' — collect y terms with dy and x terms with dx.

一阶线性常微分方程的标准形式为 dy/dx + P(x)y = Q(x)。积分因子是 e^{∫P dx}。记住："IF 等于 e 的（y 前系数积分）次方"。将方程两边乘以积分因子，左边就能合并为一个乘积的导数，然后积分。对于可分离变量方程，"分离然后积分"——把 y 项和 dy 放在一边，x 项和 dx 放在另一边。

ture of roots determines the form of the general solution: real distinct roots give y = Ae^λ₁x + Be^λ₂x; repeated real roots yield y = (A + Bx)e^λx; complex conjugate roots p ± iq produce y = e^px(A cos qx + B sin qx). A typical pitfall is missing the x in the repeated-root case.

常系数的二阶齐次常微分方程通过辅助方程 aλ² + bλ + c = 0 求解。根的性质决定通解的形式：两不等实根给出 y = Ae^λ₁x + Be^λ₂x；重实根得到 y = (A + Bx)e^λx；共轭复根 p ± iq 产生 y = e^px(A cos qx + B sin qx)。一个常见的陷阱是在重根情形下漏掉 x。

---

6. Power Series: Maclaurin & Taylor Expansions | 幂级数：麦克劳林与泰勒展开

A Maclaurin series expands a function about x = 0: f(x) = f(0) + f'(0)x + f''(0)x²/2! + ... The Taylor series generalises to expansion about a point a. The term 'Taylor polynomial' simply means truncating the series to a finite degree. Visualise the series as approximating f(x) with polynomials — the higher the degree, the closer the match over a wider interval.

麦克劳林级数在 x = 0 处展开函数：f(x) = f(0) + f'(0)x + f''(0)x²/2! + ...。泰勒级数推广为在点 a 处展开。术语 "泰勒多项式" 仅仅是指将级数截断到有限次多项式。将级数想象成用多项式近似 f(x)——次数越高，在更广区间内匹配越紧密。

Standard Maclaurin series you must know: eˣ = 1 + x + x²/2! + ...; sin x = x – x³/3! + x⁵/5! – ...; cos x = 1 – x²/2! + x⁴/4! – ...; arctan x = x – x³/3 + x⁵/5 – ... (valid for |x| ≤ 1). The notation 'O(xⁿ)' s, be ready to derive these using repeated differentiation or composition of known series.

必须牢记的标准麦克劳林级数：eˣ = 1 + x + x²/2! + ...；sin x = x – x³/3! + x⁵/5! – ...；cos x = 1 – x²/2! + x⁴/4! – ...；arctan x = x – x³/3 + x⁵/5 – ...（有效范围为 |x| ≤ 1）。余项中的符号 'O(xⁿ)'（大O）表明截断时误差项的数量级。在考试中，要能够通过逐次求导或利用已知级数的复合来推导这些展开式。

---

广告 / Sponsored

7. Polar Coordinates: Rose Curves & Areas | 极坐标：玫瑰线与面积

shaped curve. You will be asked to find tangents parallel/perpendicular to the initial line, and areas bounded by polar curves. The area formula is ½ ∫ r² dθ — a semestral reminder: 'area is half the integral of r-squared.'

在极坐标系 (r, θ) 中，r 是到极点的径向距离，θ 是角坐标。例如，心脏线 r = a(1 + cosθ) 是心形的曲线。考题会要求你找出平行/垂直于起始线的切线，以及由极坐标曲线围成的面积。面积公式是 ½ ∫ r² dθ——一个学期性的记忆点："面积是 r 平方积分的二分之一"。

nd 2n if n is even. This is a quick check to avoid plotting mistakes. When finding tangents, the standard formula for the slope is dy/dx = (r'sinθ + r cosθ)/(r'cosθ – r sinθ).

极坐标曲线的环有时需要仔细找出 r ≥ 0 的 θ 范围。对于 r = a sin nθ 这样的曲线，花瓣数量在 n 为奇数时是 n，在 n 为偶数时是 2n。这是一个避免绘图错误的快速检验。在求切线时，斜率的标准公式是 dy/dx = (r' sinθ + r cosθ)/(r' cosθ – r sinθ)。

---

8. Vector Product, Lines & Planes in 3D | 向量积、空间直线与平面

e of a parallelepiped and equals the determinant of the vectors arranged as rows. The term 'coplanar' ors lie in the same plane; test coplanarity with the scalar triple product equalling zero.

向量积（叉积）a × b 给出一个同时垂直于 a 和 b 的向量。标量三重积 a · (b × c) 计算平行六面体的体积，等于将向量按行排列的行列式值。术语 "coplanar"（共面）指点或向量位于同一平面内；通过标量三重积是否为零来检验共面性。

vector n: r · n = a · n. The angle between two planes equals the angle between their normals. A common exam task is to find the intersection of a line and a plane; substitute the line equation into the plane equation and solve for t.

三维直线可以用参数形式表示：r = a + t b，其中 a 是直线上的一点，b 是方向向量。平面由一点和一个法向量 n 定义：r · n = a · n。两个平面之间的夹角等于它们法向量的夹角。考试中常见的任务是求直线与平面的交点；只需将直线方程代入平面方程并解出 t。

---

9. Expectation & Variance of a Random Variable | 随机变量的期望与方差

e expectation E(X) = Σ xᵢ pᵢ. Think of it as the weighted average. Variance Var(X) = E(X²) – [E(X)]². The symbol μ is often used for the mean, σ for standard deviation. The mnemonic 'mean of square minus square of mean' prevents sign errors.

对于具有取值 xᵢ 和对应概率 pᵢ 的离散随机变量 X，期望为 E(X) = Σ xᵢ pᵢ。将其想象为加权平均值。方差 Var(X) = E(X²) – [E(X)]²。符号 μ 常用于表示均值，σ 表示标准差。"平方的均值减去均值的平方" 这个口诀可以避免符号错误。

ensity function (pdf) f(x) integrates to 1 and is non-negative. The cumulative distribution function (cdf) F(x) = P(X ≤ x) is the integral of the pdf from the lower bound up to x. Remember 'pdf' = derivative of cdf, a simple arrow in your mind.

在进阶统计中，你会处理连续随机变量，其期望为 E(X) = ∫ x f(x) dx 积分遍及定义域。概率密度函数（pdf）f(x) 需满足积分等于 1 且非负。累积分布函数（cdf）F(x) = P(X ≤ x) 是 pdf 从下限到 x 的积分。记住 'pdf' 是 cdf 的导数，一个简单的指向关系。

---

10. Poisson, Geometric & Negative Binomial Distributions | 泊松、几何与负二项分布

occur independently at a constant average rate λ. The probability formula is P(X = r) = e^-λ λʳ / r! c distribution Geo(p), X is the number of trials until the first success, so P(X = r) = (1 – p)^{r – 1} p. Note the subtle difference between Geo(p) defined as number of trials and the variant defined as number of failures — CIE uses the number-of-trials version.

泊松分布 Po(λ) 用于对固定区间内以恒定平均速率 λ 独立发生的事件计数。概率公式为 P(X = r) = e^-λ λʳ / r!。对于几何分布 Geo(p)，X 是直到第一次成功所需的试验次数，因此 P(X = r) = (1 – p)^{r – 1} p。注意 Geo(p) 定义为试验次数与定义为失败次数的变体之间的细微差别——CIE 采用试验次数的版本。

probability that a given number of trials are needed to achieve r successes. The key term 'r successes' s embedded in the name. The moment generating function (MGF) of a distribution, M(t) = E(e^tX), is a tool for finding moments; when you see M(t) on an exam paper, recall it encodes all the moments.

负二项分布 NB(r, p) 是几何分布的推广：它给出获得 r 次成功所需的试验次数的概率。关键术语 'r successes'（r 次成功）直接体现在名称中。分布的矩生成函数（MGF），M(t) = E(e^tX)，是求矩的工具；在试卷上看到 M(t) 时，回想它编码了所有的矩。

---

11. Hypothesis Testing: Type I & II Errors, Power | 假设检验：第一类与第二类错误、检验功效

A Type I error occurs when we reject a true null hypothesis H₀; its probability is the significance level α. A Type II error is failing to reject a false H₀, with probability β. The power of a test is 1 – β, the probability of correctly rejecting a false H₀. A simple analogy: Type I is a false alarm, Type II is a missed detection.

第一类错误发生在原假设 H₀ 为真却被我们拒绝了的情况；其概率就是显著性水平 α。第二类错误是未能拒绝一个错误的 H₀，概率为 β。检验的功效是 1 – β，即正确拒绝错误 H₀ 的概率。一个简单的类比：第一类错误是假警报，第二类错误是漏检。

he t-test and χ²-test for contingency tables and goodness-of-fit, make sure you understand 'degrees of freedom' (v). For a χ² goodness-of-fit, v = number of classes – en evaluating a hypothesis test, always state the conclusion in the context of the problem — 'statistically significant' is a phrase you'll often use.

在 t 检验和用于列联表及拟合优度的 χ² 检验中，务必理解 "自由度" (v) 的含义。对于 χ² 拟合优度检验，v = 类别数 – 约束数；对于比较两个均值的 t 检验，合并方差的公式至关重要。在评估假设检验时，始终在问题背景下陈述结论——"统计显著" 是你常用的短语。

---

12. Algorithms & Graph Theory Vocabulary | 算法与图论词汇

In the Discrete/Further Pure with Algorithms option, terms like 'node', 'edge', 'walk', 'path', 'cycle', and 'tree' have exact definitions. A 'Eulerian trail' uses every edge exactly once; a 'Hamiltonian cycle' visits every vertex exactly once. The 'Chinese postman problem' finds the shortest route covering all edges; 'travelling salesman problem' minimises a Hamiltonian cycle.

在离散/带有算法的进阶纯数学选项中，"节点"、"边"、"散步"、"路径"、"回路" 和 "树" 等术语都有严格的定义。"欧拉迹" 恰好使用每条边一次；"Hamiltonian 回路" 恰好访问每个顶点一次。"中国邮递员问题" 寻找覆盖所有边的最短路线；"旅行商问题" 最小化 Hamilton 回路。

Algorithms such as Dijkstra's (shortest path) and Kruskal's/Prim's (minimum spanning tree) are frequently examined. Use 'minimum connector' as an umbrella for a spanning tree of minimum total weight. The 'adjacency matrix' of a graph records the number of edges between vertices. The 'route inspection' algorithm helps you solve the Chinese postman problem by adding edges to make vertices even. Practise writing algorithms in a clear step-by-step format — CIE examiners expect precise terminology.

Dijkstra（最短路径）以及 Kruskal/Prim（最小生成树）等算法经常被考查。用 "最小连接子" 作为总权重最小的生成树的统称。图的 "邻接矩阵" 记录顶点之间边的数量。"路径检查" 算法通过添加边使顶点度数为偶数，从而解决中国邮递员问题。练习以清晰的逐步形式书写算法——CIE 考官期望精准的术语。

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

更多咨询请联系16621398022（同微信）