RankRizz
JEE MAIN 2022 · 29 JUL S1+4 / −1EASYTRANSCRIBED

JEE Main 2022 Mathematics question — Logical connectives, truth tables and tautologies

The statement (p∧q)⇒(p∧r)(p \wedge q) \Rightarrow (p \wedge r) is equivalent to

SOLUTION

We need to determine which statement is equivalent to (p∧q)⇒(p∧r)(p \wedge q) \Rightarrow (p \wedge r).

We begin by rewriting the implication using the identity A⇒B≡¬A∨BA \Rightarrow B \equiv \neg A \vee B. We have (p∧q)⇒(p∧r)≡¬(p∧q)∨(p∧r)≡(¬p∨¬q)∨(p∧r)(p \wedge q) \Rightarrow (p \wedge r) \equiv \neg(p \wedge q) \vee (p \wedge r) \equiv (\neg p \vee \neg q) \vee (p \wedge r).

Now let us examine Option D: (p∧q)⇒r≡¬(p∧q)∨r≡(¬p∨¬q)∨r(p \wedge q) \Rightarrow r \equiv \neg(p \wedge q) \vee r \equiv (\neg p \vee \neg q) \vee r.

We claim these two expressions are logically equivalent. To verify, we check all cases based on pp.

Case 1: If pp is false, then ¬p\neg p is true, so both (¬p∨¬q)∨(p∧r)(\neg p \vee \neg q) \vee (p \wedge r) and (¬p∨¬q)∨r(\neg p \vee \neg q) \vee r evaluate to true regardless of qq and rr.

Case 2: If pp is true and qq is false, then ¬q\neg q is true, so both expressions again evaluate to true.

Case 3: If pp is true and qq is true, then ¬p∨¬q=false\neg p \vee \neg q = \text{false}. The first expression becomes (p∧r)=r(p \wedge r) = r (since pp is true), and the second becomes simply rr. Hence both equal rr.

In every case the two expressions agree, confirming that (p∧q)⇒(p∧r)≡(p∧q)⇒r(p \wedge q) \Rightarrow (p \wedge r) \equiv (p \wedge q) \Rightarrow r.

Hence, the correct answer is Option D.

Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicLogical connectives, truth tables and tautologies
TypeMultiple choice