JEE Maths›Mathematical Reasoning›Common Mistakes

Common Mistakes

Traps in Mathematical Reasoning

6 mistake patterns students fall for. 2 high-frequency traps appear in almost every exam.

Confusing converse with contrapositive

Very CommonFORMULA

The contrapositive of $p \to q$ is $\sim q \to \sim p$ (equivalent). The converse is $q \to p$ (NOT equivalent).

Why: Both involve swapping p and q. Students forget that the contrapositive also negates both components.

WRONG: Contrapositive of 'If it rains, the ground is wet' = 'If the ground is wet, it rains' (this is the converse)

RIGHT: Contrapositive = 'If the ground is NOT wet, then it did NOT rain'. Negate AND swap.

See pattern: Contrapositive / Converse / Inverse →

Wrong truth value for conditional (p -> q)

Very CommonCONCEPT

A conditional $p \to q$ is false ONLY when p is true and q is false. It is true in all other cases.

Why: Students expect 'if p then q' to be false when p is false, treating it like everyday causation. In logic, a false hypothesis makes the conditional vacuously true.

WRONG: 'If 2 > 5, then the moon is square' is false (since both parts are false)

RIGHT: This is TRUE because the hypothesis (2 > 5) is false. F -> anything = T.

See pattern: Find Truth Value →

Wrong negation of quantifiers

CommonFORMULA

Negation of 'for all x, P(x)' is 'there exists x such that NOT P(x)', not 'for all x, NOT P(x)'.

Why: Students negate the predicate but forget to change the quantifier.

WRONG: Negation of 'All students passed' = 'All students failed'

RIGHT: Negation = 'There exists a student who did not pass'. Change the quantifier AND negate the predicate.

See pattern: Quantifier Problems →

Confusing AND/OR when negating

CommonFORMULA

By De Morgan's laws, negation of AND becomes OR, and negation of OR becomes AND. Students often forget to switch the connective.

Why: Mechanical application of negation to each component without changing the connective between them.

WRONG:

\sim(p \wedge q) = \sim p \wedge \sim q

(kept AND instead of changing to OR)

RIGHT:

\sim(p \wedge q) = \sim p \vee \sim q

. Always swap AND/OR when applying De Morgan's.

See pattern: Write the Negation →

Applying De Morgan incorrectly to quantifiers

CommonFORMULA

De Morgan's laws for sets/logic and quantifier negation rules are related but distinct. Students mix them up.

Why: The pattern is similar (negate and swap), but quantifier negation swaps 'for all' with 'there exists', not AND/OR.

WRONG:

\sim(\forall x, P(x)) = \forall x, \sim P(x)

(did not swap the quantifier)

RIGHT:

\sim(\forall x, P(x)) = \exists x, \sim P(x)

. Swap the quantifier, then negate the predicate.

See pattern: Quantifier Problems →

Wrong or missing base case in induction

OccasionalCASE MISS

Mathematical induction requires verifying the base case (usually n = 1). Skipping it or verifying the wrong base case invalidates the proof.

Why: Students rush to the inductive step, considering the base case trivial. Or they start induction at n = 0 when the statement is for n >= 1.

WRONG: Proving P(n) for n >= 1 but verifying P(0) as base case, or skipping the base case entirely

RIGHT: Always verify P(1) (or whatever the first value in the domain is). The inductive step alone proves nothing without a valid base case.

See pattern: Proof by Induction →

Test yourself

Can you spot these traps under time pressure?

Take a timed quiz on Mathematical Reasoning and see if you avoid the mistakes above.