RankRizz
JEE MAIN 2021 · 25 JUL S1+4 / −1MEDIUMTRANSCRIBED

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

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

SOLUTION

We have to simplify the Boolean expression (p⇒q)  ∧  (q⇒∼p) .(p \Rightarrow q)\;\wedge\; (q \Rightarrow \sim p)\,.

First, recall the standard logical equivalence for an implication. The implication formula states:

a⇒b  ≡  ∼a ∨ b.a \Rightarrow b \;\equiv\; \sim a \,\vee\, b.

Applying this to each implication in our expression, we replace the arrows by disjunctions:

For the first part, p⇒q≡∼p∨q.p \Rightarrow q \equiv \sim p \vee q.

For the second part, q⇒∼p≡∼q∨∼p.q \Rightarrow \sim p \equiv \sim q \vee \sim p.

Substituting these two results back into the original conjunction, we obtain

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

Now we notice that both disjunctions contain the common literal ∼p.\sim p. To combine the two clauses, we use the distributive law of Boolean algebra, which says

(A∨B)  ∧  (A∨C)  =  A  ∨  (B∧C).(A \vee B)\;\wedge\;(A \vee C)\;=\;A \;\vee\;(B \wedge C).

Here, we match the symbols as follows:

A=∼p,B=q,C=∼q.A = \sim p,\quad B = q,\quad C = \sim q.

Substituting into the distributive formula, we get

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

The expression q∧∼qq \wedge \sim q is always false, because a statement and its negation can never be true at the same time. Hence

q∧∼q=False.q \wedge \sim q = \text{False}.

Therefore, our entire expression simplifies to

∼p  ∨  False  =  ∼p.\sim p \;\vee\; \text{False} \;=\; \sim p.

So the Boolean expression (p⇒q)∧(q⇒∼p)(p \Rightarrow q) \wedge (q \Rightarrow \sim p) is logically equivalent to ∼p.\sim p.

Looking at the given options, ∼p\sim p appears as Option D.

Hence, the correct answer is Option D.

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