RankRizz
JEE MAIN 2023 · 06 APR S2+4 / −1MEDIUMTRANSCRIBED

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

Among the statements
(S1): (p⇒q)∨((∼p)∧q)(p \Rightarrow q) \lor ((\sim p) \wedge q) is a tautology
(S2): (q⇒p)⇒((∼p)∧q)(q \Rightarrow p) \Rightarrow ((\sim p) \wedge q) is a contradiction

SOLUTION

We begin by determining which of the two statements is true.

First consider the expression (p⇒q)∨(¬p∧q)(p \Rightarrow q) \lor (\lnot p \wedge q) and check whether it is a tautology. Recall that p⇒q≡¬p∨qp \Rightarrow q \equiv \lnot p \lor q. Hence

S1=(¬p∨q)∨(¬p∧q)=¬p∨qS1 = (\lnot p \lor q) \lor (\lnot p \wedge q) = \lnot p \lor q

since ¬p∧q\lnot p \wedge q is absorbed by ¬p∨q\lnot p \lor q. Testing p=T,q=Fp = T, q = F gives ¬T∨F=F\lnot T \lor F = F, so this expression is not always true and therefore S1 fails to be a tautology.

Next examine the expression (q⇒p)⇒(¬p∧q)(q \Rightarrow p) \Rightarrow (\lnot p \wedge q) to see if it is a contradiction. Noting that q⇒p≡¬q∨pq \Rightarrow p \equiv \lnot q \lor p, we find

S2=¬(¬q∨p)∨(¬p∧q)=(q∧¬p)∨(¬p∧q)=¬p∧qS2 = \lnot(\lnot q \lor p) \lor (\lnot p \wedge q) = (q \wedge \lnot p) \lor (\lnot p \wedge q) = \lnot p \wedge q

and testing p=F,q=Tp = F, q = T yields ¬F∧T=T\lnot F \wedge T = T. Since the expression can be true, S2 is not a contradiction.

For completeness, the following truth table verifies the values of S1 and S2 under all assignments of pp and qq:

ppqqS1 expressionS2 expression
TTTF
TFFF
FTTT
FFTF

Since S1 is not a tautology (it fails when p=T,q=Fp = T, q = F) and S2 is not a contradiction (it holds when p=F,q=Tp = F, q = T), neither statement is true.

The correct answer is Option A: Neither (S1) nor (S2) is True.

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