📚 AS CAIE Further Mathematics: Essay Writing Framework and Model Answers | AS CAIE 进阶数学：论文写作框架与范文
In AS CAIE Further Mathematics, the ability to present a clear, logically structured argument is just as important as performing calculations. Many questions, especially proof and explanation tasks, require extended written responses that resemble short essays. This article provides a practical framework for constructing these responses and walks through annotated model answers to help you secure full marks in the written communication components of Papers 1 and 2.
在 AS CAIE 进阶数学考试中，清晰、逻辑严密的论证表达能力与计算能力同等重要。许多题目——尤其是证明与解释类——要求写出类似于小论文的扩展答案。本文提供了构建这类答案的实用框架，并通过带注释的范文，帮助你稳拿卷一卷二中书面表达部分的满分。
1. Understanding the Question and Planning | 理解题目与规划思路
Before writing a single line, identify the command word: 'Prove', 'Show that', 'Disprove', 'Determine', or 'Explain'. Each requires a different approach. A 'Prove' question expects a formal chain of logical deductions; 'Show that' asks you to verify a given result with clear working; 'Explain' calls for a descriptive, jargon-accurate paragraph. Spend one minute planning the skeleton of your argument on the question paper margin.
动笔之前，先识别题目中的指令词：'Prove'（证明）、'Show that'（求证）、'Disprove'（证伪）、'Determine'（确定）或 'Explain'（解释）。不同指令要求不同的写作方式。'Prove' 需要一条形式化的逻辑推理链；'Show that' 要求你通过清晰的步骤验证给定结果；'Explain' 则要求用准确术语写一段描述性文字。花一分钟在试卷边缘规划论证的骨架。
2. Common Proof Structures in AS Further Maths | AS 进阶数学中的常见证明结构
Most essay-style answers fall into three categories: direct proof, proof by induction, and proof by contradiction. A direct proof starts from a known fact and progresses via algebraic manipulation or known theorems to the conclusion. Induction is the go-to method for statements involving all natural numbers n. Contradiction assumes the negation of the statement and derives an impossibility. Recognising which structure to use is half the battle.
大多数论文类答案属于三类：直接证明、归纳法证明和反证法。直接证明从已知事实出发，通过代数变形或已知定理逐步推出结论。归纳法是处理涉及所有自然数 n 的命题的首选方法。反证法则先假设命题的否定成立，然后推导出矛盾。能识别使用哪种结构，就已经成功了一半。
3. Direct Proof Writing Framework | 直接证明的写作框架
A direct proof should be presented as a flowing narrative. Start by stating what is given. Use connecting words such as 'hence', 'therefore', 'since', and 'thus' to show logical flow. Every algebraic step should be justified briefly: 'Using the identity sin²θ + cos²θ ≡ 1' or 'By the recurrence relation'. End with a clear concluding statement that mirrors the original claim, often introduced by 'Hence, it is proved that...'.
直接证明应当以流畅的叙述方式呈现。开头先说明已知条件。使用 'hence'、'therefore'、'since'、'thus' 等连接词展示逻辑流向。每一步代数操作都要简要注明理由，例如 'Using the identity sin²θ + cos²θ ≡ 1' 或 'By the recurrence relation'。结尾用一句清晰的总结句呼应原命题，常见于 'Hence, it is proved that...'。
4. Proof by Induction – Step-by-Step Guide | 归纳法证明的分步指南
Induction answers in CAIE exams must follow a strict four-part template to earn full credit:
- Base case: Verify the statement for the smallest value of n (usually n = 1).
- Induction hypothesis: Assume the statement is true for n = k.
- Inductive step: Prove the statement for n = k + 1 using the hypothesis.
- Conclusion: State that by mathematical induction, the statement is true for all n ∈ ℕ.
CAIE 考试中的归纳法答案必须遵循严格的四部分模板才能获得全部分数：
- 基础情形：验证最小 n 值（通常 n = 1）时命题成立。
- 归纳假设：假设 n = k 时命题为真。
- 归纳步骤：利用假设证明 n = k + 1 时命题成立。
- 结论：声明根据数学归纳法，命题对所有 n ∈ ℕ 成立。
In the induction step, always clearly indicate where the hypothesis is used. A typical sentence is: 'By the induction assumption, ...', then substitute and simplify to reach the target form for k+1.
在归纳步骤中，务必明确标出假设的使用位置。常用的句式是：'By the induction assumption, ...'，然后代入并化简，得到关于 k+1 的目标形式。
5. Proof by Contradiction Framework | 反证法框架
To construct a contradiction proof, begin with the sentence: 'Assume the opposite, that ...'. Then logically work forward until you reach a statement that is clearly false, such as 'an even number equals an odd number' or 'a rational equals an irrational'. At that point, write: 'This is a contradiction. Hence our assumption is false, and the original statement must be true.' This structure is highly standardised and examiners reward it.
构建反证法证明时，开篇写：'Assume the opposite, that ...'。然后进行逻辑推理，直至碰到明显谬误的陈述，例如 'an even number equals an odd number' 或 'a rational equals an irrational'。此时，写出：'This is a contradiction. Hence our assumption is false, and the original statement must be true.' 这种结构高度标准化，阅卷人会给予认可。
6. Tackling 'Show that' and 'Explain' Questions | 应对 'Show that' 与 'Explain' 类题目
'Show that' questions often appear in topics like polar coordinates or differential equations. Your answer must be a clean chain of equalities leading precisely to the printed result. Avoid skipping steps; even if a manipulation seems trivial, write it down. For 'Explain' questions, such as describing the effect of a transformation on a matrix, use full sentences and correct terminology like 'invariant line', 'shear parallel to the x-axis', or 'eigenvalue', and supplement with a simple sketch when helpful.
'Show that' 类题目常出现在极坐标或微分方程等章节。答案必须是一连串整洁的等式，准确导向给定的结果。避免跳步；哪怕一个变形看起来再简单，也要写出来。对于 'Explain' 类题目，比如描述一个矩阵变换的效果，要用完整的句子和正确的术语，如 'invariant line'、'shear parallel to the x-axis'、'eigenvalue'，并在有助于说明时辅以简图。
7. Model Answer 1: Proof by Induction (Summation) | 范文 1：归纳法证明（求和）
Question: Prove by induction that for all n ∈ ℕ, ∑ᵣ₌₁ⁿ r(r+1) = ⅓ n(n+1)(n+2).
题目：用归纳法证明，对所有 n ∈ ℕ，∑ᵣ₌₁ⁿ r(r+1) = ⅓ n(n+1)(n+2)。
Model Answer:
Let P(n) be the statement: ∑ᵣ₌₁ⁿ r(r+1) = ⅓ n(n+1)(n+2).
范文：
设 P(n) 表示命题：∑ᵣ₌₁ⁿ r(r+1) = ⅓ n(n+1)(n+2)。
Base case n=1: LHS = 1×2 = 2. RHS = ⅓×1×2×3 = 2. So P(1) is true.
基础情形 n=1：左边 = 1×2 = 2。右边 = ⅓×1×2×3 = 2。因此 P(1) 为真。
Induction hypothesis: Assume P(k) holds for some k ≥ 1, so ∑ᵣ₌₁ᵏ r(r+1) = ⅓ k(k+1)(k+2).
归纳假设：假设对某个 k ≥ 1，P(k) 成立，即 ∑ᵣ₌₁ᵏ r(r+1) = ⅓ k(k+1)(k+2)。
= (k+1)(k+2)[⅓ k + 1] = (k+1)(k+2)( (k+3)/3 ) = ⅓ (k+1)(k+2)(k+3). This is exactly RHS with n = k+1. So P(k) ⇒ P(k+1).
考虑 n = k+1：左边 = ∑ᵣ₌₁ᵏ⁺¹ r(r+1) = [∑ᵣ₌₁ᵏ r(r+1)] + (k+1)(k+2)。根据假设，该式等于 ⅓ k(k+1)(k+2) + (k+1)(k+2)。提取公因式 (k+1)(k+2)：= (k+1)(k+2)[⅓ k + 1] = (k+1)(k+2)( (k+3)/3 ) = ⅓ (k+1)(k+2)(k+3)。这正是 n = k+1 时的右边。故 P(k) ⇒ P(k+1)。
Conclusion: Since P(1) is true and P(k) ⇒ P(k+1), by mathematical induction P(n) holds for all n ∈ ℕ.
结论：因为 P(1) 为真且 P(k) ⇒ P(k+1)，由数学归纳法，P(n) 对所有 n ∈ ℕ 成立。
∑ᵣ₌₁ⁿ r(r+1) = ⅓ n(n+1)(n+2)
8. Model Answer 2: Proof by Contradiction (Irrationality) | 范文 2：反证法（无理数）
Question: Prove that √2 is irrational.
题目：证明 √2 是无理数。
Model Answer:
Assume, for contradiction, that √2 is rational. Then we can write √2 = p/q where p and q are integers with no common factors (q ≠ 0).
范文：
为导出矛盾，假设 √2 是有理数。那么可以写成 √2 = p/q，其中 p 与 q 为互质整数（q ≠ 0）。
nteger m. Substituting: (2m)² = 2q² → 4m² = 2q² → q² = 2m². Thus q² is even, so q is even.
两边平方得 2 = p²/q²，即 p² = 2q²。因此 p² 是偶数，这意味着 p 是偶数。令 p = 2m（m 为整数）。代入得 (2m)² = 2q² → 4m² = 2q² → q² = 2m²。于是 q² 为偶数，故 q 也是偶数。
Both p and q are even, which contradicts the assumption that they have no common factors. This contradiction shows our initial assumption was false. Hence √2 cannot be rational; it is irrational.
p 和 q 均为偶数，这与它们互质的假设矛盾。这一矛盾表明起初的假设为假。因此 √2 不可能是有理数；它是无理数。
√2 ∉ ℚ
9. Model Answer 3: Direct Proof of a Trigonometric Identity | 范文 3：直接证明三角恒等式
Question: Prove that sin⁴θ + cos⁴θ = 1 − ½ sin²2θ.
题目：证明 sin⁴θ + cos⁴θ = 1 − ½ sin²2θ。
Model Answer:
Start with the left-hand side: sin⁴θ + cos⁴θ = (sin²θ)² + (cos²θ)².
范文：
从左边出发：sin⁴θ + cos⁴θ = (sin²θ)² + (cos²θ)²。
LHS = (sin²θ + cos²θ)² − 2 sin²θ cos²θ. Since sin²θ + cos²θ = 1, LHS = 1 − 2 sin²θ cos²θ.
利用等式 a² + b² = (a+b)² − 2ab。此处 a = sin²θ, b = cos²θ。故左边 = (sin²θ + cos²θ)² − 2 sin²θ cos²θ。因为 sin²θ + cos²θ = 1，左边 = 1 − 2 sin²θ cos²θ。
os²θ = ½ sin²2θ. Substituting, LHS = 1 − ½ sin²2θ = RHS. Therefore the identity is proved.
回忆倍角公式：sin2θ = 2 sinθ cosθ，故 4 sin²θ cos²θ = sin²2θ。因此 2 sin²θ cos²θ = ½ sin²2θ。代入后，左边 = 1 − ½ sin²2θ = 右边。恒等式得证。
sin⁴θ + cos⁴θ ≡ 1 − ½ sin²2θ
10. Common Mistakes and How to Avoid Them | 常见错误及其避免方法
e the result for n = k+1 before it is derived. In contradiction, do not inadvertently assume what you want to disprove. Another mistake is insufficient justification: simply writing algebra without linking words results in lost communication marks. Finally, failing to write the concluding sentence in induction or contradiction can cost the final A1 mark.
一个常见错误是在建立逻辑基础之前就去操作那正要证明的命题。在归纳法里，绝不要在推导出 n = k+1 的结果之前就使用它。在反证法中，不要无意中假设了你想要反驳的事物。另一个错误是论证不充分：只写代数步骤而没有连接词，会导致失去表达分。最后，在归纳法或反证法中不写总结句，可能会丢掉最后一个 A1 分。
11. Exam Tips for Maximum Marks | 获得高分的应试技巧
Always label the parts of your proof – 'Base case', 'Induction step', etc. – either with words or by clearly separated paragraphs. This shows the examiner you know the structure. If a question says 'Hence or otherwise', using the suggested 'hence' route often simplifies the writing. For 'explain' questions, aim for 3-4 precise sentences; use the exact phrasing from the syllabus where possible, such as 'the matrix represents a rotation by 90° anticlockwise about the origin'.
一定要为证明的各个部分加标签——'Base case'、'Induction step' 等——可以用文字标注，也可以通过段落清晰分隔。这让阅卷人看到你理解文章结构。如果题目说 'Hence or otherwise'，使用建议的 'hence' 路径往往能简化书写。对于解释类题目，目标写 3-4 句精确的话；尽可能使用大纲中的准确用语，如 'the matrix represents a rotation by 90° anticlockwise about the origin'。
12. Final Thoughts on Mastering the Essay Framework | 掌握论文框架的总结思考
Proof-based writing is a skill that improves with deliberate practice. Choose a past paper question, write out a full, worded solution, and compare it with the mark scheme. Pay attention not just to the mathematics, but to the flow of reasoning. When you internalise the frameworks presented here, you will find that extended responses become far less intimidating, and you can tackle them with confidence in both AS Paper 1 and Paper 2.
基于证明的写作是一项可以通过刻意练习来提高的技能。选一道往年试题，写出完整的、带文字说明的解答，然后与评分方案比对。不仅要关注数学本身，更要关注推理的流向。当你内化了本文介绍的各个框架后，你会发现扩展类答案变得不再可怕，你可以在 AS 卷一卷二中自信应对它们。
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图