📚 AS Further Mathematics Unit 1 – June 2019 Paper Key Concepts | AS进阶数学单元1（2019年6月）知识点精讲
The June 2019 AS Further Mathematics Unit 1 paper tests core pure topics essential for the qualification. This article breaks down the key concepts covered in that paper, offering detailed explanations, worked examples, and revision tips to help students master the content. Understanding these areas will not only help with past papers but also build a solid foundation for full A Level Further Mathematics.
2019年6月的AS进阶数学单元1试卷考察了取得该资格所需的核心纯数知识点。本文对该试卷所涵盖的关键概念进行拆解，提供详细解释、解题示例和复习技巧，帮助学生掌握这些内容。理解这些领域不仅有助于应对历年真题，还能为完整的A Level进阶数学打下坚实基础。
1. Complex Numbers | 复数
Complex numbers are numbers of the form z = a + bi, where i² = –1. The June 2019 paper required students to perform arithmetic with complex numbers, find the modulus |z| = √(a² + b²) and argument arg(z), and represent them on an Argand diagram. Solving quadratic equations with complex roots and understanding the conjugate z* = a – bi were also essential.
复数是形如 z = a + bi 的数，其中 i² = –1。2019年6月的试卷要求学生进行复数运算、求模 |z| = √(a² + b²) 和辐角 arg(z)，并在阿干德图上表示它们。解具有复数根的二次方程以及理解共轭复数 z* = a – bi 也是必需的。
Typical exam tasks included computing (3 + 4i)(1 – 2i), finding the exact values of sin or cos of an argument, and interpreting loci such as |z – 2| = 3 or arg(z – i) = π/4. For loci problems, draw a clear sketch and use geometric reasoning to identify circles or half-lines.
典型试题包括计算 (3 + 4i)(1 – 2i)、求辐角的正弦或余弦的精确值，以及解释如 |z – 2| = 3 或 arg(z – i) = π/4 的轨迹。处理轨迹问题时，先画出清晰示意图，并利用几何推理识别圆或半直线。
|z| = √(a² + b²) arg(z) = θ where tan θ = b/a, with quadrant checks
|z| = √(a² + b²) arg(z) = θ，其中 tan θ = b/a，并需进行象限判断
2. Matrices and Determinants | 矩阵与行列式
The paper tested operations with 2×2 matrices, including multiplication, addition, and finding determinants and inverses. For matrix M = [
| a | b |
| c | d |
], det M = ad – bc; the inverse is (1/det M)[
| d | –b |
| –c | a |
]. Students had to solve systems of linear equations using matrix algebra and interpret cases where the determinant is zero (no unique solution).
试卷考察了2×2矩阵的运算，包括乘法、加法、求行列式与逆矩阵。对于矩阵 M = [
| a | b |
| c | d |
]，det M = ad – bc；逆矩阵为 (1/det M)[
| d | –b |
| –c | a |
]。学生需要用矩阵代数解线性方程组，并解释行列式为零的情况（无唯一解）。
Common mistake: forgetting to multiply the 1/det factor or misapplying the sign pattern. Practice finding the inverse and verifying that M × M⁻¹ = I. The 2019 paper also linked matrices to geometric transformations, which we discuss later.
常见错误：忘记乘上1/det因子或弄错符号规律。请练习求逆矩阵并验证 M × M⁻¹ = I。2019年试卷还将矩阵与几何变换联系起来，我们稍后讨论。
3. Mathematical Induction | 数学归纳法
Proof by induction is a standard topic. The June 2019 paper likely featured a divisibility or summation induction. The structure is always: base case (n = 1), assume true for n = k, then prove for n = k + 1. For summation, you add the (k+1)th term; for divisibility, express f(k+1) in terms of f(k) plus a multiple of the divisor.
归纳证明是常规主题。2019年6月的试卷很可能包含可除性或求和归纳。其结构始终为：基础情形 (n = 1)，假设 n = k 时成立，然后证明 n = k + 1 时也成立。对于求和，需加上第(k+1)项；对于可除性，将 f(k+1) 表示为 f(k) 加上除数的倍数。
E.g., prove that 3²ⁿ – 1 is divisible by 8 for all positive integers n. Show base case 9–1=8 ✓. Assume 3²ᵏ – 1 = 8m. Then 3²⁽ᵏ⁺¹⁾ – 1 = 9·3²ᵏ – 1 = 9(8m + 1) – 1 = 72m + 8 = 8(9m+1), hence divisible by 8. Always write a concluding sentence.
例如，证明对所有正整数 n，3²ⁿ – 1 可被8整除。验证基础情形 9–1=8 ✓。假设 3²ᵏ – 1 = 8m。那么 3²⁽ᵏ⁺¹⁾ – 1 = 9·3²ᵏ – 1 = 9(8m + 1) – 1 = 72m + 8 = 8(9m+1)，因此可被8整除。务必写上总结语句。
Σr = n(n+1)/2, Σr² = n(n+1)(2n+1)/6, Σr³ = [n(n+1)/2]²
Σr = n(n+1)/2, Σr² = n(n+1)(2n+1)/6, Σr³ = [n(n+1)/2]²
4. Summation of Series | 级数求和
Questions typically use standard results for Σr, Σr², Σr³ to sum more complex series such as Σ(r² + 3r – 2). Break the sum into separate parts, apply the standard formulas, and simplify algebraically. The method of differences also appears: express a term as a difference f(r) – f(r+1) so that most terms cancel, leaving only the first and last parts.
试题通常利用 Σr、Σr²、Σr³ 的标准结果来求更复杂级数的和，例如 Σ(r² + 3r – 2)。将求和拆分成几个部分，应用标准公式并进行代数简化。差分法也会出现：将项表示为 f(r) – f(r+1) 的差，使得大多数项相消，仅留下首尾部分。
For method of differences, a common form is 1/(r(r+1)) = 1/r – 1/(r+1). Summing from r=1 to n gives 1 – 1/(n+1). Always check that the cancellation is correct and state the final expression in simplest form.
在差分法中，常见的形式是 1/(r(r+1)) = 1/r – 1/(r+1)。从 r=1 加到 n 得到 1 – 1/(n+1)。务必检查消去是否正确，并将最终表达式化为最简形式。
5. Roots of Polynomial Equations | 多项式方程的根
Given a quadratic ax² + bx + c = 0 with roots α and β, the relationships are α + β = –b/a and αβ = c/a. The paper may ask to find symmetric functions like α² + β², α³ + β³, or form a new equation whose roots are transformed, e.g., 2α+1, 2β+1. The key is to express everything in terms of sum and product of the original roots.
已知二次方程 ax² + bx + c = 0 的根为 α 和 β，则关系式为 α + β = –b/a 和 αβ = c/a。试卷可能要求求出对称函数，如 α² + β²、α³ + β³，或者构造一个新方程，其根为原根的变换，例如 2α+1、2β+1。关键在于用原根的和与积表示一切。
For cubic equations, similar relationships exist: Σα = –b/a, Σαβ = c/a, αβγ = –d/a. A typical question might provide one root and ask for the others, or require you to find Σα² = (Σα)² – 2Σαβ. Always handle signs carefully when moving between coefficients and sums.
对于三次方程，也有类似关系：Σα = –b/a, Σαβ = c/a, αβγ = –d/a。典型的问题可能给出一个根并要求求出其余根，或者要求计算 Σα² = (Σα)² – 2Σαβ。在系数与和之间转换时，务必小心处理符号。
6. Numerical Methods – Iteration | 数值方法——迭代法
The Newton-Raphson method and fixed-point iteration are tested. Newton-Raphson uses xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ) to locate roots. Students must derive the iteration formula from a given function, perform iterations, and understand when the method fails (e.g., f'(x) near zero). Fixed-point iteration rearranges f(x)=0 into x = g(x), then iterates xₙ₊₁ = g(xₙ); convergence requires |g'(x)| < 1 near the root.
牛顿-拉弗森法和不动点迭代法是考察内容。牛顿-拉弗森法使用公式 xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ) 来寻找根。学生须从给定函数推导迭代公式，进行迭代，并理解该方法何时失效（例如 f'(x) 接近零）。不动点迭代将 f(x)=0 重新排列为 x = g(x)，然后迭代 xₙ₊₁ = g(xₙ)；收敛要求在根附近 |g'(x)| < 1。
Rounding and stopping criteria are important: the paper expects iterations to a specified degree of accuracy, often to 4 decimal places. Always use the correct initial value and check for convergence by comparing successive approximations.
舍入和停止标准很重要：试卷要求迭代达到指定的精度，通常为4位小数。务必使用正确的初始值，并通过比较逐次近似值来检验收敛性。
xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ)
xₙ₊₁ = xₙ – f(xₙ)/f'(xₙ)
7. Coordinate Geometry – Conic Sections | 坐标几何——圆锥曲线
The Further Pure syllabus includes the parabola with equation y² = 4ax and the rectangular hyperbola xy = c². The 2019 paper likely examined parametric form of the parabola (at², 2at) and the hyperbola (ct, c/t). Students need to find equations of tangents and normals, and work with chords and geometric properties.
进阶纯数大纲包括抛物线 y² = 4ax 和直角双曲线 xy = c²。2019年试卷很可能考查了抛物线的参数形式 (at², 2at) 和双曲线的参数形式 (ct, c/t)。学生需要求出切线和法线方程，并处理弦及几何性质。
For the parabola, the tangent at t has equation yt = x + at²; the normal is y + tx = 2at + at³. For the hyperbola, the tangent at t is x/t + yt = 2c. Deriving these from differentiation of parametric equations is a key skill. Be prepared to find points of intersection and prove certain properties, e.g., the mid-point of a chord.
对于抛物线，在 t 处的切线方程为 yt = x + at²；法线方程为 y + tx = 2at + at³。对于双曲线，在 t 处的切线方程为 x/t + yt = 2c。通过参数方程微分推导这些方程是一项关键技能。要准备好求交点并证明某些性质，例如弦的中点。
8. Matrix Transformations | 矩阵变换
Matrix multiplication can represent linear transformations in the plane: rotations, reflections, stretches, and shears. The 2019 paper expected students to identify the transformation given a 2×2 matrix, find the image of a point or line, and combine transformations via matrix products. Common matrices include rotation by θ: [
| cosθ | –sinθ |
| sinθ | cosθ |
], and reflection in the x-axis: [
| 1 | 0 |
| 0 | –1 |
].
矩阵乘法可以表示平面上的线性变换：旋转、反射、拉伸和错切。2019年试卷要求学生根据给定的2×2矩阵识别变换，求出点或直线的像，并通过矩阵乘积来组合变换。常见的矩阵包括旋转 θ 角：[
| cosθ | –sinθ |
| sinθ | cosθ |
]，以及关于 x 轴的反射：[
| 1 | 0 |
| 0 | –1 |
]。
When applying a transformation to a curve, substitute the inverse transformation equations. For a matrix M, a point (x, y) is mapped to (x’, y’) where [x’; y’] = M[x; y]. If the determinant of M is negative, the transformation reverses orientation. A common task is to show that a particular matrix represents a stretch scale factor k parallel to a line.
对曲线施加变换时，代入逆变换方程。对于矩阵 M，点 (x, y) 被映射为 (x’, y’)，其中 [x’; y’] = M[x; y]。若 M 的行列式为负，则该变换会翻转定向。常见的任务是证明某个特定矩阵表示平行于某一直线、缩放因子为 k 的拉伸变换。
9. Inequalities and Modulus | 不等式与绝对值
Solving inequalities involving modulus or rational functions was a feature of the 2019 syllabus. Techniques include squaring both sides for |f(x)| < a, considering critical points for rational inequalities, and using sign tables or graphical methods. Always state the solution in interval notation or set builder form.
求解涉及绝对值或有理函数的不等式是2019年大纲的特点。技巧包括：对于 |f(x)| < a，两边平方；对于有理不等式，考虑临界点并使用符号表或图形法。始终用区间记号或集合生成式陈述解集。
Example: solve |2x – 3| ≤ 5. This gives –5 ≤ 2x – 3 ≤ 5 → –2 ≤ 2x ≤ 8 → –1 ≤ x ≤ 4. For rational inequalities like (x+1)/(x–2) > 0, find where numerator and denominator change sign, and test intervals. Never multiply by a denominator whose sign is unknown.
示例：求解 |2x – 3| ≤ 5。得到 –5 ≤ 2x – 3 ≤ 5 → –2 ≤ 2x ≤ 8 → –1 ≤ x ≤ 4。对于有理不等式如 (x+1)/(x–2) > 0，要找出分子和分母变号的点，并检验区间。切忌乘以一个符号未知的分母。
10. Further Algebraic Manipulation | 进阶代数运算
This encompasses partial fractions, especially with repeated linear factors, and simplifying rational expressions. The unit tests the ability to decompose a fraction like (3x+5)/((x+1)(x–2)) into A/(x+1) + B/(x–2) and use the result for summation or integration in later units. Already at AS, you may encounter series expansions of rational functions after decomposition.
这包括部分分式，特别是带有重复一次因式的情况，以及简化有理表达式。本单元测试将分式如 (3x+5)/((x+1)(x–2)) 分解为 A/(x+1) + B/(x–2) 的能力，并在后续单元中用于求和或积分。即使在AS阶段，分解后也可能遇到有理函数的级数展开。
Covering identities and comparing coefficients is a key algebraic skill. For example, to find constants P, Q, R in an identity, equate coefficients of like terms on both sides after clearing denominators. Always check your decomposition by combining the partial fractions back.
利用恒等式比较系数是一项关键的代数技能。例如，要在恒等式中求出常数 P、Q、R，可在消去分母后，让两边同类项的系数相等。始终通过将部分分式重新合并来检验你的分解结果。
11. The Argand Diagram and Loci | 阿干德图与轨迹
Extending complex numbers, loci on the Argand diagram are frequently examined. |z – a| = r represents a circle centre a and radius r; arg(z – a) = θ is a half-line from a, making angle θ with the positive real axis. The line segment between two points can be described by |z – z₁| = |z – z₂| (perpendicular bisector). Complex loci can intersect, so students must find intersection points using algebraic or geometric methods.
作为复数的延伸，阿干德图上的轨迹是常考内容。|z – a| = r 表示以 a 为圆心、r 为半径的圆；arg(z – a) = θ 是从 a 出发、与正实轴成 θ 角的半直线。两点间的垂直平分线可用 |z – z₁| = |z – z₂| 描述。复数轨迹可能相交，学生须用代数或几何方法求出交点。
A typical question: sketch the locus |z – 3| = |z + i| and find its Cartesian equation. This yields a line. Then find where it meets |z| = 2. Substitute y = mx + c or use simultaneous equations with x² + y² = 4. Practice drawing clear diagrams and shading regions for inequalities like |z – 2| < 3 and arg(z) > π/4.
典型问题：画出轨迹 |z – 3| = |z + i| 并求出其笛卡尔方程。结果是一条直线。然后求它与 |z| = 2 的交点。代入 y = mx + c 或与 x² + y² = 4 联立。练习画出清晰的示意图，并对诸如 |z – 2| < 3 和 arg(z) > π/4 的不等式区域进行着色。
12. Exam Technique and Final Tips | 考试技巧与最终建议
Work systematically through the paper, allocating time wisely. Show full working because marks are awarded for method. For induction, state explicitly ‘true for n = k+1 if true for n = k’. For numerical methods, maintain high precision until the final answer then round. When sketching loci, label key points and write equations clearly. Review standard formula booklet entries: the summation formulas and matrix inverses are given but you must know how to use them.
有条不紊地完成试卷，合理分配时间。写出完整步骤，因为方法有分。对于归纳法，要明确陈述“若 n = k 成立则 n = k+1 亦成立”。在数值方法中，在最终答案之前保持高精度，然后再舍入。画轨迹图时，标出关键点并清楚地写出方程。复习标准公式册中的条目：求和公式和矩阵的逆会提供，但你必须知道如何使用它们。
If you get stuck on an algebra step, re‑check sign and substitution errors. The 2019 paper contains a mix of routine and problem‑solving elements; practising past papers under timed conditions is the best preparation. Understanding the concepts in this article will help you approach any Unit 1 paper with confidence.
如果在代数步骤上卡住，重新核查符号和代入错误。2019年的试卷混合了常规题和问题解决型题目；在计时条件下练习历年真题是最佳的备考方式。理解本文中的概念将有助于你自信地应对任何单元1试卷。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply