RankRizz
JEE MAIN 2023 · 12 APR S1+4 / −1EASYTRANSCRIBED

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

Among the two statements
(S1):(p⇒q)∧(p∧(∼q))(S_1) : (p \Rightarrow q) \wedge (p \wedge (\sim q)) is a contradiction and
(S2):(p∧q)∨((∼p)∧q)∨(p∧(∼q))∨((∼p)∧(∼q))(S_2) : (p \wedge q) \vee ((\sim p) \wedge q) \vee (p \wedge (\sim q)) \vee ((\sim p) \wedge (\sim q)) is a tautology

SOLUTION

We need to determine which of the statements S1S_1 and S2S_2 are true.

To analyze S1S_1, observe that (p⇒q)∧(p∧(∼q))(p \Rightarrow q) \wedge (p \wedge (\sim q)) is claimed to be a contradiction.

Recall that p⇒q≡(∼p)∨qp \Rightarrow q \equiv (\sim p) \vee q. Thus:

S1=((∼p)∨q)∧(p∧(∼q))S_1 = ((\sim p) \vee q) \wedge (p \wedge (\sim q))

=((∼p)∨q)∧p∧(∼q)= ((\sim p) \vee q) \wedge p \wedge (\sim q)

Distributing yields:

=((∼p)∧p∧(∼q))∨(q∧p∧(∼q))= ((\sim p) \wedge p \wedge (\sim q)) \vee (q \wedge p \wedge (\sim q))

Since (∼p)∧p=F(\sim p) \wedge p = F and q∧(∼q)=Fq \wedge (\sim q) = F, it follows that:

S1=F∨F=FS_1 = F \vee F = F

Thus, S1S_1 is always false, so it is a contradiction and the claim in S1S_1 is true.

Next, consider S2S_2, whose expression (p∧q)∨((∼p)∧q)∨(p∧(∼q))∨((∼p)∧(∼q))(p \wedge q) \vee ((\sim p) \wedge q) \vee (p \wedge (\sim q)) \vee ((\sim p) \wedge (\sim q)) is to be shown a tautology.

We can factor this expression as:

=q∧(p∨(∼p))∨(∼q)∧(p∨(∼p))= q \wedge (p \vee (\sim p)) \vee (\sim q) \wedge (p \vee (\sim p))

Since p∨(∼p)=Tp \vee (\sim p) = T, we obtain:

=(q∧T)∨((∼q)∧T)=q∨(∼q)=T= (q \wedge T) \vee ((\sim q) \wedge T) = q \vee (\sim q) = T

Hence, S2S_2 is always true, i.e., it is a tautology, and the claim in S2S_2 is true.

Since both S1S_1 and S2S_2 are true, the correct answer is Option D: both are 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