📚 AS Further Mathematics Unit 1 June 2019: Question Paper Analysis | AS 进阶数学第一单元 2019年6月真题题型解析
The June 2019 AS Further Mathematics Unit 1 paper is a classic assessment of core pure mathematics topics, blending routine algebraic manipulation with the conceptual depth required at AS level. This analysis breaks down every major question type that appeared, equipping you with a clear revision roadmap and targeted problem-solving strategies.
2019年6月的AS进阶数学第一单元试卷是一份经典的核心纯数评估，融合了常规代数运算与AS阶段所需的深度概念理解。以下分析将拆解试卷中出现的每一类重要题型，为你提供清晰的复习路线图和针对性解题策略。
1. Complex Numbers – Arithmetic and Quadratic Equations | 复数运算与二次方程
The opening question typically tests the fundamentals of complex arithmetic and roots of quadratics with real coefficients. You might be asked to simplify an expression like (3 + 2i)(1 − 4i), then solve a quadratic such as z² − 2z + 5 = 0. Remember that for a quadratic with real coefficients, complex roots always occur in conjugate pairs.
首问通常考察复数运算的基础以及实系数二次方程的根。你可能需要化简如 (3 + 2i)(1 − 4i) 的表达式，然后求解 z² − 2z + 5 = 0 这样的二次方程。记住，对于实系数二次方程，复数根总是成对出现且互为共轭。
For the arithmetic part, expand carefully using i² = −1. For the quadratic, use the quadratic formula or complete the square. With z² − 2z + 5 = 0, completing the square gives (z − 1)² = −4, so z = 1 ± 2i. Many students lose marks by failing to present the conjugate pair explicitly; state ‘z = 1 + 2i and z = 1 − 2i’ separately.
在运算部分，注意运用 i² = −1 仔细展开。对于二次方程，使用求根公式或配方法。例如 z² − 2z + 5 = 0，配方得 (z − 1)² = −4，因此 z = 1 ± 2i。很多同学因没有明确写出共轭对而失分；应当单独写出 ‘z = 1 + 2i 和 z = 1 − 2i’。
2. Complex Numbers – Modulus, Argument and Argand Diagram | 复数的模、辐角与阿甘特图
A staple follow-up involves plotting a complex number on an Argand diagram and determining its modulus and argument. Given z = √3 + i, for instance, the modulus |z| = √((√3)² + 1²) = 2, and the argument arg(z) = tan⁻¹(1/√3) = π/6. Always state the argument in radians unless told otherwise, and pay attention to the quadrant.
一类经典后续题型要求在阿甘特图上标出复数并计算其模与辐角。例如已知 z = √3 + i，模 |z| = √((√3)² + 1²) = 2，辐角 arg(z) = tan⁻¹(1/√3) = π/6。除非特别说明，辐角一律用弧度表示，并注意象限。
In the June 2019 paper, part (c) might ask for the complex number w such that the argument of (z/w) is π/2. This requires interpreting the geometric relationship: division by w rotates the vector. Set w = a + bi and use arg(z) − arg(w) = π/2, or interpret as a perpendicular condition on the Argand diagram. A sketch often reveals the shortest path.
在2019年6月试卷中，可能会进一步要求寻找复数 w，使得 (z/w) 的辐角为 π/2。这需要几何关系的解读：除以 w 相当于旋转向量。令 w = a + bi，利用 arg(z) − arg(w) = π/2，或在阿甘特图上理解为垂直条件。简单画出草图往往能最快呈现答案。
3. Matrices – Multiplication, Determinant and Inverse | 矩阵乘法、行列式与逆矩阵
Matrix algebra questions demand fluency with order and dimensions. Given A and B, you might compute AB, confirming that the product exists only if the number of columns in A matches the number of rows in B. For A = [[2, 1], [0, 3]] and B = [[1, 2], [4, −1]], the product AB is [[2×1+1×4, 2×2+1×(−1)], [0×1+3×4, 0×2+3×(−1)]] = [[6, 3], [12, −3]].
矩阵代数题目要求对运算顺序与维度了然于胸。已知矩阵 A 和 B，可能需要计算 AB，需先确认乘积是否存在：A 的列数必须等于 B 的行数。若 A = [[2, 1], [0, 3]] 且 B = [[1, 2], [4, −1]]，则乘积 AB = [[2×1+1×4, 2×2+1×(−1)], [0×1+3×4, 0×2+3×(−1)]] = [[6, 3], [12, −3]]。
Determinants of 2×2 matrices arise frequently. For M = [[a, b], [c, d]], det(M) = ad − bc. If det(M) ≠ 0, the inverse exists and is given by (1/det(M)) [[d, −b], [−c, a]]. Be meticulous with signs; a single sign error can invalidate an entire system of equations later.
2×2 矩阵的行列式频繁出现。对于 M = [[a, b], [c, d]]，det(M) = ad − bc。若 det(M) ≠ 0，则逆矩阵存在，且公式为 (1/det(M)) [[d, −b], [−c, a]]。符号务必仔细；一个符号错误可能导致后续整个方程组求解无效。
4. Matrices – Solving Simultaneous Equations with Inverse | 用逆矩阵解联立方程组
When a system of linear equations can be written as Mx = c, where M is a 2×2 matrix, you can solve by finding x = M⁻¹c, provided det(M) ≠ 0. For example, 2x + y = 5 and 4x − 3y = 11 give M = [[2, 1], [4, −3]], c = [[5], [11]]. First compute det(M) = −6 − 4 = −10, then M⁻¹ = (−1/10)[[−3, −1], [−4, 2]]. Multiply M⁻¹c to obtain x and y.
当线性方程组可写为 Mx = c 的形式，其中 M 为 2×2 矩阵时，只要 det(M) ≠ 0，就可通过 x = M⁻¹c 求解。例如方程组 2x + y = 5 和 4x − 3y = 11，M = [[2, 1], [4, −3]]，c = [[5], [11]]。先计算 det(M) = −6 − 4 = −10，然后 M⁻¹ = (−1/10)[[−3, −1], [−4, 2]]。将 M⁻¹c 相乘即得 x 和 y。
Examiners love to embed this within a larger problem: earlier parts might guide you to find M⁻¹; then you are asked to solve a slightly reshuffled system requiring you to recognise the same coefficient matrix. Always check whether the matrix of coefficients matches exactly; if the constants are swapped, rewrite the system so that the left-hand side matrix remains identical to the one you inverted.
考官喜欢将求逆和解方程嵌入大题中：前面的小题可能引导你求出 M⁻¹；然后要求解一个稍作变化且系数矩阵相同的方程组。务必检查系数矩阵是否完全匹配；若常数项互换，可重新整理方程组，使等号左侧的矩阵与你已求逆的矩阵一致。
5. Matrices – Invariant Lines and Geometric Interpretations | 矩阵不变直线与几何意义
Given a transformation matrix M, an invariant line is a line through the origin that is mapped to itself, though points on it may move. For a line y = mx, the image after transformation by M still lies on the same line. Setting M [[x], [mx]] = [[x’], [m x’]] leads to an equation in m. Usually this reduces to a quadratic whose solutions give the gradient(s) of invariant lines.
若已知变换矩阵 M，一条不变直线是指过原点且映射到自身的直线，但该线上的点可能在线上移动。对于直线 y = mx，经 M 变换后的像点仍在原直线上。令 M [[x], [mx]] = [[x’], [m x’]] 可得到关于 m 的方程。这通常简化为一个二次方程，其解即为不变直线的斜率。
For example, if M = [[3, 2], [2, 3]], solving yields m² − 1 = 0, so m = 1 or m = −1. Thus the invariant lines are y = x and y = −x. Sometimes a line of invariant points (where every point remains fixed) is a special subcase. Always verify by substituting back. The June 2019 paper included precisely such an invariance question, often worth 6~8 marks.
例如，若 M = [[3, 2], [2, 3]]，求解得 m² − 1 = 0，即 m = 1 或 m = −1。因此不变直线为 y = x 与 y = −x。有时会存在一条由不动点构成的直线（线上每点均保持不动），这是一种特殊情形。务必回代验证。2019年6月试卷恰好包含此类不变直线问题，通常分值在6到8分之间。
6. Roots of Polynomials – Sum, Product and Symmetric Expressions | 多项式根的关系 – 和、积与对称式
Given a cubic 2x³ + 3x² − x + 4 = 0 with roots α, β, γ, you are expected to use the relationships: Σα = α+β+γ = −b/a, Σαβ = αβ+βγ+γα = c/a, αβγ = −d/a. Here a=2, b=3, c=−1, d=4, so Σα = −3/2, Σαβ = −1/2, αβγ = −4/2 = −2. These underpin all subsequent calculations involving the roots.
已知三次方程 2x³ + 3x² − x + 4 = 0 的三个根为 α, β, γ，你需运用以下关系式： Σα = α+β+γ = −b/a，Σαβ = αβ+βγ+γα = c/a，αβγ = −d/a。此处 a=2, b=3, c=−1, d=4，因此 Σα = −3/2，Σαβ = −1/2，αβγ = −2。这是后续所有涉及根的运算的基础。
A typical follow-up asks for α² + β² + γ². Use the identity (Σα)² = Σα² + 2Σαβ, so Σα² = (Σα)² − 2Σαβ = (9/4) − (−1) = 13/4. Another common extension is to find the cubic with roots 2α, 2β, 2γ; simply apply the scaling substitution y = 2x. The new sum of roots is 2Σα = −3, sum of product pairs is 4Σαβ = −2, product is 8αβγ = −16, leading to y³ + 3y² − 2y + 16 = 0 after adjusting the leading coefficient.
常见的后续问题是求 α² + β² + γ²。利用恒等式 (Σα)² = Σα² + 2Σαβ，得 Σα² = (Σα)² − 2Σαβ = (9/4) − (−1) = 13/4。另一常见延伸是求以 2α, 2β, 2γ 为根的三次方程；直接做伸缩代换 y = 2x。新根之和为 2Σα = −3，两两积之和为 4Σαβ = −2，根之积为 8αβγ = −16，调整首项系数后可得 y³ + 3y² − 2y + 16 = 0。
7. Summation of Series – Using Standard Results | 数列求和 – 标准公式的运用
The FP1 paper invariably includes a series that requires splitting into known sums. You need the standard results: Σ₁ⁿ r = ½n(n+1), Σ₁ⁿ r² = ⅙ n(n+1)(2n+1), and Σ₁ⁿ r³ = ¼ n² (n+1)². A question might ask for Σ₁ⁿ r(r+1) = Σr² + Σr, which simplifies to ⅙ n(n+1)(2n+1) + ½ n(n+1) = ⅓ n(n+1)(n+2).
FP1试卷总是会包含一个需要拆分为已知基本求和公式的级数。你需要熟记标准结果：∑₁ⁿ r = ½ n(n+1)，∑₁ⁿ r² = ⅙ n(n+1)(2n+1)，以及 ∑₁ⁿ r³ = ¼ n² (n+1)²。题目可能会要求计算 ∑₁ⁿ r(r+1) = ∑r² + ∑r，合并后化简为 ⅙ n(n+1)(2n+1) + ½ n(n+1) = ⅓ n(n+1)(n+2)。
Always factorise fully and present your final answer in a factorised form. Examiners often want you to show that the sum is of the form (1/k) n(n+1)(n+2) and then deduce a specific value when n=50. Partial marks are awarded for using the correct standard formulae, even if subsequent algebra contains slips. Write each term clearly and factor stepwise.
始终要彻底因式分解，并以因式形式呈现最终答案。考官常常希望你将求和表示为 (1/k) n(n+1)(n+2) 的形式，然后据此推算如 n=50 的具体数值。即使后续代数化简有小错，只要正确使用了标准公式，就能拿到部分分数。清晰写出每一项，逐步提取公因式。
8. Proof by Induction – Summation of a Series | 数学归纳法证明 – 数列求和
Induction proofs follow a rigid structure that markers scan for. For a summation, first state the proposition P(n): Σ₁ⁿ r(r+2) = (1/3) n(n+1)(2n+7) (for example). Base case: n=1, LHS = 1×3 = 3, RHS = (1/3)(1)(2)(9) = 6? Wait, always verify with a realistic example from the paper. Suppose the claim is Σ₁ⁿ (2r − 1) = n². Base: n=1, LHS=1, RHS=1, true.
归纳法证明具有固定的结构，评卷人会据此采分。以数列求和为例，首先设命题 P(n)：∑₁ⁿ r(r+2) = (1/3) n(n+1)(2n+7)（仅为示例）。奠基步骤：n=1 时，左边 = 3，右边 = (1/3)(1)(2)(9) = 6？需先根据试卷核实。更稳妥的假设是：需证 ∑₁ⁿ (2r − 1) = n²。奠基：n=1，左边=1，右边=1，真。
Inductive step: assume true for n=k, so Σ₁ᵏ (2r − 1) = k². Consider n=k+1: LHS = Σ₁ᵏ (2r − 1) + (2(k+1)−1) = k² + 2k + 1 = (k+1)². This matches the RHS for n=k+1, so if P(k) is true, then P(k+1) is true. Since P(1) is true, by mathematical induction P(n) is true for all n ∈ ℕ. Always end with that conclusion statement, or you risk losing the final mark.
归纳步骤：假设 n=k 时真，即 ∑₁ᵏ (2r − 1) = k²。考虑 n=k+1：左边 = ∑₁ᵏ (2r − 1) + (2(k+1)−1) = k² + 2k + 1 = (k+1)²。这与 n=k+1 时的右边一致，故若 P(k) 真，则 P(k+1) 亦真。奠基已证 P(1) 真，由数学归纳法知对所有 n ∈ ℕ 命题成立。务必以此结论句结尾，否则可能丢掉最后一分。
9. Proof by Induction – Divisibility | 数学归纳法证明 – 整除性问题
Divisibility induction appears almost every year. Typical statements: prove 3²ⁿ − 1 is divisible by 8 for all positive integers n. Base case n=1: 3² − 1 = 8, divisible by 8. Inductive hypothesis: assume 3²ᵏ − 1 = 8m for some integer m. Then for n=k+1, 3²⁽ᵏ⁺¹⁾ − 1 = 9·3²ᵏ − 1 = 9(8m + 1) − 1 = 72m + 9 − 1 = 72m + 8 = 8(9m+1), which is a multiple of 8. Thus if true for k, true for k+1.
整除性归纳法几乎每年必考。典型命题：对所有正整数 n，证明 3²ⁿ − 1 能被 8 整除。奠基 n=1：3² − 1 = 8，可被8整除。归纳假设：设 3²ᵏ − 1 = 8m，m 为整数。则 n=k+1 时，3²⁽ᵏ⁺¹⁾ − 1 = 9·3²ᵏ − 1 = 9(8m + 1) − 1 = 72m + 9 − 1 = 72m + 8 = 8(9m+1)，显然为8的倍数。于是，若对 k 真，则对 k+1 真。
The crux is to express the (k+1) case in terms of the k case using algebraic manipulation. Always factor out the inductive expression (here, 3²ᵏ) to expose the assumption. Students often forget to state ‘multiple of 8’ explicitly, or incorrectly expand 3²⁽ᵏ⁺¹⁾ as 3²ᵏ + 3², which is a serious error. Write 3²⁽ᵏ⁺¹⁾ = 3²·3²ᵏ = 9·3²ᵏ and proceed.
关键是通过代数变形将 n=k+1 的情形用 n=k 的表达式表示出来。始终要提取出归纳式（此处为 3²ᵏ）以利用假设。学生常忘记明确指出 “是8的倍数”，或错误地将 3²⁽ᵏ⁺¹⁾ 展开为 3²ᵏ + 3²，这是严重错误。务必写为 3²⁽ᵏ⁺¹⁾ = 3²·3²ᵏ = 9·3²ᵏ 再继续。
10. Proof by Induction – Matrices | 数学归纳法证明 – 矩阵
Matrix induction is less common but possible at AS. Given M = [[1, 0], [1, 1]], prove by induction that Mⁿ = [[1, 0], [n, 1]] for n ∈ ℕ. Base case n=1: M¹ = [[1, 0], [1, 1]] which matches the formula with n=1. Assume Mᵏ = [[1, 0], [k, 1]]. Then Mᵏ⁺¹ = Mᵏ M = [[1, 0], [k, 1]] [[1, 0], [1, 1]] = [[1, 0], [k+1, 1]]. Hence true for k+1. The structural discipline is identical: base, assumption, step, conclusion.
矩阵归纳法虽不常见，但在AS阶段仍可能出现。已知 M = [[1, 0], [1, 1]]，用归纳法证明对所有 n ∈ ℕ 有 Mⁿ = [[1, 0], [n, 1]]。奠基 n=1：M¹ = [[1, 0], [1, 1]]，与 n=1 的公式吻合。假设 Mᵏ = [[1, 0], [k, 1]]，则 Mᵏ⁺¹ = Mᵏ M = [[1, 0], [k, 1]] [[1, 0], [1, 1]] = [[1, 0], [k+1, 1]]。因此对 k+1 亦真。格式纪律完全一致：奠基、假设、递推、结论。
Be comfortable multiplying matrices that contain algebraic entries. The only difference from summation induction is the operation: instead of adding the next term, you multiply by M. The June 2019 paper could well have included a matrix induction as part of a larger matrix transformation question, linking invariant lines or powers of a reflection matrix.
要能熟练地进行含有代数项的矩阵乘法。与求和归纳法的唯一区别是运算：不是加上下一项，而是右乘矩阵 M。2019年6月试卷完全可能把矩阵归纳法融入一道更大的矩阵变换题中，与不变直线或反射矩阵的幂次相衔接。
11. Complex Numbers – Polynomials with Real Coefficients | 复数 – 实系数多项式方程
A recurring theme is solving polynomials given a complex root. Since real polynomials have conjugate pairs, if 2 + i is a root, then 2 − i is also a root. You can then find the quadratic factor (z − (2+i))(z − (2−i)) = z² − 4z + 5. For a cubic with the third root α, equate coefficients or use polynomial division. This technique is essential for the 2019 paper’s more demanding complex number question.
一个反复出现的主题是已知复数根求解多项式。由于实系数多项式必有共轭成对的根，若 2 + i 是根，则 2 − i 也是根。然后可求出二次因式 (z − (2+i))(z − (2−i)) = z² − 4z + 5。对于已知第三根 α 的三次方程，可通过比较系数或多项式除法求解。这一方法对2019年试卷中较难的复数题而言至关重要。
Once you have the quadratic factor, use synthetic division or long division to deduce the remaining linear factor. Students often confuse the sum and product signs when building factors; remember that if α is a root, then (z − α) is a factor. When α is complex, handle brackets with care and use i² = −1 to simplify product terms. Show all steps to avoid sign slips.
得到二次因式后，使用综合除法或长除法求出剩余的一次因式。学生在构建因式时常常混淆和与积的符号
Published by TutorHao | AS Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导