OCR数学 Proof 归纳法 反证法 直接证明 入门 | OCR Maths Proof Induction Contradiction Direct Proof Introduction

OCR数学 Proof 归纳法 反证法 直接证明 入门

A-Level OCR数学考试中，Proof（证明）是贯穿Pure Mathematics、Mechanics和Statistics三大模块的核心技能。无论是ALevel AS还是A2阶段，证明题都出现在Paper 1 Pure Mathematics和Paper 2 Pure Mathematics and Statistics中，占分约10至15分。许多学生虽然掌握了公式和计算技巧，却在证明题上失分严重, 原因通常是缺乏对证明结构和逻辑推理的系统训练。本文将带你从零开始，系统梳理OCR数学大纲要求的五大证明方法：直接证明（Direct Proof）、反证法（Proof by Contradiction）、数学归纳法（Proof by Induction）、穷举法（Proof by Exhaustion）以及反例法（Disproof by Counterexample），配合典型例题和易错陷阱，帮助你在证明题上拿到满分。

Proof is a core skill tested across all three OCR A-Level Mathematics modules: Pure Mathematics, Mechanics, and Statistics. Whether you are sitting AS or A2, proof questions appear in Paper 1 (Pure Mathematics) and Paper 2 (Pure Mathematics and Statistics), typically worth 10 to 15 marks. Many students master formulas and calculation techniques yet lose marks heavily on proof questions , usually because they lack systematic training in logical reasoning and proof structure. This article will introduce you to the five proof methods required by the OCR specification: Direct Proof, Proof by Contradiction, Proof by Induction, Proof by Exhaustion, and Disproof by Counterexample. Each method is illustrated with worked examples and common pitfalls, giving you the tools to score full marks on proof questions.

一、直接证明 Direct Proof

直接证明是最基础也最自然的证明方法。思路是从已知条件或公理出发，通过一系列逻辑推导，直接得出结论。OCR考试中直接证明常见于代数恒等式证明和整数性质证明。例如，证明两个连续整数的平方差等于它们的和：设两个连续整数为n和n加1，则(n加1)平方减n平方等于n平方加2n加1减n平方等于2n加1等于n加(n加1)。证明完成。直接证明的关键是每一步推导必须有明确的逻辑依据，不能跳步。易错点：很多学生直接代入特定值（如n等于3）来"证明"一个一般性命题, 这是最常见的零分错误。代数证明必须保留变量，证明对所有允许的值成立。

Direct proof is the most fundamental and natural method. The approach is to start from known conditions or axioms and reach the conclusion through a chain of logical deductions. In OCR exams, direct proof typically appears in algebraic identity problems and integer property questions. For example, to prove that the difference of squares of two consecutive integers equals their sum: let the two consecutive integers be n and n plus 1, then (n plus 1) squared minus n squared equals n squared plus 2n plus 1 minus n squared equals 2n plus 1 equals n plus (n plus 1). The proof is complete. The key to direct proof is that every step must have a clear logical basis: no skipping steps. Common pitfall: many students substitute specific values (such as n equals 3) to "prove" a general statement , this is the most frequent zero-mark error. Algebraic proofs must retain variables to demonstrate the statement holds for all allowed values.

二、反证法 Proof by Contradiction

反证法是OCR A-Level数学中最考察逻辑思维能力的证明方法。其核心思路是：假设命题的结论不成立，然后推导出一个与已知事实矛盾的结论，从而断定原命题成立。OCR大纲明确要求掌握的经典反证法题目包括：证明根号2是无理数、证明存在无穷多个质数、证明素数的无穷性。以根号2的无理性证明为例：假设根号2是有理数，则可写为最简分数p除以q（p和q互质），两边平方得p平方等于2q平方，故p平方是偶数，推出p是偶数。设p等于2k，代入得4k平方等于2q平方即q平方等于2k平方，同理q也是偶数。这与p和q互质的假设矛盾，因此根号2不是有理数。反证法的易错点：初始假设必须恰好与原结论相反（不加强不减弱），推导过程中不能引入额外的假设。

Proof by contradiction is the method that most tests logical reasoning ability in OCR A-Level Mathematics. The core idea: assume the negation of the conclusion, then derive a statement that contradicts known facts, thereby establishing the original proposition. Classic contradiction proofs explicitly required by the OCR specification include: proving that the square root of 2 is irrational, proving there are infinitely many primes, and proving the infinity of prime numbers. Take the irrationality of root 2 as an example: assume root 2 is rational, so it can be written as a reduced fraction p divided by q where p and q are coprime. Squaring both sides gives p squared equals 2q squared, so p squared is even, meaning p is even. Let p equal 2k, substitute to get 4k squared equals 2q squared, so q squared equals 2k squared, and similarly q is even. This contradicts the assumption that p and q are coprime, therefore root 2 is not rational. Common pitfall: the initial assumption must be exactly the negation of the conclusion (no stronger, no weaker), and no extra assumptions may be introduced during the derivation.

三、数学归纳法 Proof by Induction

数学归纳法是证明与自然数n相关的命题的强大工具。OCR A-Level Pure Mathematics中，归纳法常用于证明数列求和公式、整除性命题、矩阵乘方公式和不等式。标准步骤为：Step 1 基础步骤（Base Case），验证n等于1时命题成立；Step 2 归纳假设（Inductive Hypothesis），假设n等于k时命题成立；Step 3 归纳步骤（Inductive Step），利用归纳假设证明n等于k加1时命题也成立；Step 4 结论陈述，由数学归纳法原理，命题对所有正整数n成立。例如证明前n个自然数之和为二分之一n(n加1)：n等于1时左边为1，右边为1，成立。假设n等于k时成立，则n等于k加1时，前k加1个自然数之和等于前k个之和加上k加1，代入归纳假设得二分之一k(k加1)加k加1，化简得二分之一(k加1)(k加2)，这正是n等于k加1时的公式。OCR阅卷标准要求：必须明确写出"Assume true for n=k"和"Therefore true for n=k+1"这两个关键语句，缺少任何一句都会被扣分。此外，必须清晰标注结论陈述。

Proof by induction is a powerful tool for proving propositions involving natural numbers n. In OCR A-Level Pure Mathematics, induction commonly appears in proving summation formulas, divisibility statements, matrix power formulas, and inequalities. The standard steps are: Step 1 Base Case: verify the statement holds for n equals 1; Step 2 Inductive Hypothesis , assume the statement holds for n equals k; Step 3 Inductive Step , use the induction hypothesis to prove the statement holds for n equals k plus 1; Step 4 Conclusion , by the principle of mathematical induction, the statement holds for all positive integers n. For example, proving the sum of the first n natural numbers equals one half n times (n plus 1): when n equals 1, both sides equal 1, so the base case holds. Assume true for n equals k, then for n equals k plus 1, the sum equals the sum of first k terms plus k plus 1, substitute the induction hypothesis to get one half k(k plus 1) plus k plus 1, simplify to one half (k plus 1)(k plus 2), which is exactly the formula for n equals k plus 1. OCR marking criteria require: you must explicitly write "Assume true for n=k" and "Therefore true for n=k+1" , omitting either loses marks. Additionally, the conclusion statement must be clearly labelled.

广告 / Sponsored

四、穷举法 Proof by Exhaustion

穷举法适用于当命题只涉及有限种可能情况时的证明。OCR考试中，穷举法常见于模运算（Modular Arithmetic）和数字性质证明。例如，证明任意整数的立方与自身之差能被6整除，可将所有整数按模6的余数分为6类（0至5），分别验证每种情况下该差都能被6整除。穷举法的优势在于逻辑清晰、不需要复杂的代数技巧，但前提是情况数量必须可控。易错点：很多学生只验证了三四种情况就宣称"穷举完成", 必须确认已覆盖所有可能情况，不能遗漏。此外，如果可能的情况随着变量增大而无限增长（如与n相关），则不能使用穷举法, 要改用归纳法。在OCR考试中，穷举法通常出现在A-Level Pure Mathematics的Proof章节以及OCR Additional Pure中，题目会明确提示"by exhaustion"。

Proof by exhaustion is suitable when a proposition involves only finitely many possible cases. In OCR exams, exhaustion commonly appears in modular arithmetic and number property proofs. For example, to prove that the difference between the cube of any integer and the integer itself is divisible by 6, you can classify all integers into 6 residue classes modulo 6 (0 through 5) and verify the divisibility holds in each case. The advantage of exhaustion is its logical clarity and independence from complex algebraic manipulation, but the number of cases must be manageable. Common pitfall: many students check only three or four cases and declare "exhaustion complete": you must confirm that all possible cases have been covered, with no omissions. Additionally, if the number of possible cases grows unboundedly with the variable (e.g., depends on n), exhaustion is invalid , switch to induction. In OCR exams, exhaustion typically appears in the Proof chapter of A-Level Pure Mathematics and OCR Additional Pure, and questions will explicitly cue "by exhaustion."

五、反例法 Disproof by Counterexample

反例法严格来说不是"证明"而是"否证", 用于证明一个全称命题不成立。只需找到一个具体的反例即可推翻一个声称对所有情况都成立的命题。OCR考试中反例法考题通常非常简单但学生反而容易漏分，因为它们出现得少，学生容易将其与直接证明混淆。例如，判断命题"所有质数都是奇数"的真假，只需指出2是质数且2是偶数，该命题即被推翻。另一个经典例子："如果a平方大于b平方，则a大于b", 取a等于负5，b等于3，a平方等于25大于b平方等于9，但负5小于3，反例成立。OCR评分标准：必须明确写出反例的具体数值以及验证该反例满足条件但不满足结论。只写"反例存在"不得分, 必须给出具体数值。

Disproof by counterexample is technically not a "proof" but a "disproof": it is used to show that a universal statement is false. Finding just one specific counterexample is enough to overturn a statement that claims to hold in all cases. In OCR exams, counterexample questions are usually very straightforward but students surprisingly lose marks because they appear infrequently and students confuse them with direct proof. For example, to evaluate the statement "all prime numbers are odd," simply note that 2 is prime and 2 is even , the statement is disproven. Another classic example: "if a squared is greater than b squared, then a is greater than b" , let a equal negative 5 and b equal 3, then a squared equals 25 is greater than b squared equals 9, but negative 5 is less than 3, so the counterexample stands. OCR marking rubric: you must explicitly state the specific numerical values of the counterexample and verify that it satisfies the condition but not the conclusion. Writing only "a counterexample exists" earns zero marks , specific values are required.

学习建议与备考策略 Study Tips and Exam Strategy

1. 建立证明模板库：为归纳法、反证法等标准题型建立固定写作模板，考试时直接套用框架，只填入具体数学内容，确保关键得分语句不遗漏。2. 注意OCR官方措辞（Phrasing）：OCR阅卷对证明题的语言规范性有严格要求。"Assume true for n=k"不可省略，"Hence by induction"不可写成"Therefore it is proved"。建议背熟OCR官方Mark Scheme中的标准表述。3. 直接证明与反证法的区分：如果题目问"prove that..."，优先考虑直接证明。如果题目涉及无理数、无穷性或出现"there does not exist"等字眼，优先考虑反证法。4. 先草稿再誊写：证明题对逻辑顺序要求极高，如果写了一半发现方向错误再划掉重写，会严重压缩考试时间。建议先在草稿纸上理清逻辑链条，确认无误后再正式写在答题区。5. 检查结论是否完整：归纳法别忘了最后的结论陈述句，反证法别忘了写"Contradiction, therefore..."，直接证明别忘了在最后QED处标注方框或"as required"。

1. Build a proof template library: create fixed writing templates for standard proof types such as induction and contradiction, then in the exam simply fill in the specific mathematical content while keeping the structural framework intact. This ensures no key scoring statements are missed. 2. Pay attention to OCR official phrasing: OCR marking has strict requirements for the language used in proofs. "Assume true for n=k" cannot be omitted, "Hence by induction" cannot be written as "Therefore it is proved." We recommend memorising the standard wording from OCR official mark schemes. 3. Distinguishing direct proof from contradiction: if the question asks "prove that..." without negation cues, prefer direct proof. If the question involves irrational numbers, infinity, or wording like "there does not exist," prefer contradiction. 4. Draft first, then write: proof questions demand extremely high logical ordering. If you get halfway through and discover the direction is wrong, crossing out and rewriting will severely eat into exam time. We recommend mapping out the logical chain on scratch paper first, confirming correctness, then writing formally in the answer area. 5. Check conclusion completeness: do not forget the final conclusion sentence for induction, the "Contradiction, therefore..." for contradiction, and the QED box or "as required" for direct proof.

🛍️ 微信小店好物推荐

fx-991CN X 中文版计算器-老王推荐

¥168.00 🛒 微信小店购买

初中教材全解上下7册 语文数学英语地理生物课本同步解读 薛金星陕西教育出版社

¥34.20 🛒 微信小店购买

🎓 需要辅导？Need a Tutor?

A-Level OCR数学证明题卡住了？我们提供一对一中英双语辅导，覆盖Pure Mathematics全部证明题型。

Stuck on OCR A-Level proof questions? We offer one-on-one bilingual tutoring covering all Pure Mathematics proof types.

16621398022同微信

关注公众号 tutorhao 获取更多ALevel数学学习资源

更多咨询请联系16621398022（同微信）