📚 AS Edexcel Further Mathematics: Essay Writing Framework and Model Answers | AS Edexcel 进阶数学：论文写作框架与范文
In AS Edexcel Further Mathematics, many high-mark questions demand much more than a final numerical answer. They require a logical, step-by-step exposition that reads almost like a short essay. Whether you are proving a summation by induction, justifying a geometric relationship with vectors, or showing an algebraic identity with complex numbers, your written solution must guide the examiner through your reasoning with clarity and rigour. This article provides a structured writing framework and complete model answers for the most common proof-style topics, helping you score full marks on the long-form questions that distinguish top candidates.
在 AS Edexcel 进阶数学中，许多高分题目要求的远不止是一个最终数值答案。它们需要像一篇短论文那样进行逻辑的、循序渐进的展开。无论你是用归纳法证明求和公式、用向量论证几何关系，还是用复数展示代数恒等式，书面解答都必须清晰、严谨地带领阅卷人走过你的推理过程。本文针对最常见的证明类题型，提供一套系统的写作框架与完整的范文，帮助你在这类区分度极高的长篇题目中拿下满分。
1. Understanding the ‘Essay’ Style in Further Mathematics | 理解进阶数学中的“论文”式解答
While Further Mathematics is not assessed through traditional essays, many proof and derivation questions are marked for the quality of written communication. Edexcel mark schemes award method marks for logical structure, communication marks for clear notation and explanation, and final accuracy marks. A well-structured answer begins with defined variables, states the property to be proved, develops each step with justification, and ends with a concluding statement that mirrors the question. Treat every long proof as a miniature mathematical essay.
尽管进阶数学不采用传统的论文考试，但许多证明和推导题的评分标准包含对书面表达质量的评判。Edexcel 的评分方案会为逻辑结构给出方法分，为清晰记号和解释给出交流分，还有最终的准确性分。一份结构良好的答案应从定义变量开始，明确要证明的性质，每一步都给出依据，最后用一个与题目呼应的结论句收尾。要把每道长证明题都视为一篇微型数学论文。
2. The General Framework: Structure of a Mathematical Proof | 通用框架：数学证明的结构
A reliable proof framework contains five essential components. (1) Restate the goal: clarify precisely what must be shown. (2) List assumptions or given conditions. (3) Develop the chain of reasoning, referencing key theorems, definitions or algebraic manipulations. (4) Check for special cases, domain restrictions or edge conditions where necessary. (5) Conclude clearly, often using the original statement or the notation Q.E.D. Adhering to this structure ensures that your argument never becomes a jumble of unlabelled equations.
一个可靠的证明框架包含五个基本组成部分。（1）重述目标：明确要证明的精确对象。（2）列出已知条件或假设。（3）展开推理链，并引用关键定理、定义或代数运算。（4）必要时检验特例、定义域限制或边界情形。（5）清晰收尾，常用原命题的表述或记号 Q.E.D. 结尾。遵循这一结构可以避免论证变成一堆无标注的方程。
3. Framework and Example: Proof by Mathematical Induction | 框架与范例：数学归纳法证明
The induction essay framework is highly standardised. Begin with the base case (usually n = 1), verify the statement for that value. Then state the inductive hypothesis assuming the formula holds for n = k. Next, consider the case n = k + 1; use the hypothesis to rewrite the expression and reduce it algebraically to the same formula with k + 1 in place of n. Finally, write the concluding statement that since the base case is true and the inductive step holds, the formula is true for all positive integers n. Every equation must be labelled or introduced with a short phrase such as ‘Assume true for n = k, i.e.’.
归纳法论文框架高度规范。先处理基始情形（通常 n = 1），验证此时的命题成立。然后陈述归纳假设，即假设 n = k 时公式成立。接着考虑 n = k + 1 的情形；利用假设改写表达式，并通过代数运算将其约化为以 k+1 代替 n 的同一公式。最后写出结论：基始为真且归纳步骤成立，故公式对所有正整数 n 成立。每一个等式都应加以标注，或用一个简短短语引出，如 “Assume true for n = k, i.e.”。
Model Answer — Proving ∑r=1n r² = ¹⁄₆ n(n+1)(2n+1)
Let P(n) be the statement ∑r=1n r² = ¹⁄₆ n(n+1)(2n+1).
Base case n = 1: LHS = 1² = 1; RHS = ¹⁄₆(1)(2)(3) = 1. Hence P(1) is true.
Inductive hypothesis: Assume P(k) is true, i.e. ∑r=1k r² = ¹⁄₆ k(k+1)(2k+1).
Inductive step: For n = k+1, ∑r=1k+1 r² = ∑r=1k r² + (k+1)².
Substituting the hypothesis yields ¹⁄₆ k(k+1)(2k+1) + (k+1)². Factor (k+1): (k+1)[¹⁄₆ k(2k+1) + (k+1)].
Combine terms inside the bracket: ¹⁄₆ (2k² + k + 6k + 6) = ¹⁄₆ (2k² + 7k + 6). Factor the quadratic: ¹⁄₆ (k+2)(2k+3).
Thus the sum becomes ¹⁄₆ (k+1)(k+2)(2k+3), which is exactly ¹⁄₆ (k+1)((k+1)+1)(2(k+1)+1). So P(k+1) holds.
Conclusion: By mathematical induction, P(n) is true for all n ∈ ℕ.
令 P(n) 为命题 ∑r=1n r² = ¹⁄₆ n(n+1)(2n+1)。
基始 n = 1：LHS = 1² = 1；RHS = ¹⁄₆(1)(2)(3) = 1。故 P(1) 成立。
归纳假设：假设 P(k) 成立，即 ∑r=1k r² = ¹⁄₆ k(k+1)(2k+1)。
归纳步骤：考虑 n = k+1，∑r=1k+1 r² = ∑r=1k r² + (k+1)²。
代入假设得 ¹⁄₆ k(k+1)(2k+1) + (k+1)²。提取 (k+1)：(k+1)[¹⁄₆ k(2k+1) + (k+1)]。
合并括号内的项：¹⁄₆ (2k² + k + 6k + 6) = ¹⁄₆ (2k² + 7k + 6)。因式分解二次式：¹⁄₆ (k+2)(2k+3)。
于是总和化为 ¹⁄₆ (k+1)(k+2)(2k+3)，恰好是 ¹⁄₆ (k+1)((k+1)+1)(2(k+1)+1)。因而 P(k+1) 成立。
结论：由数学归纳法，P(n) 对所有 n ∈ ℕ 成立。
4. Framework and Example: Complex Number Arguments | 框架与范例：复数论证
Proofs in the complex plane often involve moduli, arguments, and Euler’s or de Moivre’s forms. The writing framework must define the complex numbers explicitly: let z = x + iy or use polar form z = r(cosθ + i sinθ). State the property to be proved, e.g. |z₁z₂| = |z₁||z₂| or (cosθ + i sinθ)ⁿ = cos nθ + i sin nθ. Apply known identities, expand products carefully, and use trigonometric addition formulas or Pythagoras when simplifying. The final line should restate the result in the required form.
复数证明通常涉及模、辐角以及欧拉公式或棣莫弗公式。写作框架必须明确定义复数：设 z = x + iy 或使用极形式 z = r(cosθ + i sinθ)。陈述要证明的性质，例如 |z₁z₂| = |z₁||z₂| 或 (cosθ + i sinθ)ⁿ = cos nθ + i sin nθ。运用已知恒等式，仔细展开乘积，化简时利用三角加法公式或勾股定理。最后一行应以所要求的形式重述结果。
Model Answer — Proving de Moivre’s theorem for positive integer powers
Let z = cosθ + i sinθ. We prove by induction that zⁿ = cos nθ + i sin nθ for n ∈ ℕ.
Base case n = 1: trivial, z¹ = cosθ + i sinθ.
Inductive hypothesis: assume zᵏ = cos kθ + i sin kθ.
Then zᵏ⁺¹ = zᵏ ⋅ z = (cos kθ + i sin kθ)(cosθ + i sinθ).
Expand: = cos kθ cosθ − sin kθ sinθ + i(sin kθ cosθ + cos kθ sinθ).
By compound-angle formulas: cos kθ cosθ − sin kθ sinθ = cos(k+1)θ, and sin kθ cosθ + cos kθ sinθ = sin(k+1)θ.
Therefore zᵏ⁺¹ = cos(k+1)θ + i sin(k+1)θ, completing the induction. The theorem holds for all n ∈ ℕ.
设 z = cosθ + i sinθ。我们通过归纳法证明对 n ∈ ℕ 有 zⁿ = cos nθ + i sin nθ。
基始 n = 1：显然，z¹ = cosθ + i sinθ。
归纳假设：假设 zᵏ = cos kθ + i sin kθ。
那么 zᵏ⁺¹ = zᵏ ⋅ z = (cos kθ + i sin kθ)(cosθ + i sinθ)。
展开：= cos kθ cosθ − sin kθ sinθ + i(sin kθ cosθ + cos kθ sinθ)。
利用复合角公式：cos kθ cosθ − sin kθ sinθ = cos(k+1)θ，且 sin kθ cosθ + cos kθ sinθ = sin(k+1)θ。
因此 zᵏ⁺¹ = cos(k+1)θ + i sin(k+1)θ，归纳完成。该定理对所有 n ∈ ℕ 成立。
5. Framework and Example: Matrix Proofs | 框架与范例：矩阵证明
Matrix proofs in AS Further Mathematics often involve associativity, invertibility, or special properties like A(adj A) = (adj A)A = |A| I. The writing structure must declare the size of each matrix and whether entries are real. When proving identities such as (AB)⁻¹ = B⁻¹ A⁻¹, state the definition of an inverse (M M⁻¹ = I) and multiply the candidate matrix with AB. Show both (AB)(B⁻¹A⁻¹) = I and (B⁻¹A⁻¹)(AB) = I, then conclude by the uniqueness of the inverse. Always reference the rules of matrix multiplication and the identity matrix explicitly.
AS 进阶数学中的矩阵证明常涉及结合律、可逆性或 A(adj A) = (adj A)A = |A| I 等特殊性质。写作结构必须申明每个矩阵的阶以及元素是否为实数。在证明 (AB)⁻¹ = B⁻¹ A⁻¹ 等恒等式时，应陈述逆的定义（M M⁻¹ = I），并将候选矩阵与 AB 相乘。要展示 (AB)(B⁻¹A⁻¹) = I 和 (B⁻¹A⁻¹)(AB) = I，然后依据逆的唯一性得出结论。务必明确引用矩阵乘法规则和单位矩阵。
Model Answer — Proving (AB)⁻¹ = B⁻¹ A⁻¹ for invertible n×n matrices
Let A and B be invertible n × n matrices. By definition, there exist A⁻¹ and B⁻¹ such that AA⁻¹ = A⁻¹A = I and BB⁻¹ = B⁻¹B = I.
Consider the product (AB)(B⁻¹A⁻¹). Using associativity: = A(BB⁻¹)A⁻¹ = A I A⁻¹ = AA⁻¹ = I.
Similarly, (B⁻¹A⁻¹)(AB) = B⁻¹(A⁻¹A)B = B⁻¹ I B = B⁻¹B = I.
Thus B⁻¹A⁻¹ satisfies both conditions of the inverse of AB. Since the inverse of a matrix is unique, it follows that (AB)⁻¹ = B⁻¹A⁻¹.
设 A 和 B 为可逆的 n × n 矩阵。由定义，存在 A⁻¹ 和 B⁻¹ 使得 AA⁻¹ = A⁻¹A = I 且 BB⁻¹ = B⁻¹B = I。
考察乘积 (AB)(B⁻¹A⁻¹)。利用结合律：= A(BB⁻¹)A⁻¹ = A I A⁻¹ = AA⁻¹ = I。
同理，(B⁻¹A⁻¹)(AB) = B⁻¹(A⁻¹A)B = B⁻¹ I B = B⁻¹B = I。
于是 B⁻¹A⁻¹ 满足 AB 之逆的两个条件。矩阵的逆唯一，故 (AB)⁻¹ = B⁻¹A⁻¹。
6. Framework and Example: Vector Geometry | 框架与范例：向量几何
Vector proof questions typically ask you to show collinearity, concurrency, or the position of a point. Begin by assigning vectors to given points, e.g. a = OA, b = OB. Express the vector connecting two points, such as AB = b − a. State the condition to prove, e.g. AB = λ BC for collinearity. Manipulate using scalar multiples, section formula, or dot/cross products as required. Where geometry is involved, a clear diagram label referenced in the text helps the examiner follow your notation, even though the diagram itself may not gain marks.
向量证明题通常会要求证明共线、共点或某点的位置。从为给定点赋予向量开始，如 a = OA, b = OB。表示连接两点的向量，例如 AB = b − a。陈述要证明的条件，如共线需 AB = λ BC。根据需要使用标量倍数、分点公式或点积/叉积进行推导。涉及几何时，虽然在文字中提及图示不会直接得分，但一个清晰的图示标注有助阅卷人理解你的记号。
Model Answer — Proving points A, B, C are collinear
Let OA = a, OB = b, OC = c, with a = 2i + j, b = 5i − 2j, c = 8i − 5j.
Vector AB = b − a = (5−2)i + (−2−1)j = 3i − 3j.
Vector BC = c − b = (8−5)i + (−5−(−2))j = 3i − 3j.
Hence AB = 1 × BC, so AB and BC are parallel. Since B is a common point, A, B and C lie on the same straight line. Therefore the three points are collinear.
设 OA = a, OB = b, OC = c，其中 a = 2i + j, b = 5i − 2j, c = 8i − 5j。
向量 AB = b − a = (5−2)i + (−2−1)j = 3i − 3j。
向量 BC = c − b = (8−5)i + (−5−(−2))j = 3i − 3j。
因此 AB = 1 × BC，即 AB 与 BC 平行。因 B 为公共点，A, B, C 位于同一直线上。故三点共线。
7. Framework and Example: Differential Equations | 框架与范例：微分方程
Questions on solving first-order linear differential equations are often presented in a structured format, but the essay-writing skill lies in justifying each step of the integrating factor method. Start by identifying the standard form dy/dx + P(x)y = Q(x). State the integrating factor I.F. = e∫P dx. Multiply the entire equation by the I.F. and recognise the left-hand side as the derivative of y × I.F. Integrate both sides, remembering the constant of integration, and apply initial conditions if given. Finish by writing the explicit solution for y.
一阶线性微分方程的求解题往往以结构化形式出现，但论文写作的关键在于为积分因子法的每一步提供依据。首先将方程化为标准形 dy/dx + P(x)y = Q(x)。写出积分因子 I.F. = e∫P dx。以积分因子乘全方程，并将左端识别为 y × I.F. 的导数。两边积分，记住加上积分常数；若给定初始条件则代入。最后写出 y 的显式解。
Model Answer — Solving dy/dx + 2xy = x, y(0)=1
Rewrite as dy/dx + 2x⋅y = x. Here P(x)=2x, Q(x)=x.
Integrating factor μ = e∫2x dx = ex².
Multiply through by ex²: ex² dy/dx + 2x ex² y = x ex².
The left side is d/dx (y ex²). Hence d/dx (y ex²) = x ex².
Integrate both sides: y ex² = ∫ x ex² dx.
Let u = x², du = 2x dx, so ∫ x ex² dx = ½ ∫ eu du = ½ ex² + C.
Thus y ex² = ½ ex² + C, giving y = ½ + C e−x².
Apply y(0)=1: 1 = ½ + C⋅1 ⇒ C = ½.
Particular solution: y = ½ + ½ e−x² = ½(1 + e−x²).
将原方程写为 dy/dx + 2x⋅y = x。此处 P(x)=2x, Q(x)=x。
积分因子 μ = e∫2x dx = ex²。
以 ex² 乘全式：ex² dy/dx + 2x ex² y = x ex²。
左端为 d/dx (y ex²)。因此 d/dx (y ex²) = x ex²。
两边积分：y ex² = ∫ x ex² dx。
令 u = x²，du = 2x dx，得 ∫ x ex² dx = ½ ∫ eu du = ½ ex² + C。
于是 y ex² = ½ ex² + C，推出 y = ½ + C e−x²。
代入 y(0)=1：1 = ½ + C⋅1 ⇒ C = ½。
特解：y = ½ + ½ e−x² = ½(1 + e−x²)。
8. Common Pitfalls and Examiner Advice | 常见错误与考官建议
Examiners frequently report that candidates lose marks by omitting the concluding statement in an induction proof, failing to justify closure of an algebraic step, or writing det(A) when the matrix is not square. Avoid ‘proof by example’ – verifying a claim for one or two cases does not constitute a general proof. Use correct notation: distinguish vector scalars from vectors (bold or underlined), and always mention domain restrictions (e.g. n ∈ ℤ⁺, x ∈ ℝ). Where a proof requires splitting into cases (e.g. even/odd), label them clearly. Finally, re-read your proof to ensure it flows from hypothesis to conclusion without logical leaps; each line should be a natural consequence of the previous one.
考官经常报告，考生因缺少归纳法的结论句、未给出代数步骤的闭合理由或在非方阵中错误地写 det(A) 而失分。避免“举例证明”——为一两个特例验证并不能构成一般性证明。使用正确记号：区分向量标量与向量本身（加粗或加下划线），并务必注明定义域限制（如 n ∈ ℤ⁺, x ∈ ℝ）。当证明需要分情形（奇数/偶数）时，应清楚标注。最后，重读你的证明，确保其从假设到结论没有逻辑跳跃；每一行都应是前一行的自然结果。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导