RankRizz
JEE MAIN 2022 · 29 JUN S2+4 / −1EASYTRANSCRIBED

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

Negation of the Boolean statement (p∨q)⇒((∼r)∨p)(p \vee q) \Rightarrow ((\sim r) \vee p) is equivalent to:

SOLUTION

We need to find the negation of (p∨q)⇒((∼r)∨p)(p \vee q) \Rightarrow ((\sim r) \vee p). The negation of A⇒BA \Rightarrow B is A∧(∼B)A \wedge (\sim B). Here A=(p∨q)A = (p \vee q) and B=((∼r)∨p)B = ((\sim r) \vee p), so its negation is (p∨q)∧∼((∼r)∨p)(p \vee q) \wedge \sim((\sim r) \vee p).

By De Morgan's law, ∼((∼r)∨p)=r∧(∼p)\sim((\sim r) \vee p) = r \wedge (\sim p), therefore the expression becomes (p∨q)∧r∧(∼p)(p \vee q) \wedge r \wedge (\sim p). Since ∼p\sim p holds, (p∨q)∧(∼p)(p \vee q) \wedge (\sim p) simplifies to q∧(∼p)q \wedge (\sim p), giving (∼p)∧q∧r(\sim p) \wedge q \wedge r.

Therefore, the answer is Option C: (∼p)∧q∧r(\sim p) \wedge q \wedge r.

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