RankRizz
JEE MAIN 2021 · 27 AUG S2+4 / −1EASYTRANSCRIBED

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

The Boolean expression (p∧q)⇒((r∧q)∧p)(p \wedge q) \Rightarrow ((r \wedge q) \wedge p) is equivalent to:

SOLUTION

We have to simplify the statement (p∧q)  ⇒  ((r∧q)  ∧  p)  .(p \wedge q)\;\Rightarrow\;\bigl((r \wedge q)\;\wedge\;p\bigr)\;.

First recall the basic implication law:

A⇒B  ≡  ¬A ∨ B.A \Rightarrow B \;\equiv\; \neg A \,\vee\, B.

Before using the law, it is convenient to tidy up the right-hand conjunction. Because conjunction is both commutative and associative, we may rearrange the factors freely:

(r∧q)∧p  =  p∧q∧r.(r \wedge q) \wedge p \;=\; p \wedge q \wedge r.

So the whole expression becomes

(p∧q)  ⇒  (p∧q∧r).(p \wedge q)\;\Rightarrow\;(p \wedge q \wedge r).

Now set A=(p∧q),B=(p∧q∧r).A = (p \wedge q),\qquad B = (p \wedge q \wedge r). Applying the implication law we obtain

¬(p∧q)  ∨  (p∧q∧r).\neg(p \wedge q) \;\vee\; (p \wedge q \wedge r).

Next, use De Morgan’s rule for the negation of a conjunction:

¬(p∧q)  =  ¬p  ∨  ¬q.\neg(p \wedge q) \;=\; \neg p \;\vee\; \neg q.

Substituting this result we have

(¬p  ∨  ¬q)  ∨  (p∧q∧r).(\neg p \;\vee\; \neg q) \;\vee\; (p \wedge q \wedge r).

The disjunction symbol “∨” is associative, so we can write the whole thing as

¬p  ∨  ¬q  ∨  (p∧q∧r).\neg p \;\vee\; \neg q \;\vee\; (p \wedge q \wedge r).

To see the final simplification clearly, break the analysis into the two possible truth-values of qq.

Case 1: qq is false. If qq is false, then ¬q\neg q is true, and the entire disjunction is automatically true. Therefore the expression is true irrespective of pp and rr.

Case 2: qq is true. If qq is true, the term ¬q\neg q becomes false, and the disjunction reduces to

¬p  ∨  (p∧r).\neg p \;\vee\; (p \wedge r).

Factor pp out of the second term:

¬p  ∨  (p∧r)  =  (¬p  ∨  p)∧(¬p  ∨  r)  =  T∧(¬p  ∨  r)  =  ¬p  ∨  r.\neg p \;\vee\; \bigl(p \wedge r\bigr) \;=\; (\neg p \;\vee\; p) \wedge (\neg p \;\vee\; r) \;=\; \text{T} \wedge (\neg p \;\vee\; r) \;=\; \neg p \;\vee\; r.

Hence, when qq is true, the original statement is equivalent to ¬p  ∨  r\neg p \;\vee\; r. Remembering that qq itself is true in this case, ¬p  ∨  r≡¬p  ∨  (r∧q).\neg p \;\vee\; r \quad\equiv\quad \neg p \;\vee\; (r \wedge q). (The factor qq can be inserted because qq is already true and r∧qr \wedge q therefore has the same truth value as rr.)

Combining both cases, we can write the simplified form valid for all truth-values of p,q,rp,q,r as

¬p  ∨  ¬q  ∨  (r∧q).\neg p \;\vee\; \neg q \;\vee\; (r \wedge q).

Finally recognise this again as an implication, with antecedent (p∧q)(p \wedge q) and consequent (r∧q)(r \wedge q):

¬(p∧q)  ∨  (r∧q)  ≡  (p∧q)⇒(r∧q).\neg(p \wedge q) \;\vee\; (r \wedge q) \;\equiv\; (p \wedge q) \Rightarrow (r \wedge q).

Thus the original Boolean expression is logically equivalent to (p∧q)⇒(r∧q).(p \wedge q) \Rightarrow (r \wedge q).

Comparing with the given options, this matches Option C.

Hence, the correct answer is Option C.

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