JEE WhatsApp Group
Mathematical Reasoning JEE Notes
The chapter tests your ability to translate everyday language into formal logic and decide the truth value of compound statements. Most questions in JEE Main are single correct MCQs or numerical value types, typically taking under one minute if you know the truth tables cold. The topics are:
- Statements, truth values and basic logical operations (AND, OR, NOT)
- Implication, converse, inverse, contrapositive
- Biconditional statements, necessary & sufficient conditions
- Quantifiers – universal and existential
- Validating arguments with truth tables and counter-examples
After this overview, you will find detailed concept clusters, a formula sheet, quick-revision pointers, a worked JEE pattern example, and FAQs. Use these notes along with JEE Mains Online Coaching sessions and practice packs for the best results.
Statements, Truth Values and Logical Operations
Mathematical Statements
A statement (proposition) is a declarative sentence that is either true ($$T$$) or false ($$F$$) but not both.
- “2 is a prime number” ⇒ $$T$$
- “x + 3 = 10” ⇒ not a statement until x is specified
Truth Tables of Basic Connectives
| p | q | $$p\land q$$ (AND) | $$p\lor q$$ (OR) | $$\neg p$$ (NOT) |
|---|---|---|---|---|
| T | T | T | T | F |
| T | F | F | T | F |
| F | T | F | T | T |
| F | F | F | F | T |
Tautology, Contradiction, Contingency
- Tautology: always true (e.g., $$p\lor \neg p$$)
- Contradiction: always false (e.g., $$p\land\neg p$$)
- Contingency: true for some valuations, false for others
Algebra of Statements
- Commutative laws: $$p\land q = q\land p$$ ; $$p\lor q = q\lor p$$
- Distributive laws: $$p\land(q\lor r) = (p\land q)\lor(p\land r)$$
- De Morgan’s laws: $$\neg(p\land q)=\neg p\lor \neg q$$ ; $$\neg(p\lor q)=\neg p\land \neg q$$
Implications, Contrapositive and Quantifiers
Conditional Statement
Implication $$p\rightarrow q$$ reads “if p then q”. It is false only when p is true and q is false.
| p | q | $$p\rightarrow q$$ |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
Converse, Inverse, Contrapositive
- Converse: $$q\rightarrow p$$
- Inverse: $$\neg p\rightarrow \neg q$$
- Contrapositive: $$\neg q\rightarrow \neg p$$ (always logically equivalent to original statement)
Biconditional Statement
$$p\leftrightarrow q$$ (p “iff” q) is true when both p and q have same truth value. Equivalent to $$(p\rightarrow q)\land (q\rightarrow p)$$.
Quantifiers
- Universal: “for all” (symbol $$\forall$$). Example: $$\forall x\in\Bbb R,\;x^2\ge 0$$
- Existential: “there exists” (symbol $$\exists$$). Example: $$\exists x\in\Bbb N,\;x^2=16$$
Negation rules: $$\neg (\forall x\,P(x)) \equiv \exists x\,\neg P(x)$$ and vice versa.
Validity of Arguments
An argument is valid if the compound statement formed by premises leading to the conclusion is a tautology. JEE sometimes asks to pick the correct conclusion or to check validity using truth tables.
Worked JEE-Style Example
Question: Let p: “x is a rational number” and q: “x is an integer”. What is the truth value of the statement “If x is rational then x is integer” when (i) $$x=3$$ (ii) $$x=\sqrt2$$?
Solution:
- x = 3: p = T, q = T ⇒ $$p\rightarrow q = T$$
- x = √2: p = F (irrational), q = F ⇒ $$p\rightarrow q = T$$ (because implication with false antecedent is true)
Hence the statement is true for both values of x.
Important Formulas and Results at a Glance
| Result | Meaning / Use |
|---|---|
| $$\neg(p\lor q)=\neg p\land \neg q$$ | De Morgan’s law – simplifies negations |
| $$p\rightarrow q\equiv \neg p\lor q$$ | Convert implication to OR form for quick truth evaluation |
| $$p\leftrightarrow q\equiv (p\land q)\lor(\neg p\land \neg q)$$ | Useful for counting true cases |
| $$p\rightarrow q$$ is equivalent to $$\neg q\rightarrow \neg p$$ | Contrapositive equivalence |
| Negation of $$\forall x\,P(x)$$ is $$\exists x\,\neg P(x)$$ | Standard quantifier rule – heavily tested |
| Tautology test: compound statement evaluates to T for all possibilities | Checks validity of arguments |
JEE Important Points, Common Mistakes and Quick Revision
Important Points
- Expect 4 marks; occasionally two separate 2-mark questions appear in JEE Advanced.
- Contrapositive equivalence is a favourite trap – remember converse and inverse are not equivalent.
- Solve at least 50 mixed problems from JEE Questions library to internalise truth tables.
- Time per question should stay under 60 s; practice with a timer in JEE Mains Mock Test.
Common Mistakes
- Assuming “if and only if” is same as “if” – it is stronger, requires both directions.
- Thinking $$p\rightarrow q$$ is false when p is false – recall only T→F yields false.
- Negating statements with quantifiers without flipping $$\forall/\exists$$.
- Conflating “or” in English (exclusive) with logical OR (inclusive).
Quick Revision Checklist
- Write the basic truth tables twice from memory.
- List De Morgan’s laws and implication equivalence.
- Solve 5 past questions from JEE Mains Previous Papers and 2 from JEE Advanced Previous Papers.
Mathematical Reasoning JEE Notes: Conclusion
Mathematical Reasoning becomes easier when you understand how statements and logical relationships work instead of simply memorising rules. These Mathematical Reasoning JEE Notes cover the essential concepts, including truth values, logical operations, implications, converse, inverse, contrapositive, biconditional statements, quantifiers and argument validity. Truth tables remain the most reliable method for checking compound statements and avoiding errors.
During revision, pay particular attention to De Morgan’s laws, implication-based statements, quantifier negations and the difference between converse and contrapositive. Practise translating ordinary sentences into logical statements and identifying the conditions under which they are true or false. Solving JEE-level questions, previous-year papers and timed mock tests will strengthen conceptual clarity, improve accuracy and help you handle reasoning-based questions more confidently in the examination.
.webp)
