TMUA Paper 2: Master Mathematical Reasoning | TMUA 卷二：数学推理能力提升

📚 TMUA Paper 2: Master Mathematical Reasoning | TMUA 卷二：数学推理能力提升

The TMUA Paper 2, formally titled “Mathematical Reasoning”, tests your ability to construct, analyse and evaluate logical arguments — not just your knowledge of formulas. This paper pushes beyond routine calculations and asks whether you can think like a mathematician.

TMUA 卷二正式名称为“数学推理”，它考查的是你构建、分析和评估逻辑论证的能力，而不仅仅是对公式的记忆。这张试卷超越了常规计算，看的是你是否能像数学家一样思考。

1. What Makes Paper 2 Different | 卷二与卷一的不同之处

Paper 1 focuses on mathematical knowledge and technique: algebra, calculus, geometry and standard problem-solving. Paper 2 shifts the emphasis to reasoning itself. Many questions present a short argument and ask you to judge its validity, or ask you to identify which conclusion necessarily follows from given premises. Advanced mathematical content is not required — but logical precision is essential.

卷一注重数学知识与技巧，如代数、微积分、几何和常规解题方法。卷二则将重心转移到推理本身。许多题目会给出一个简短的论证，让你判断其有效性，或让你识别哪个结论必然能从给定前提出发得出。题目不要求高阶数学知识，但必须具备精确的逻辑能力。

Paper 2 = Logic + Proof + Structured Thinking

卷二 = 逻辑 + 证明 + 结构化思维

2. Valid vs Invalid Arguments | 有效论证与无效论证

An argument is valid if the conclusion must be true whenever all premises are true. It is invalid if there exists at least one way for the premises to hold while the conclusion fails. Validity is about structure, not about whether the statements are actually true.

一个论证在“所有前提为真时结论必然为真”的情况下才被称为有效。若存在一种情况使前提成立而结论不成立，则该论证无效。有效性关注的是结构，而非命题在现实世界中是否真实。

Consider: If it rains, the ground is wet. The ground is wet. Therefore it rained. This argument is invalid — the ground could be wet for many other reasons. In contrast, “If it rains, the ground is wet. It rained. Therefore the ground is wet” is valid by modus ponens.

例如：如果下雨，地面会湿。地面湿了。因此下过雨。这个论证是无效的——地面可能因许多其他原因而湿。相反，“如果下雨，地面湿；下了雨；因此地面湿”依据肯定前件规则是有效的。

In Paper 2, you must read each argument carefully, strip away unnecessary context, and test whether the logical structure preserves truth. A powerful technique is to replace concrete terms with abstract letters: if the structure remains sound, the argument is valid.

在卷二考试中，你需要仔细阅读每个论证，剥离无关情境，检验逻辑结构是否保持真值。一个有效技巧是将具体词语替换为抽象字母：若结构仍然成立，该论证即有效。

3. Quantifiers: ∀ and ∃ | 量词：任意与存在

Logical statements often involve the universal quantifier ∀ (“for all”) and the existential quantifier ∃ (“there exists”). Understanding their meaning and, crucially, their negation is a recurring theme in Paper 2.

逻辑命题常涉及全称量词∀（“对所有”）和存在量词∃（“存在”）。理解它们的含义及其否定形式是卷二的重要考点。

Negation rules are simple: ¬(∀x P(x)) is equivalent to ∃x ¬P(x), and ¬(∃x P(x)) is equivalent to ∀x ¬P(x). For example, the negation of “All primes are odd” is “There exists a prime that is not odd” — and 2 serves as the counterexample. The negation of “There exists a largest integer” is “For every integer, there is a larger one”, which is true.

否定规则很简单：¬(∀x P(x)) 等价于 ∃x ¬P(x)，而 ¬(∃x P(x)) 等价于 ∀x ¬P(x)。例如，“所有素数都是奇数”的否定是“存在一个不是奇数的素数”——2 就是反例。“存在最大整数”的否定是“对每个整数，都存在更大的整数”，这是真命题。

When a statement mixes quantifiers, order matters. ∀x ∃y (x + y = 0) means for every x you can find a y to sum to zero. But ∃y ∀x (x + y = 0) claims a single y works for every x — which is false. Always clarify the scope of each quantifier.

当命题混用量词时，顺序至关重要。∀x ∃y (x + y = 0) 表示对每个 x 都能找到某个 y 使其和为零。但 ∃y ∀x (x + y = 0) 声称存在一个 y 对所有 x 都成立——这是假的。务必厘清每个量词的作用范围。

4. The Power of Counterexamples | 反例的力量

To prove a universal statement false, a single counterexample suffices. Many Paper 2 questions are designed around this principle: you are given a claim and must decide whether it is true or false.

要证明一个全称命题为假，一个反例便已足够。卷二的许多题目正是围绕这一原则展开：题目给出一个命题，你须判断其真伪。

For instance, the claim “n² + n + 41 is prime for every positive integer n” appears promising — it works for n = 1 through 39. But at n = 40, we have 40² + 40 + 41 = 40 × 41 + 41 = 41², which is composite. One value destroys the universal claim. This highlights why testing special cases is essential.

例如，命题“对每个正整数 n，n² + n + 41 都是素数”看起来很有希望——n 从 1 到 39 时确实都成立。但当 n = 40 时，40² + 40 + 41 = 40 × 41 + 41 = 41²，它是合数。一个数值即可推翻全称命题。这凸显了测试特殊情况的重要性。

When you are asked whether a statement is true, actively search for a counterexample before trying to prove it. Draw graphs, test small integers, try zero or negative values, examine boundary cases. If no counterexample appears, then attempt a proof. This alternating search strategy is efficient under timed conditions.

当被问及一个命题是否为真时，先主动寻找反例，再考虑证明。画图、试小整数、尝试零或负数、检查边界情况。如果找不到反例，再尝试证明。在限时环境下，这种交替搜索策略十分高效。

5. Direct Proof, Contradiction and Induction | 直接证明、反证法与归纳法

Paper 2 expects you to follow and sometimes complete short proofs. The three most common proof styles are direct proof, proof by contradiction, and proof by induction.

卷二要求你理解并有时补全简短的证明。最常见的三种证明方式是直接证明、反证法和数学归纳法。

Direct proof establishes a conclusion by a chain of logical implications. Example: If n is even, then n² is even. Proof: n = 2k, so n² = 4k² = 2(2k²), which is even. Clean and straightforward.

直接证明通过一串逻辑蕴含得出结论。例如：若 n 是偶数，则 n² 是偶数。证明：n = 2k，所以 n² = 4k² = 2(2k²)，是偶数。简洁明了。

Proof by contradiction starts by assuming the negation of the desired statement and derives a logical impossibility. A classic: prove √2 is irrational. Assume √2 = a/b in lowest terms; then 2b² = a², so a is even; write a = 2k; then b² = 2k², so b is even — contradicting lowest terms. Hence √2 is irrational.

反证法先假设待证命题的否定成立，然后推导出逻辑矛盾。经典例子：证明 √2 是无理数。假设 √2 = a/b 为最简分数；由 2b² = a² 得 a 为偶数；写 a = 2k；则 b² = 2k²，故 b 也是偶数——与最简假设矛盾。因此 √2 是无理数。

Induction proves statements indexed by positive integers. Verify the base case, then show that if the statement holds for n, it must hold for n + 1. For instance, to prove 1 + 2 + ⋯ + n = n(n+1)/2, the inductive step adds (n + 1) to both sides. Recognising when induction applies is a key skill.

归纳法用于证明与正整数相关的命题。先验证基础情形，然后证明若命题对 n 成立则对 n + 1 也成立。例如，证明 1 + 2 + ⋯ + n = n(n+1)/2 时，归纳步骤只需在等式两边同时加 (n + 1)。判断何时适用归纳法是一项关键技能。

6. Necessary and Sufficient Conditions | 必要条件与充分条件

Logical implication has direction. The statement “A implies B” means A is sufficient for B, and B is necessary for A. Understanding this asymmetric relationship prevents many careless errors.

逻辑蕴含具有方向性。“A 蕴含 B”表示 A 是 B 的充分条件，而 B 是 A 的必要条件。理解这种非对称关系可避免许多粗心错误。

Take the statement: x > 3 implies x > 0. Here x > 3 is sufficient for x > 0, but x > 0 does not imply x > 3 (x = 1 is a counterexample). So x > 0 is necessary but not sufficient for x > 3. In logical terms, if P → Q is true but Q → P is false, then P is sufficient and necessary conditions are asymmetric.

考虑命题：x > 3 蕴含 x > 0。此时 x > 3 是 x > 0 的充分条件，但 x > 0 并不蕴含 x > 3（x = 1 是反例）。所以 x > 0 是 x > 3 的必要但不充分条件。用逻辑术语说，若 P → Q 为真而 Q → P 为假，则条件关系是不对称的。

In exam questions, you may be asked to identify which condition is necessary or sufficient. Write out the implication arrows and test boundary cases to avoid confusing the two. The phrase “if and only if” signals a biconditional, meaning both implications hold simultaneously.

考试中可能要求你识别哪个条件是必要的或充分的。写出蕴含箭头并测试边界情形，以免混淆两者。“当且仅当”表示双向蕴含，即两个方向的蕴含同时成立。

7. Reasoning with Inequalities and Bounds | 不等式与界限推理

Working with inequalities requires special care because the direction of the inequality can flip when multiplying by a negative number. Paper 2 frequently embeds inequality reasoning within larger logical questions.

处理不等式需格外小心，因为乘以负数会使不等号方向反转。卷二常在更大的逻辑问题中嵌入不等式推理。

Key rules include: if a < b, then a + c 0, then ac < bc; if a bc. Also, for non-negative numbers, a (−2)².

关键法则包括：若 a < b，则 a + c 0，则 ac < bc；若 a bc。此外，对于非负数，a (−2)²。

When assessing statements about bounds, watch for terms like “maximum”, “minimum”, “least upper bound”, and “greatest lower bound”. A statement such as “all solutions satisfy x ≤ 5” is false if a solution with x = 5.1 exists. Always ask which inequality is strict and which allows equality.

在评估关于界限的命题时，注意“最大值”“最小值”“最小上界”“最大下界”等术语。例如，“所有解满足 x ≤ 5”若存在 x = 5.1 的解即为假。务必分清哪个不等式是严格的、哪个允许取等号。

8. Sequences and Pattern Recognition | 数列与模式识别

Sequences in Paper 2 are often defined recursively, with questions asking you to reason about their monotonicity, boundedness, or closed form. Recognising patterns is only the first step — rigorous justification matters.

卷二中数列常以递推形式给出，问题可能涉及判断其单调性、有界性或求闭式表达。发现模式只是第一步——严谨论证才是关键。

Given a₁ = 1 and aₙ₊₁ = 2aₙ + 1, the first few terms are 1, 3, 7, 15, suggesting aₙ = 2ⁿ − 1. You can prove this by induction. But notice: identifying the pattern from the first three terms is not itself a proof — the pattern might break later. Paper 2 rewards those who can both conjecture and verify.

已知 a₁ = 1，aₙ₊₁ = 2aₙ + 1，前几项为 1、3、7、15，推测 aₙ = 2ⁿ − 1。这可用归纳法证明。但请注意：根据前三项识别出的模式本身并不是证明——该模式可能在后面失效。卷二奖励那些既能猜想又能验证的考生。

A related reasoning task is judging whether a recursively defined sequence is increasing or bounded. Try both induction and direct analysis: compare aₙ₊₁ with aₙ algebraically, and look for invariant constraints that keep all terms within a given interval.

相关的推理任务是判断递推数列是否递增或有界。可以尝试归纳法和直接分析：从代数上比较 aₙ₊₁ 与 aₙ，并寻找使所有项保持在给定区间内的不变约束。

9. Functions: Injectivity, Surjectivity, Monotonicity | 函数：单射、满射与单调性

Paper 2 often includes questions about properties of functions defined on finite or infinite sets. You should be comfortable with the following:

卷二常包含关于有限集或无限集上函数性质的题目。你应熟悉以下内容：

A function f is injective (one-to-one) if f(a) = f(b) implies a = b. For real functions, a strictly increasing or strictly decreasing function is injective.

函数 f 是单射（一一对应）是指 f(a) = f(b) 能推出 a = b。对于实函数，严格递增或严格递减的函数是单射。
f is surjective (onto) if every element of the codomain is hit by some input. On a finite domain, injective implies surjective only when domain and codomain have equal size.

f 是满射是指值域中的每个元素都能被某个输入映射到。在有限集合上，仅当定义域和陪域大小相同时，单射才蕴含满射。
Combining injections and surjections: if f is both injective and surjective, it is bijective, hence invertible.

若 f 既单射又满射，则为双射，因此可逆。

When judging statements like “a polynomial of degree three is always surjective on ℝ”, test the limits: as x → ∞ and x → −∞, the cubic terms dominate, so the function covers all real values by continuity. Each function type has different monotonicity and injectivity behaviour — make these properties automatic in your thinking.

判断“三次多项式在 ℝ 上总是满射”这类命题时，可考察极限：当 x → ∞ 和 x → −∞ 时，三次项占主导，因此由连续性可覆盖所有实数。不同类型的函数在单调性和单射性上表现各异——请将这些性质内化为思维习惯。

10. Probabilistic Reasoning | 概率推理

Probability questions in Paper 2 focus on logical structure rather than heavy computation. Be ready to interpret statements about independence, mutual exclusivity, and conditional probability.

卷二中的概率题侧重逻辑结构而非大量计算。你需要理解独立性、互斥性和条件概率等概念。

Two events A and B are independent if P(A ∩ B) = P(A)P(B). They are mutually exclusive if P(A ∩ B) = 0. These two properties are distinct: independent events can occur together, while mutually exclusive events cannot. A common trick question asks whether independent events can be mutually exclusive — the answer is yes, but only when at least one event has probability 0.

两个事件 A 和 B 独立当且仅当 P(A ∩ B) = P(A)P(B)。它们互斥当且仅当 P(A ∩ B) = 0。这两个性质是不同的：独立事件可以同时发生，互斥事件则不能。一个常见陷阱问题问独立事件能否互斥——答案是可以，但仅当至少其中一个事件概率为 0 时。

Conditional probability P(A|B) = P(A ∩ B)/P(B) can be used to detect dependence: if P(A|B) = P(A), then A and B are independent. When reasoning with probabilities, try to express the situation as a set diagram or a tree diagram; this makes the logical relationships visible and reduces the chance of errors.

条件概率 P(A|B) = P(A ∩ B)/P(B) 可用于判断独立性：若 P(A|B) = P(A)，则 A 与 B 独立。推理概率问题时，尝试用集合图或树状图表达情境，这能让逻辑关系可视化，降低出错概率。

11. Common Logical Fallacies | 常见逻辑谬误

Many Paper 2 questions are designed around specific logical fallacies. Knowing them by name helps you spot them quickly in an exam.

卷二的许多题目围绕特定的逻辑谬误而设计。熟悉这些谬误的名称有助于你在考试中迅速识别它们。

Denying the antecedent: “If P then Q; not P; therefore not Q” is invalid. Example: If it rains, the ground is wet; it did not rain; therefore the ground is not wet. The ground could be wet from a sprinkler.

否定前件：“若 P 则 Q；非 P；因此非 Q”是无效的。例：如果下雨，地面湿；没下雨；因此地面不湿。地面可能因洒水器而湿。
Affirming the consequent: “If P then Q; Q; therefore P” is invalid, for the same reason.

肯定后件：“若 P 则 Q；Q；因此 P”是无效的，原因同上。
Hasty generalisation: concluding a universal statement from a small or unrepresentative sample.

以偏概全：从小规模或非代表性样本得出全称结论。
Confusing correlation with causation: A and B tend to occur together, but one does not necessarily cause the other.

混淆相关性与因果性：A 与 B 倾向于同时发生，但其中一方未必导致另一方。

When reading an argument, first identify the logical skeleton — the premises and conclusion — and then test the inference pattern against known fallacies. This formal approach is far more reliable than relying on intuition.

阅读论证时，先找出逻辑骨架——前提和结论——然后用已知谬误模式检验推理形式。这种形式化方法远比依赖直觉可靠。

12. Exam Strategy and Final Tips | 考试策略与最终建议

Paper 2 contains 20 questions with a tight time limit. A systematic strategy matters as much as content knowledge.

卷二含 20 道题，时间紧张。系统性的答题策略与知识掌握同等重要。

For each question, classify the logical task: test validity, negate a statement, find a counterexample, or complete a proof. Different tasks call for different approaches.

对每道题先分类逻辑任务：验证有效性、否定命题、寻找反例还是补全证明。不同任务对应不同方法。
Use small numerical trials to test universal claims. Plugging in simple values like 0, 1, −1, or a prime often reveals counterexamples quickly.

用小数值试验检验全称命题。代入 0、1、−1 或素数等简单值常能迅速揭示反例。
When a proof is required, write the key steps clearly: base case, inductive hypothesis, or the contradiction chain. Clarity earns marks even if you cannot finish entirely.

需要证明时，请清晰写出关键步骤：基础情形、归纳假设或矛盾链。即使无法完全完成，清晰的表达也能得分。
Manage time by doing the easiest questions first, but keep a careful record so you can return to skipped items with fresh eyes.

先完成最易的题目以管理时间，同时做好标记，以便之后回头以新视角审视跳过的题目。

Finally, remember that mathematical reasoning is a skill you build through deliberate practice. After each practice paper, review every question you got wrong — identify the logical mistake, not just the arithmetic one. Is there a pattern? Did you confuse necessary with sufficient conditions? Did you accept an invalid implication as valid? This reflection process will sharpen your reasoning faster than any amount of passive reading.

最后请记住，数学推理是通过刻意练习逐步建构的能力。每次练习后，仔细复习每道错题——识别逻辑错误，而不仅仅是计算错误。是否存在某种模式？你是否混淆了必要与充分条件？你是否把一个无效蕴含当成了有效？这种反思过程比被动阅读能更快地提升你的推理能力。

Published by TutorHao | TMUA Revision Series | aleveler.com

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

TMUA Paper 2: Master Mathematical Reasoning | TMUA 卷二：数学推理能力提升