RankRizz
JEE MAIN 2018 · 08 APR OFFLINE+4 / −1TRANSCRIBED

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

The Boolean expression ∼(p∨q)∨(∼p∧q)\sim(p \vee q) \vee (\sim p \wedge q) is equivalent to:

SOLUTION

We are given the Boolean expression ∼(p∨q)∨(∼p∧q)\sim(p \vee q) \vee (\sim p \wedge q) and we must find an equivalent, simpler form.

First recall De Morgan’s law, which states that ∼(A∨B)=∼A∧∼B.\sim (A \vee B)=\sim A \wedge \sim B.

Applying this law to the first part, we have:

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

Substituting this result into the original expression, we get

(∼p∧∼q)    ∨    (∼p∧q).\bigl(\sim p \wedge \sim q\bigr)\;\; \vee \;\;(\sim p \wedge q).

Now observe that ∼p\sim p is common in both terms of the disjunction. Using the distributive law A∧B    ∨    A∧C=A∧(B∨C),A\wedge B \;\; \vee \;\; A\wedge C = A\wedge (B\vee C), we factor out ∼p\sim p:

(∼p∧∼q)    ∨    (∼p∧q)=∼p∧( ∼q∨q).\bigl(\sim p \wedge \sim q\bigr)\;\; \vee \;\;(\sim p \wedge q) = \sim p \wedge \bigl(\,\sim q \vee q\bigr).

Inside the parentheses we have ∼q∨q,\sim q \vee q, which is always true (a tautology). Denote the Boolean constant “true” by TT. Hence

∼q∨q=T.\sim q \vee q = T.

Substituting this back, we obtain

∼p∧T.\sim p \wedge T.

In Boolean algebra, any proposition ANDed with TT remains unchanged, so

∼p∧T=∼p.\sim p \wedge T = \sim p.

Thus, the original expression simplifies completely to ∼p.\sim p.

Looking at the given options, ∼p\sim p corresponds to Option B.

Hence, the correct answer is Option B.

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