RankRizz
JEE MAIN 2023 · 24 JAN S1+4 / −1MEDIUMTRANSCRIBED

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

The compound statement (∼(P∧Q))∨((∼P)∧Q)⇒((∼P)∧(∼Q))(\sim(P \wedge Q)) \vee ((\sim P) \wedge Q) \Rightarrow ((\sim P) \wedge (\sim Q)) is equivalent to

SOLUTION

The compound statement (∼(P∧Q))∨((∼P)∧Q)⇒((∼P)∧(∼Q))(\sim(P \wedge Q)) \vee ((\sim P) \wedge Q) \Rightarrow ((\sim P) \wedge (\sim Q)) is equivalent to what?

By De Morgan's law, ∼(P∧Q)=∼P∨∼Q\sim(P \wedge Q) = \sim P \vee \sim Q, so the antecedent becomes (∼P∨∼Q)∨(∼P∧Q).(\sim P \vee \sim Q) \vee (\sim P \wedge Q).

Let A=∼P,B=∼QA = \sim P, B = \sim Q. Then the antecedent is (A∨B)∨(A∧∼B).(A \vee B) \vee (A \wedge \sim B). If A=TA = T, this expression is true regardless of BB. If A=FA = F, then (F∨B)∨(F∧∼B)=B∨F=B(F \vee B) \vee (F \wedge \sim B) = B \vee F = B. Hence the antecedent simplifies to A∨B=∼P∨∼QA \vee B = \sim P \vee \sim Q.

The full statement thus becomes (∼P∨∼Q)⇒(∼P∧∼Q)(\sim P \vee \sim Q) \Rightarrow (\sim P \wedge \sim Q). Using p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee q, this is ∼(∼P∨∼Q)∨(∼P∧∼Q)=(P∧Q)∨(∼P∧∼Q).\sim(\sim P \vee \sim Q) \vee (\sim P \wedge \sim Q) = (P \wedge Q) \vee (\sim P \wedge \sim Q).

This last expression is the biconditional P⇔Q=(∼P∨Q)∧(∼Q∨P).P \Leftrightarrow Q = (\sim P \vee Q) \wedge (\sim Q \vee P).

The correct answer is Option 1: ((∼P)∨Q)∧((∼Q)∨P)((\sim P) \vee Q) \wedge ((\sim Q) \vee P).

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