Mathematical Reasoning
Mathematical reasoning is the grammar of logic — the precise rules for joining, negating and chaining statements so that "if-then" arguments hold up. It looks like a school topic, but CAT, and especially XAT and SNAP, lean on it constantly: every "which of the following must be true" question, every assumption-and-conclusion set, and every critical-reasoning trap is really testing whether you can read a statement, negate it correctly, and tell a valid inference from a tempting but invalid one. The single most lucrative idea here is the contrapositive: "if p then q" is logically identical to "if not q then not p", while the converse and inverse are NOT guaranteed. Master that and you stop falling for the classic affirming-the-consequent trap. This chapter builds the toolkit from the ground up — simple and compound statements, the truth-table behaviour of AND, OR, NOT, implication and biconditional, the ideas of tautology and contradiction, and finally quantifiers (for all, there exists) and how to negate them. Each topic carries worked CAT-style examples, the fastest method, and the traps that quietly cost marks.
Topics
⚡ CAT shortcuts & speed methods
The fastest ways to crack this chapter under time pressure — the techniques that separate a 95+ percentiler from the rest.
- To disprove a universal ("all/every") claim, hunt for ONE counterexample; to disprove an existential ("some/there exists") claim you must rule out every case.
- Implication shortcut: p → q is false in exactly one situation — true premise, false conclusion. Everything else is true.
- Replace any "if p then q" with its contrapositive "if not q then not p" — they are identical and the contrapositive is often easier to test.
- De Morgan on the fly: negating an AND gives an OR of negations; negating an OR gives an AND of negations.
- Convert implications to OR: (p → q) ≡ (¬p ∨ q) — handy when an option mixes "if-then" with "or".
- Count truth-table rows instantly as 2ⁿ (n = number of distinct simple statements); you rarely need the whole table, just the one row that breaks the claim.
⚠️ Common mistakes & traps
CAT is designed so that careless errors here cost you marks. Internalise each trap before the exam.
- Treating the converse (q → p) or inverse (¬p → ¬q) as equivalent to p → q — only the contrapositive is equivalent.
- Over-negating a universal: the opposite of "all are X" is "at least one is not X", never "none is X".
- Forgetting that p → q is vacuously TRUE whenever the premise p is false.
- Reading exclusive "or" where logic uses inclusive ∨ (p ∨ q is true even when both hold).
- Mishandling quantifier order — "every lock has a key" is not the same as "one key opens every lock".
📈 CAT exam insight & PYQ analysis
🎴 Flashcards — instant recall
Tap a card to reveal the answer. Drill these until they are automatic.
📌 Quick revision
Chapter test
🏆 Vidaara CAT success checklist
You have truly mastered Mathematical Reasoning when you can tick every box below.
- Recall every formula in this chapter without looking them up
- Solve each topic’s practice set with at least 80% accuracy
- Use the chapter shortcuts to cut your solving time in half
- Spot and avoid every common trap listed above
- Score 80%+ on the timed chapter test
📋 Chapter mastery scorecard
Track where you stand. Aim for the target before moving to the next chapter.
| Skill checkpoint | Target |
|---|---|
| Concept theory & formulas understood | 100% |
| Topic practice sets attempted (3 topics) | 3/3 |
| Best topic-test score | — → 80%+ |
| Chapter test score | — → 80%+ |
| Flashcards drilled to instant recall | 12 cards |
Formula Reference Sheet
Connectives & negation
| Negation | ¬p is true exactly when p is false |
|---|---|
| Conjunction (AND) | p ∧ q true only when both p and q are true |
| Disjunction (OR) | p ∨ q false only when both p and q are false |
| Implication | p → q false only when p is true and q is false |
| Biconditional | p ↔ q true when p and q have the same truth value |
Logical identities (CAT power-tools)
| Contrapositive (equivalent) | (p → q) ≡ (¬q → ¬p) |
|---|---|
| Implication as OR | (p → q) ≡ (¬p ∨ q) |
| De Morgan (AND) | ¬(p ∧ q) ≡ ¬p ∨ ¬q |
| De Morgan (OR) | ¬(p ∨ q) ≡ ¬p ∧ ¬q |
| Negation of quantifiers | ¬(∀x P) ≡ ∃x ¬P; ¬(∃x P) ≡ ∀x ¬P |