Translate statements before judging them
A reliable Paper \(2\) habit is to convert each verbal condition into an exact mathematical set or implication. If condition A implies \(B\), A is sufficient for \(B\). If \(B\) implies \(A\), A is necessary for \(B\). If both directions hold, the conditions are equivalent.
This removes the ambiguity from phrases such as only if, if, if and only if, necessary and sufficient. It also makes counterexamples easier to construct because you know exactly which implication you need to break.
Proofs are checked line by line
When a long argument is presented, do not jump to the final claim. Test every line for domain restrictions, sign changes, division by zero, lost absolute values, non-reversible implications and unjustified divisibility conclusions.
A later line can be algebraically correct and still be irrelevant if an earlier implication was invalid. Paper \(2\) rewards identifying the first logical break.
Familiar topics appear in logical form
Calculus may become a question about whether a stationary-point condition is sufficient for a root count. Geometry may ask which condition guarantees tangency. Sequences may ask whether a limiting behaviour is equivalent to a condition on the common ratio. Number theory may ask for a counterexample to a plausible divisibility claim.
The mathematics is not separate from Paper \(1\); the difference is the precision with which the conclusion must follow from the assumptions.