RankRizz
JEE MAIN 2019 · 09 JAN S2+4 / −1EASYTRANSCRIBED

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

The logical statement [∼(∼p∨q)∨(p∧r)]∧(∼q∧r)[\sim(\sim p \vee q) \vee (p \wedge r)] \wedge (\sim q \wedge r) is equivalent to:

SOLUTION

We have to simplify the statement [∼(∼p∨q)∨(p∧r)]∧(∼q∧r).[\sim(\sim p \vee q) \vee (p \wedge r)] \wedge (\sim q \wedge r).

First recall De Morgan’s law, which states ∼(A∨B)≡(∼A)∧(∼B).\sim(A \vee B)\equiv (\sim A)\wedge(\sim B). Applying this with A=∼pA=\sim p and B=q,B=q, we obtain

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

Substituting this result back, the expression becomes

[(p∧∼q)∨(p∧r)]∧(∼q∧r).[(p \wedge \sim q) \vee (p \wedge r)] \wedge (\sim q \wedge r).

Now we focus on the disjunction inside the first bracket. Taking out the common factor p,p, we use the distributive law X∧Y ∨ X∧Z≡X∧(Y∨Z).X\wedge Y \,\vee\, X\wedge Z \equiv X\wedge(Y\vee Z). Thus,

(p∧∼q)∨(p∧r)≡p∧(∼q∨r).(p \wedge \sim q) \vee (p \wedge r)\equiv p \wedge (\sim q \vee r).

Hence the whole statement is now

[p∧(∼q∨r)]∧(∼q∧r).\bigl[p \wedge (\sim q \vee r)\bigr] \wedge (\sim q \wedge r).

The connective ∧\wedge is associative and commutative, so we can rearrange terms without changing truth-value:

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

Observe that the factor ∼q∧r\sim q \wedge r already guarantees both ∼q\sim q and rr are true, and whenever these two are true, the disjunction ∼q∨r\sim q \vee r is automatically true. Consequently the extra factor ∼q∨r\sim q \vee r is redundant inside the conjunction. Formally,

(∼q∧r) ∧ (∼q∨r) ≡ ∼q∧r.\bigl(\sim q \wedge r\bigr)\ \wedge\ (\sim q \vee r)\ \equiv\ \sim q \wedge r.

So the expression simplifies further to

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

Finally we may write this in the same order as option B:

(p∧r)∧∼q.(p \wedge r) \wedge \sim q.

This is exactly the statement given in 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