📚 Year 12 CCEA Further Maths: Interdisciplinary Problem-Solving Practice | CCEA 12年级进阶数学：跨学科综合题型训练
This revision resource bridges the gap between pure mathematics and applied modules in the CCEA Year 12 Further Mathematics specification. By exploring ten carefully constructed interdisciplinary problem types, you will learn to combine concepts from FP1 (complex numbers, matrices, series, inequalities, induction, numerical methods) with Mechanics 1, Statistics 1, and Decision 1. Every section presents a worked example with step‑by‑step reasoning, followed by strategic commentary to help you recognise cross‑topic links under exam conditions.
本复习资源在 CCEA 12 年级进阶数学的纯数学模块与应用模块之间架起桥梁。通过十个精心设计的跨学科题型，你将学会将 FP1 中的复数、矩阵、级数、不等式、归纳法、数值方法等概念与力学 1、统计学 1 和决策数学 1 综合运用。每一节都提供带有逐步推理的例题，并配有策略性点评，帮助你在考试环境中快速识别跨主题联系。
1. Complex Numbers in Force Vector Resolution | 复数在力矢量分解中的应用
Representing force vectors as complex numbers makes vector addition and resolution much more efficient. In Mechanics 1, a force of magnitude F acting at an angle θ to the positive x‑axis can be written as F(cos θ + i sin θ), which is exactly the polar form you studied in FP1. When several forces act on a particle, their resultant is simply the sum of the corresponding complex numbers. The modulus of the sum gives the magnitude of the resultant force, and the argument gives its direction.
将力矢量表示为复数能够显著提高矢量合成与分解的效率。在力学 1 中，大小为 F、与正 x 轴夹角为 θ 的力可以写成 F(cos θ + i sin θ)，这正是 FP1 中学过的极坐标形式。当多个力作用在质点上时，其合力即为对应复数的和。和的模给出合力的大小，辐角则给出合力的方向。
2i) N acting on a ring. The resultant is Fᵣ = (3+1) + (4−2)i = 4 + 2i N. The magnitude is √4² + 2² = √20 = 2√5 and the direction is arctan(2/4) ≈ 26.6° above the horizontal. This approach avoids right‑ in polar form by converting to Cartesian form using Euler’s relation, a skill reinforced in FP1 complex number exercises.
考虑作用在一个圆环上的两个力 F₁ = (3 + 4i) N 和 F₂ = (1 − 2i) N。合力为 Fᵣ = (3+1) + (4−2)i = 4 + 2i N。合力大小为 √4² + 2² = √20 = 2√5 N，方向为 arctan(2/4) ≈ 26.6°（水平上方）。这种方法避免了直角三角形作图，并且可以通过直接相加复数轻松扩展到三个或更多的力。你也可以利用 FP1 复数练习中熟悉的欧拉关系，将极坐标形式的力转换为笛卡尔形式后进行分解。
2. Matrix Transformations & Kinematic Paths | 矩阵变换与运动学路径
A particle moving under constant acceleration follows a parabolic path in the xy‑ ices can represent rotations, reflections and stretches. By applying a transformation matrix to the parametric position vector, you can obtain the trajectory as seen from a rotated or reflected coordinate system. This combination of FP1 linear algebra and M1 kinematics is a common source of exam questions that test your ability to interpret motion in different frames.
在恒定加速度下运动的质点在 xy 平面中沿抛物线轨迹运动。在 FP1 中你学习了 2×2 矩阵如何表示旋转、反射和拉伸。将变换矩阵应用于参数位置矢量，就可以得到在旋转或反射坐标系中所看到的轨迹。FP1 线性代数与 M1 运动学的这一组合是常见的考试题型，考查你在不同坐标系下解释运动的能力。
. The camera’s coordinates are given by multiplying r(t) by the rotation matrix [[cos30°, −sin30°], [sin30°, cos30°]]. The transformed equations become x'(t) = (20 cos30° − 15 sin30°)t + 4.9 sin30° t² and y' rabola, which is a classic FP1 matrix transformation exercise linked to projectile motion.
例如，一个抛体的位置矢量为 r(t) = (20t)i + (15t − 4.9t²)j。一台安装在逆时针旋转 30° 的支架上的摄像机记录该运动。摄像机的坐标由 r(t) 左乘旋转矩阵 [[cos30°, –sin30°], [sin30°, cos30°]] 得到。变换后的方程为 x'(t) = (20 cos30° − 15 sin30°)t + 4.9 sin30° t² 以及 y'(t) = (20 sin30° + 15 cos30°)t − 4.9 cos30° t²。消去参数 t 后，你可以证明变换后的路径仍然是抛物线，这是一个将 FP1 矩阵变换与抛体运动联系起来的经典练习。
3. Numerical Methods for Equilibrium Equations | 数值方法求解平衡方程
In Mechanics 1, static equilibrium problems often lead to trigonometric equations that cannot be solved algebraically. FP1 equips you with numerical techniques such as the Newton‑Raphson method and iterative rearrangements, which can find the unknown angle to any required accuracy. This type of hybrid problem is particularly valuable because it demonstrates how pure mathematical tools are essential for solving real‑world mechanics situations.
在力学 1 中，静力平衡问题常常会导出无法用代数方法求解的三角方程。FP1 为你提供了牛顿‑拉弗森法和迭代重整等数值方法，可以求出任意精度要求的未知角度。这种混合题型特别有价值，因为它展示了纯数学工具在解决实际力学问题中的重要性。
50 cos θ + 10, where 0.4 is the coefficient of friction and 10 N is an additional uphill force. Rearranging gives sin θ − 0.4 cos θ = 0.2. Define f(θ) = sin θ − 0.4 cos θ − 0.2. Using the Newton‑Raphson iteration θn+1 = θ_n − f(θ_n)/f'(θ_n) with f' exercise revises both FP1 differentiation of trig functions and M1 equilibrium conditions.
设想一个重 50 N 的木块放在与水平面成 θ 角的粗糙斜面上。沿斜面方向的平衡方程为 50 sin θ = 0.4 × 50 cos θ + 10，其中 0.4 是摩擦系数，10 N 是额外施加的上坡力。整理得 sin θ − 0.4 cos θ = 0.2。定义 f(θ) = sin θ − 0.4 cos θ − 0.2。使用牛顿‑拉弗森迭代 θn+1 = θ_n − f(θ_n)/f'(θ_n)，其中 f'(θ) = cos θ + 0.4 sin θ，取初始猜测 θ₀ = 20°（≈ 0.349 rad），你可以在三次迭代后收敛到 θ ≈ 26.4°。这个练习同时复习了 FP1 三角函数的微分和 M1 平衡条件。
4. Polynomial Curve Fitting in Statistics | 统计回归中的多项式拟合
bic trend, and FP1 polynomial algebra allows you to set up the normal equations for higher‑ hich can be solved using techniques from FP1 such as Gaussian elimination on a 3×3 matrix.
统计学 1 中的回归分析并不局限于直线。数据可能呈现二次或三次趋势，而 FP1 的多项式代数知识使你能够为高次多项式回归建立正规方程。通过最小化残差平方和，你会得到一个关于未知系数的线性方程组，这个方程组可以用 FP1 中的技巧（如对 3×3 矩阵进行高斯消元）求解。
Suppose a data set {(xᵢ, yᵢ)} suggests a quadratic model y = a + bx + cx². The least‑ ear in a, b, c. For example, with five data points you might obtain: 5a + 15b + 55c = 40, 15a + 55b + 225c = 150, 55a + 225b + 979c = 625. Writing this in augmented matrix form and reducing to row‑ an use differentiation (from pure maths) to locate the maximum or minimum predicted value.
假设一组数据 {(xᵢ, yᵢ)} 呈现出二次模型 y = a + bx + cx²。最小二乘准则要求解出由 Σ (yᵢ − a − bxᵢ − cxᵢ²)² 对 a、b、c 的偏导数为零而得到的方程组。这会生成三个关于 a、b、c 的线性正规方程。例如，对于五个数据点你可能得到：5a + 15b + 55c = 40，15a + 55b + 225c = 150，55a + 225b + 979c = 625。将其写成增广矩阵形式并化为行阶梯形，正是 FP1 矩阵方法的直接应用。求得多项式后，你就可以使用纯数中的微分来定位预测值的最大值或最小值。
5. Series Summation for Expected Values | 级数求和在期望值中的应用
integers, squares or cubes to calculate expected values and variances. FP1 provides closed‑ low you to quickly evaluate expectations for uniform or linear probability distributions without lengthy arithmetic.
S1 中的离散随机变量常常需要对前 n 个整数、平方或立方求和，以计算期望值和方差。FP1 提供了封闭的求和公式，例如 Σ r = ½ n(n+1)、Σ r² = (1/6)n(n+1)(2n+1) 和 Σ r³ = ¼ n²(n+1)²。这些恒等式使你能够快速计算均匀分布或线性概率分布的期望值，而无需进行冗长的算术运算。
a discrete random variable X with probability mass function P(X = x) = k x, for x = 1, 2, … k Σₓ₌₁ⁿ x² = k × (1/6)n(n+1)(2n+1). Substituting k gives E(X) = (2n+1)/3. With n = 10, E(X) = 21/3 = 7, a neat result verified instantly. Var(X) can be found similarly using Σ r³. This fusion of probability and series saves time and reduces manipulation errors.
考虑一个离散随机变量 X，其概率质量函数为 P(X = x) = k x，x = 1, 2, …, n。首先通过总概率之和为 1 求出 k：Σₓ₌₁ⁿ kx = k Σₓ₌₁ⁿ x = k × ½ n(n+1) = 1，故 k = 2/[n(n+1)]。期望值 E(X) = Σ x·P(X=x) = k Σₓ₌₁ⁿ x² = k × (1/6)n(n+1)(2n+1)。代入 k 可得 E(X) = (2n+1)/3。当 n = 10 时，E(X) = 21/3 = 7，这是一个立即可验证的整洁结果。Var(X) 可类似地利用 Σ r³ 求出。这种概率与级数的融合节省了时间并减少了代数运算错误。
6. Inequalities and Linear Programming | 不等式与线性规划
Linear programming in Decision Mathematics 1 involves identifying a feasible region defined by linear inequalities and then optimising an objective function. FP1 strengthens your ability to solve simultaneous linear inequalities and to locate vertices by intersection. The graphical approach is the same, but the algebraic preparation from FP1, including solving systems of equations, is indispensable when constraints are tight or when you must check boundary points mathematically.
决策数学 1 中的线性规划涉及确定由线性不等式定义的可行域，然后优化目标函数。FP1 增强了你们求解联立线性不等式以及通过交点定位顶点的能力。图形方法是相同的，但当约束条件紧张或需要从数学上检查边界点时，FP1 的代数准备（包括方程组的求解）是不可或缺的。
nstraints give 3x + 2y ≤ 48 and x + 3y ≤ 36, where x and y are the numbers of A and B. Non‑ 0), (0,12) and the intersection of 3x+2y=48 and x+3y=36. Solving simultaneously (multiply second equation by 3 and subtract) yields x = 12, y = 6. Evaluating P at each vertex identifies the maximum profit of 5×12 + 4×6 = 84 at (12,6). Recognising that the optimal vertex is obtained by treating inequalities as equalities is a direct transfer from FP1 algebraic inequality work.
某工厂生产两种小部件 A 和 B。机器时间约束为 3x + 2y ≤ 48 和 x + 3y ≤ 36，其中 x、y 分别为 A 和 B 的数量。非负约束为 x ≥ 0、y ≥ 0。利润为 P = 5x + 4y。利用 FP1 技巧，你可以求解成对的边界方程来找到顶点：(0,0)、(16,0)、(0,12) 以及 3x+2y=48 与 x+3y=36 的交点。联立求解（将第二个方程乘以 3 后相减）得到 x = 12，y = 6。在每个顶点评估 P，即可确定最大利润为 5×12 + 4×6 = 84 发生在 (12,6) 处。识别出最优顶点是通过将不等式视为等式求解而得到的，这直接源于 FP1 中的代数不等式训练。
7. Vector Equations & Projectile Motion | 矢量方程与抛体运动
ctor v(t) = u cos α i + (u sin α − g t) j, and differentiating again gives acceleration a = −g j. FP1 vector manipulation skills, including dot products and magnitude calculations, allow you to find the time when the velocity is perpendicular to the acceleration, or the radius of curvature at the top of the trajectory.
抛体的位置矢量可以写作 r(t) = (u cos α) t i + (u sin α t – ½ g t²) j。对时间求导得到速度矢量 v(t) = u cos α i + (u sin α – g t) j，再次求导得到加速度 a = –g j。FP1 的矢量运算技巧，包括点积和模的计算，能让你求出速度与加速度垂直的时刻，或轨迹最高点的曲率半径。
)(u sin α) = 0 → u² cos²α + u² sin²α − g t u sin α = 0 → u² − g t u sin α = 0 → t = u/(g sin α). This elegantly uses FP1 dot product properties. At the top of flight, vy (u cos α)²/g. Such questions demand fluency in both mechanics concepts and vector algebra.
例如，要求出速度与初速度 u = u cos α i + u sin α j 垂直的时刻，可令 v(t) · u = 0。于是 (u cos α)(u cos α) + (u sin α – g t)(u sin α) = 0 → u² cos²α + u² sin²α – g t u sin α = 0 → u² – g t u sin α = 0 → t = u/(g sin α)。这巧妙地运用了 FP1 点积的性质。在轨迹最高点，vy = 0，速率为 u cos α。加速度完全是向心的，所以 a = v²/ρ → ρ = (u cos α)²/g。这类题目要求同时熟练掌握力学概念和矢量代数。
8. Proof by Induction for Mechanics Formulas | 归纳法证明力学公式
Mathematical induction from FP1 can be employed to prove certain formulae in mechanics that hold for all positive integers, such as the total distance travelled in the nth second by an object moving with constant acceleration, or the work done over n successive equal displacements. This demonstrates that formal proof techniques are not confined to pure mathematics; they verify the consistency of applied models.
FP1 中的数学归纳法可用于证明力学中某些对所有正整数成立的公式，例如匀加速运动物体在第 n 秒内所经过的总路程，或在 n 次连续相等位移中所做的功。这表明形式化的证明技巧并不局限于纯数学；它们能验证应用模型的一致性。
ches s = ut + ½ gt² with t=1. Inductive step: Assume true for n = k, i.e. distance in the kth second is ½ g (2k−1). The total distance after k seconds is ½ g k². After k−1 seconds it is ½ g (k−1)². The distance in the kth second is indeed the difference: ½ gk² − ½ g(k−1)² = ½ g (2k−1), which matches the assumption. Then for k+1, the distance in the (k+1)th second is ½ g(k+1)² − ½ gk² = ½ g(2k+1) = ½ g(2(k+1)−1), completing the induction. This proof uses algebraic manipulation from FP1 and the well‑known suvat formula, blending pure logic with physical understanding.
证明一个物体在真空中从静止下落的第 n 秒内下落的距离为 sₙ = ½ g (2n − 1)。基础情形 n=1：s₁ = ½ g (2·1 − 1) = ½ g，这与 s = ut + ½ gt² 中 t=1 的情形吻合。归纳步骤：假设 n = k 时命题成立，即第 k 秒内的距离为 ½ g (2k−1)。k 秒后的总距离为 ½ g k²。k−1 秒后的总距离为 ½ g (k−1)²。第 k 秒内的距离正是两者的差：½ gk² − ½ g(k−1)² = ½ g (2k−1)，这与假设一致。那么对于 k+1，第 (k+1) 秒内的距离为 ½ g(k+1)² − ½ gk² = ½ g(2k+1) = ½ g(2(k+1)−1)，归纳完成。该证明使用了 FP1 的代数操作和熟知的 suvat 公式，将纯逻辑与物理理解融为一体。
9. Binomial Expansion & Impulse Approximations | 二项式展开与冲量近似
In collision problems, the coefficient of restitution e often appears in expressions such as (1 + e)ⁿ or (1 − e²)⁻¹. FP1 binomial expansion, including the general expansion for (1 + x)ⁿ for rational n, enables you to approximate these expressions when e is small or when a series approximation for energy loss is required. This connects core algebra with the applied mechanics of impulses.
在碰撞问题中，恢复系数 e 经常出现在诸如 (1 + e)ⁿ 或 (1 − e²)⁻¹ 的表达式中。FP1 中的二项式展开，包括对有理数 n 的 (1 + x)ⁿ 的一般展开，能够在 e 很小或需要能量损失的级数近似时，对这些表达式进行近似。这将核心代数与冲量这个应用力学主题联系起来。
− u₂)² (1 − e²). For a nearly perfectly elastic collision, e ≈ 1, we can write e = 1 − ε with small ε. Then 1 − e² = 1 − (1 − ε)² = 2ε − ε². If ε is very small, the dominant term is 2ε, giving ΔKE ≈ m₁m₂/(m₁+m₂) (u₁ − u₂)² ε. To express this directly in terms of e, use binomial expansion on (1 − e²) with e close to 1: let δ = 1 − e,
Published by TutorHao | Year 12 进阶数学 Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图