JEE Maths›Mathematical Reasoning›Question Types

Mathematical Reasoning - How It Appears in JEE

8 recurring patterns. Learn the pattern, recognize it in 5 seconds, apply the right approach.

Write the Negation

Pattern

Find the negation of a given statement or compound statement

How to recognize

Asks for negation, contradictory statement, or 'which is NOT true'

→ Apply De Morgan's laws for compound statements. For quantified statements, swap the quantifier and negate the predicate. For conditionals, use ~(p -> q) = p AND ~q.

Identify Connective Type

Pattern

Determine the logical connective used in a compound statement

How to recognize

Asks to identify whether a statement uses AND, OR, IF-THEN, or IFF

→ Look for keywords: 'and' (conjunction), 'or' (disjunction), 'if...then' (conditional), 'if and only if' (biconditional). Be careful with everyday language vs logical meaning.

Find Truth Value

Pattern

Determine whether a given statement or compound statement is true or false

How to recognize

Given specific values or conditions, asks for truth value of a statement

→ Evaluate each component statement first, then apply the connective's truth table. For conditionals, remember: F -> anything is true.

Contrapositive / Converse / Inverse

Pattern

Find the contrapositive, converse, or inverse of a conditional statement

How to recognize

Asks for contrapositive (~q -> ~p), converse (q -> p), or inverse (~p -> ~q)

→ Contrapositive: negate both and swap (logically equivalent to original). Converse: just swap p and q. Inverse: negate both without swapping.

Determine Validity / Equivalence

Pattern

Check if two statements are logically equivalent or if an argument is valid

How to recognize

Asks whether statements are equivalent, tautology, contradiction, or contingency

→ Build truth tables for both statements. They are equivalent if they have identical truth values in every row. A tautology is always true; a contradiction is always false.

Quantifier Problems

Pattern

Work with universally or existentially quantified statements

How to recognize

Contains 'for all', 'for every', 'there exists', 'for some'

→ For negation: swap quantifier and negate predicate. For truth value: universal requires checking ALL cases; existential requires finding ONE example.

Truth Table Construction

Pattern

Build or interpret a truth table for a compound statement

How to recognize

Asks to construct a truth table or identify rows where a compound statement is true/false

→ List all combinations of T/F for component statements. Evaluate step by step using connective definitions. For n variables, the table has 2^n rows.

Proof by Induction

Pattern

Prove a statement for all natural numbers using mathematical induction

How to recognize

Asks to prove P(n) for all n, or identify errors in an induction proof

→ Step 1: Verify base case P(1). Step 2: Assume P(k) is true (induction hypothesis). Step 3: Prove P(k+1) using the hypothesis. Common targets: divisibility, inequalities, summation formulas.