TMUA Mathematical Reasoning (Paper 2)

Paper 2 is Mathematical Reasoning. The mathematics in it is not new; the test is whether you can read a mathematical claim precisely, name its converse, find a counter-example, identify the precise step at which a proof breaks, and translate quantifier statements between symbols and prose. Candidates who do well on Paper 2 have drilled five specific moves until they are automatic under time pressure.

• Necessary versus sufficient. $A$ is sufficient for $B$ if $A \Rightarrow B$. $A$ is necessary for $B$ if $B \Rightarrow A$. Confused half the time under time pressure unless drilled deliberately.
• Counter-example construction. For a false universal claim, the whole question reduces to producing one $x$ that breaks it. The candidate who can summon counter-examples for the standard families (small integers, zero, edge cases, negative values) saves minutes.
• Spotting the broken step in a proof. Almost always one of: division by something that could be zero; taking a square root and dropping the negative case; multiplying both sides of an inequality by an expression whose sign is unknown; asserting “for all” when only “for some” has been shown.
• Quantifier negation. The negation of “for all $x$, $P(x)$” is “there exists $x$ such that not $P(x)$”. Two questions per Paper 2, free marks once drilled.
• Translating prose to logic. “No $A$ is $B$ unless $C$”, “every $A$ that is $B$ must be $C$” appear several times per Paper 2 and need reliable reformulation as $\forall x (P(x) \to Q(x))$ form.

The move. Paper 2 questions look varied but rely on a small, fixed vocabulary of logical constructions. Learn the vocabulary, name the construction the question is using, then the answer follows.