RankRizz
JEE MAIN 2019 · 12 JAN S1+4 / −1MEDIUMTRANSCRIBED

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

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

SOLUTION

We have to simplify the Boolean expression ((p∧q)∨(p∨∼q))∧(∼p∧∼q).\bigl((p \wedge q) \vee (p \vee \sim q)\bigr) \wedge (\sim p \wedge \sim q). Throughout, we shall use the well-known Boolean identities: (i) Absorption Law X∨(X∧Y)=X,X \vee (X \wedge Y)=X, (ii) Distributive Law A∧(B∨C)=(A∧B)  ∨  (A∧C),A \wedge (B \vee C)= (A \wedge B)\; \vee\; (A \wedge C), (iii) Idempotent Law Z∧Z=Z,Z \wedge Z=Z, and (iv) the fact that any statement conjoined with its negation is false, R∧(∼R)=0.R \wedge (\sim R)=0.

First concentrate on the part (p∧q)∨(p∨∼q).(p \wedge q) \vee (p \vee \sim q). In order to apply the absorption law, we re-express (p∧q)(p \wedge q) in a form that visibly contains (p∨∼q).(p \vee \sim q). Observe that

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

Because ∼q∧q=0,\sim q \wedge q = 0, the right-hand side reduces to p∧q.p \wedge q. Thus we have shown

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

Letting X=(p∨∼q)andY=q,X = (p \vee \sim q) \quad\text{and}\quad Y = q, we may rewrite the first bracket as (X∧Y)∨X.(X \wedge Y) \vee X. Now, by the absorption law, (X∧Y)∨X=X.(X \wedge Y) \vee X = X. Therefore

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

Substituting this back, the whole expression becomes

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

Using associativity and commutativity of ∧,\wedge, we group as

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

Now apply the distributive law with A=(∼p∧∼q),  B=p,  C=∼q:A = (\sim p \wedge \sim q),\; B = p,\; C = \sim q:

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

Simplify each part step by step. In the first term, ∼p∧p=0,\sim p \wedge p = 0, so

∼p∧∼q∧p=0∧∼q=0.\sim p \wedge \sim q \wedge p = 0 \wedge \sim q = 0.

In the second term, the idempotent law gives ∼q∧∼q=∼q,\sim q \wedge \sim q = \sim q, therefore

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

Hence the entire expression reduces to

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

Thus the simplified (and therefore equivalent) Boolean expression is (∼p)∧(∼q).(\sim p) \wedge (\sim q). This matches 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