📚 AS CIE Further Mathematics: Case Study Practical Exercises | AS CIE 进阶数学：案例分析实战演练
This article presents a collection of practical case studies designed to bridge the gap between abstract concepts and real‑world applications in AS CIE Further Mathematics. Each section models a distinct problem, demonstrating how tools such as polynomial roots, series, matrices, polar coordinates, vectors and proof by induction can be deployed to analyse physical, economic and engineering scenarios. Working through these examples will strengthen your problem‑solving skills and deepen your appreciation of the subject’s practical power.
本文提供一系列实战案例分析，旨在弥合 AS CIE 进阶数学中抽象概念与现实应用之间的差距。每一节对一个不同的问题进行建模，展示如何运用多项式根、级数、矩阵、极坐标、向量和数学归纳法等工具来分析物理、工程和经济场景。通过这些示例的演练，您将提升解题能力，并更深刻地体会该学科的实际效力。
1. Polynomial Roots in Electrical Network Analysis | 多项式根在电路网络分析中的应用
An electrical filter circuit can be described by its characteristic polynomial whose roots determine the natural frequencies of the network. For a simple RLC loop the governing second‑order differential equation leads to a quadratic auxiliary equation, say s² + 4s + 13 = 0. The complex roots s = −2 ± 3i indicate an under‑damped oscillatory response with damping factor 2 and angular frequency 3 rad s⁻¹. Engineers use the real part to predict how quickly transient oscillations die out and the imaginary part to anticipate the ringing frequency.
一个电滤波器电路可用其特征多项式描述，该多项式的根决定了网络的固有频率。对于一个简单的 RLC 回路，控制它的二阶微分方程导出一个二次辅助方程，例如 s² + 4s + 13 = 0。其复数根 s = −2 ± 3i 表示欠阻尼振荡响应，阻尼系数为 2，角频率为 3 rad s⁻¹。工程师利用实部预测瞬态振荡衰减的速度，利用虚部预测振铃频率。
By expressing the solution in terms of complex roots, we can write the transient voltage as V(t) = e⁻²ᵗ (A cos 3t + B sin 3t). The coefficients A and B are fixed by initial conditions, completing the model. This case shows how the roots of a polynomial – a core FP1 topic – directly govern the behaviour of physical systems.
利用复数根表示解，我们可以将瞬态电压写为 V(t) = e⁻²ᵗ (A cos 3t + B sin 3t)。系数 A 和 B 由初始条件确定，从而完成建模。这个案例展示了多项式根——FP1 的核心主题——如何直接支配物理系统的行为。
2. Summation of Series: Modelling a Savings Plan | 级数求和：储蓄计划建模
Standard formulae for arithmetic and geometric series are indispensable in financial planning. Suppose you deposit £200 at the start of every month into an account that pays 0.5% interest per month, compounded monthly. After n months the total accumulated value can be expressed as the sum of a geometric progression: A = 200(1.005) + 200(1.005)² + … + 200(1.005)ⁿ. Recognising the common ratio r = 1.005, we apply the finite geometric sum formula Sₙ = a(rⁿ − 1)/(r − 1) with a = 200×1.005.
等差级数和等比级数的标准公式在财务规划中不可或缺。假设您在每月初存入 200 英镑到一个账户，月利率为 0.5%，按月复利计算。n 个月后，总累积值可以表示为等比数列之和：A = 200(1.005) + 200(1.005)² + … + 200(1.005)ⁿ。公比 r = 1.005，利用首项 a = 200×1.005 的有限等比级数求和公式 Sₙ = a(rⁿ − 1)/(r − 1)。
For a five‑year plan (n = 60) the computation yields roughly £13,954. This exercise not only practises summation techniques but also illustrates how series can transform a regular savings habit into a predictable future value, a powerful illustration of the topic’s relevance.
对于一个五年计划（n = 60），计算结果约为 £13,954。这个练习不仅训练了求和技巧，还展示了级数如何将规律的储蓄习惯转化为可预测的未来价值，有力地证明了该主题的实际意义。
3. Matrix Solution of Linear Economic Models | 经济模型的矩阵求解
Input‑output models in economics use matrices to represent how the output of one industry is consumed by others. A simple two‑sector model might be described by the linear system: 0.8x − 0.4y = 30, −0.3x + 0.9y = 20, where x and y are the production levels of two sectors. Writing this as M·(x y)ᵀ = (30 20)ᵀ with coefficient matrix M, we find the inverse M⁻¹ and apply it to the demand vector. Mastery of matrix inversion and determinant calculation, as developed in FP1, is essential for solving such systems efficiently.
经济学中的投入产出模型利用矩阵表示一个行业的产出如何被其他行业消耗。一个简单的两部门模型可用线性方程组描述：0.8x − 0.4y = 30，−0.3x + 0.9y = 20，其中 x 和 y 是两个部门的生产水平。将其写为 M·(x y)ᵀ = (30 20)ᵀ，系数矩阵为 M，我们求出逆矩阵 M⁻¹ 并将其应用于需求向量。掌握 FP1 中发展的矩阵求逆和行列式计算技能，对于高效求解此类系统至关重要。
After computing det(M) = 0.8×0.9 − (−0.4)(−0.3) = 0.72 − 0.12 = 0.6, the inverse is straightforward. The solution gives x ≈ 58.3 units and y ≈ 38.9 units. This case neatly demonstrates the power of matrices in handling interdependent systems.
计算 det(M) = 0.8×0.9 − (−0.4)(−0.3) = 0.72 − 0.12 = 0.6 后，逆矩阵很容易求得。解得 x ≈ 58.3 单位，y ≈ 38.9 单位。这个案例清晰地展示了矩阵在处理相互关联系统时的威力。
4. Matrix Transformations in Image Processing | 图像处理中的矩阵变换
Every image on a screen is a grid of pixels that can be manipulated by transformation matrices. The matrix T = ₀[cosθ −sinθ; sinθ cosθ] rotates an image anticlockwise by angle θ about the origin. Stretching and shearing matrices alter the shape for effects like perspective. In image processing software, a chain of matrix multiplications compresses the entire transformation into a single product matrix, which is then applied to each coordinate pair. This direct application of FP1 matrix algebra underpins much of digital media production.
屏幕上的每幅图像都是一个像素网格，可以通过变换矩阵对其进行操作。矩阵 T = [cosθ −sinθ; sinθ cosθ] 将图像绕原点逆时针旋转角度 θ。拉伸和剪切矩阵则改变形状以实现透视等效果。在图像处理软件中，一连串矩阵乘法将整个变换组合成一个乘积矩阵，然后应用于每个坐标对。FP1 矩阵代数的这一直接应用是众多数字媒体制作的基础。
For a rotation of 30° followed by a vertical shear factor 0.5, the composite matrix is S × R. Executing the multiplication yields a matrix that can be used to redraw an entire photograph instantly. The exercise reinforces the importance of matrix order and the concept of composition of transformations.
对于 30° 旋转后跟系数为 0.5 的垂直剪切，复合矩阵为 S × R。进行乘法运算得到可用来即时重绘整幅照片的矩阵。该练习强化了矩阵顺序的重要性以及变换复合的概念。
5. Polar Coordinates: Radar Tracking | 极坐标：雷达跟踪
Radar systems locate aircraft using polar coordinates (r, θ), where r is the slant range and θ the azimuth angle. An object’s Cartesian position (x, y) is recovered by x = r cosθ, y = r sinθ. FP1 students learn to sketch cardioids, circles and limacons, but the same skills allow an operator to interpret a radar display where a target follows a path described by r = 2 + 1.5 cosθ. Knowing the maximum and minimum r values helps distinguish between different flight paths.
雷达系统使用极坐标 (r, θ) 定位飞机，其中 r 为斜距，θ 为方位角。物体的笛卡尔位置 (x, y) 可通过 x = r cosθ, y = r sinθ 恢复。FP1 学生学习绘制心形线、圆和蜗线，但同样的技能使操作员能够解读雷达显示屏上目标沿 r = 2 + 1.5 cosθ 描述的路径移动。了解 r 的最大值与最小值有助于区分不同的飞行轨迹。
The polar equation represents a limacon with an inner loop when the constant is less than the coefficient of cosθ. In tracking, this inner loop could indicate the aircraft performing a tight turn. A student who can analyse the curve accurately contributes to safer air traffic management.
该极坐标方程表示一条蜗线，当常数小于 cosθ 的系数时会产生内环。在跟踪中，这一内环可能表示飞机在做急转弯。能够准确分析曲线的学生能为更安全的空中交通管理做出贡献。
6. Vectors: Forces on a Bridge Truss | 向量：桥梁桁架受力
A bridge truss is a framework of beams where each joint must be in static equilibrium. At a particular joint, three forces act: F₁ = (20i + 0j) kN horizontally from the deck, F₂ = (−15i − 10j) kN from a diagonal member, and an unknown force F₃. Setting the resultant force to zero gives F₃ = −(F₁ + F₂) = −(5i − 10j) = −5i + 10j kN. Vector addition, a core FP1 skill, directly yields the tension or compression in each beam.
桥梁桁架是一个梁框架，每个节点必须处于静力平衡。在某个特定节点上，有三个力作用：来自桥面的水平力 F₁ = (20i + 0j) kN，来自斜杆的 F₂ = (−15i − 10j) kN，以及一个未知力 F₃。令合力为零得到 F₃ = −(F₁ + F₂) = −(5i − 10j) = −5i + 10j kN。向量加法——FP1 的核心技能——可直接得出每根梁的拉力或压力。
The magnitude |F₃| = √((−5)² + 10²) = √125 ≈ 11.18 kN gives the load carried by the member. Repeating this procedure for all joints analyses the entire structure. The simplicity of vector addition masks its engineering potency.
F₃ 的大小 |F₃| = √((−5)² + 10²) = √125 ≈ 11.18 kN 给出了该构件承受的荷载。对所有节点重复这一过程即可分析整个结构。向量加法的简洁性掩盖了它的工程威力。
7. Proof by Induction: Sum of Squares and Geometric Insight | 数学归纳法：平方和与几何直观
Induction is a powerful method for verifying series formulae. The statement Σ(k=1 to n) k² = (1/6)n(n+1)(2n+1) can be proved for all positive integers n. The base case n = 1 is trivial. Assuming the statement holds for n = K, we add (K+1)² and algebraically manipulate to obtain the formula with K replaced by K+1. This classic FP1 exercise builds rigorous logical thinking, essential for higher mathematics.
数学归纳法是验证级数公式的有力方法。命题 Σ(k=1 to n) k² = (1/6)n(n+1)(2n+1) 可对所有正整数 n 证明。基础情形 n = 1 显然成立。假设命题对 n = K 成立，我们加上 (K+1)² 并进行代数变形，将公式中的 K 替换为 K+1 即可。这个经典的 FP1 练习培养了严谨的逻辑思维，这对高等数学至关重要。
Beyond the symbolic proof, a visual interpretation stacks unit squares into pyramids, reinforcing the algebraic identity. Such connections between induction and geometry make the abstract principle memorable and demonstrate that mathematical reasoning extends well beyond symbol manipulation.
除了符号证明之外，一种直观解释将单位方块堆叠成金字塔形状，强化了代数恒等式。这种归纳法与几何之间的联系使得抽象原理更容易记忆，并表明数学推理远不止符号操作。
8. Rational Functions: Modelling Drug Concentration | 有理函数：药物浓度建模
When a drug is administered, its concentration in the bloodstream often follows a rational decay model such as C(t) = 5t / (t² + 2), where t is time in hours. FP1 rational function skills – finding asymptotes, intercepts and stationary points – directly translate to determining the peak concentration and the long‑term behaviour. The horizontal asymptote C = 0 shows the drug is eventually cleared, while the maximum is found by setting the derivative to zero.
给药后，血液中的药物浓度通常遵循一个有理衰减模型，例如 C(t) = 5t / (t² + 2)，其中 t 为小时。FP1 中有关有理函数的技能——求渐近线、截距和驻点——可以直接用来确定峰值浓度和长期行为。水平渐近线 C = 0 表明药物最终被清除，而最大值则通过令导数为零求得。
Differentiating gives C′(t) = 5(t²+2 − 2t²) / (t²+2)² = 5(2 − t²) / (t²+2)². Setting t² = 2 yields t = √2 ≈ 1.41 h with C ≈ 2.5×1.41/4 ≈ 0.88 mg/L. Pharmaceutical companies use such models to design safe dosage intervals. This case demonstrates the immediate applicability of rational function analysis.
求导得 C′(t) = 5(t²+2 − 2t²) / (t²+2)² = 5(2 − t²) / (t²+2)²。令 t² = 2 得 t = √2 ≈ 1.41 h，C ≈ 2.5×1.41/4 ≈ 0.88 mg/L。制药公司使用此类模型设计安全的给药间隔。该案例展示了有理函数分析的直接可应用性。
9. Series Summation in Cryptography: Check Digits | 级数求和在密码学中的应用：校验位
ISBN codes and bank card numbers rely on check digit algorithms that are essentially weighted sums. An ISBN‑10 uses a weighted arithmetic series: the first digit is multiplied by 10, the second by 9, …, and the last by 1. The sum is calculated and must be congruent to 0 modulo 11. For the raw digits 0-13-480736, the weighted sum S = 10×0 + 9×1 + 8×3 + 7×4 + 6×8 + 5×0 + 4×7 + 3×3 + 2×6 + 1×? should be computed, and the unknown check digit is determined to make S ≡ 0 mod 11.
ISBN 编码和银行卡号依赖于本质上是加权求和的校验位算法。ISBN‑10 使用加权等差级数：第一位数字乘以 10，第二位乘以 9，…，最后一位乘以 1。计算总和须满足模 11 下同余 0。对于未加校验的序列 0-13-480736，加权和 S = 10×0 + 9×1 + 8×3 + 7×4 + 6×8 + 5×0 + 4×7 + 3×3 + 2×6 + 1×? 需满足 S ≡ 0 mod 11。
This exercise familiarises students with summation notation and modular arithmetic while revealing the mathematical backbone of everyday error‑detection systems. The ability to manipulate series and congruences is a natural extension of AS‑level summation content.
这个练习使学生在熟悉求和符号和模算术的同时，揭示了日常错误检测系统的数学支柱。操纵级数和同余式的能力是 AS 阶段求和内容的自然延伸。
10. Polar Coordinates: Analysing Planetary Orbits | 极坐标：分析行星轨道
Kepler’s first law states that planets move in elliptical orbits with the Sun at one focus. In polar form with the pole at the focus, an ellipse is written as r = l / (1 + e cosθ), where e is eccentricity. For Earth’s orbit e ≈ 0.0167 and l is the semi‑latus rectum. A student who can convert between Cartesian and polar forms and sketch these curves gains an intuitive understanding of orbital mechanics.
开普勒第一定律指出，行星以太阳为一个焦点沿椭圆轨道运行。在以焦点为极点的极坐标中，椭圆写为 r = l / (1 + e cosθ)，其中 e 是离心率。对于地球轨道，e ≈ 0.0167，l 是半正焦弦。能够在直角坐标与极坐标之间转换并绘制这些曲线的学生，能够直观地理解轨道力学。
By evaluating r for θ = 0 and θ = π, we obtain the perihelion and aphelion distances respectively. Such calculations are within the scope of FP1 polar curve analysis and provide a compelling link between pure mathematics and astronomy.
通过计算 θ = 0 和 θ = π 时的 r，我们分别得到近日点和远日点的距离。这种计算属于 FP1 极坐标曲线分析的范畴，并在纯数学与天文学之间建立了引人入胜的联系。
11. Vectors: Shortest Distance from a Point to a Line in Engineering | 向量：工程中点到直线的最短距离
In robotic path planning, a sensor needs to find the shortest distance from its position to a straight safety rail. Represent the rail by the line r = (2i + j) + λ(i + 3j) and the sensor by point B with position vector b = 4i + 6j. The shortest distance d is obtained by projecting the vector from a point on the line to B onto a direction perpendicular to the line. Using the vector cross product form (or dot product for 2D equivalent), d = |(b − a) × d̂| where d̂ is the unit direction vector of the line.
在机器人路径规划中，一个传感器需要找到从其位置到一条笔直安全栏的最短距离。将安全栏表示为直线 r = (2i + j) + λ(i + 3j)，传感器为点 B，位置向量为 b = 4i + 6j。最短距离 d 可以通过将直线上一点到 B 的向量投影到垂直于直线的方向上来获得。利用向量叉积形式（或二维中的点积等效），d = |(b − a) × d̂|，其中 d̂ 是直线的单位方向向量。
Taking a = 2i + j, b − a = 2i + 5j. The direction vector is v = i + 3j, so a perpendicular vector is −3i + j. The scalar projection onto the perpendicular gives d ≈ 3.16 units. This process uses only FP1 vector algebra, yet it is fundamental in collision avoidance systems.
取 a = 2i + j，b − a = 2i + 5j。方向向量为 v = i + 3j，因此一个垂直向量为 −3i + j。在垂直向量上的标量投影给出 d ≈ 3.16 单位。这个过程仅使用 FP1 的向量代数，却是避撞系统中的基础内容。
12. Induction and Summation: Proving a Telescoping Property | 归纳法与求和：证明裂项求和性质
The method of differences, a summation technique, can itself be justified by induction. To show Σ(k=1 to n) (1/(k(k+1))) = 1 − 1/(n+1), we prove that the telescoping sum collapses to this closed form. The base case n=1 gives 1/2 = 1 − 1/2. Assuming the formula for n, we add the (n+1)‑th term 1/((n+1)(n+2)) and simplify to obtain 1 − 1/(n+2). This case elegantly demonstrates how induction underpins the very methods used throughout the series topic.
裂项相消法是一种求和技巧，其本身可通过归纳法证明。要证明 Σ(k=1 to n) (1/(k(k+1))) = 1 − 1/(n+1)，我们证明该裂项和可化为这一封闭形式。基础情形 n=1 给出 1/2 = 1 − 1/2。假设公式对 n 成立，加上第 (n+1) 项 1/((n+1)(n+2)) 并化简得到 1 − 1/(n+2)。这个案例精妙地展示了归纳法如何支撑贯穿整个级数主题的方法。
Such proofs build the confidence to derive new summation results independently. Each algebraic manipulation reinforces skills in partial fractions and series manipulation, while the inductive framework cements logical discipline – a combination essential for any aspiring mathematician.
这样的证明培养了独立推导新求和结果的能力。每一步代数变形都强化了部分分式和级数操作的技能，而归纳法框架则巩固了逻辑规范——这种结合对于任何有抱负的数学家都是不可或缺的。
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导