RankRizz
JEE MAIN 2021 · 01 SEP S2+4 / −1EASYTRANSCRIBED

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

Which of the following is equivalent to the Boolean expression p∧∼qp \wedge \sim q?

SOLUTION

We have to find an option whose logical value is always identical to the expression p∧∼qp \wedge \sim q. The expression p∧∼qp \wedge \sim q is true exactly when pp is true and qq is false, and false in every other situation. We shall translate each option into a form that can be compared directly with this conjunction.

First, we recall and state the fundamental implication law: for any statements xx and yy,

x→y  ≡  ∼x  ∨  y.x \rightarrow y \;\equiv\; \sim x \;\vee\; y.

Using this single law and ordinary De Morgan simplifications ∼(x∨y)=∼x∧∼y\sim(x \vee y)=\sim x \wedge \sim y and ∼(x∧y)=∼x∨∼y,\sim(x \wedge y)=\sim x \vee \sim y, we convert every option step by step.

Option A is ∼p→∼q\sim p \rightarrow \sim q. Applying the implication law with x=∼px=\sim p and y=∼qy=\sim q gives

∼p→∼q  ≡  ∼(∼p)  ∨  ∼q.\sim p \rightarrow \sim q \;\equiv\; \sim(\sim p) \;\vee\; \sim q.

Now ∼(∼p)=p\sim(\sim p)=p, so

∼p→∼q  ≡  p  ∨  ∼q.\sim p \rightarrow \sim q \;\equiv\; p \;\vee\; \sim q.

Thus Option A simplifies to p∨∼qp \vee \sim q, a disjunction, not the required conjunction p∧∼qp \wedge \sim q. Hence Option A is not equivalent.

Option B is ∼(q→p)\sim\bigl(q \rightarrow p\bigr). First write the inner implication:

q→p  ≡  ∼q  ∨  p.q \rightarrow p \;\equiv\; \sim q \;\vee\; p.

Substituting, we get

∼(q→p)  =  ∼(∼q  ∨  p).\sim\bigl(q \rightarrow p\bigr) \;=\; \sim\bigl(\sim q \;\vee\; p\bigr).

Using De Morgan’s law for negation of a disjunction,

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

Now ∼(∼q)=q,\sim(\sim q)=q, so

∼(q→p)  ≡  q  ∧  ∼p.\sim\bigl(q \rightarrow p\bigr) \;\equiv\; q \;\wedge\; \sim p.

This is the conjunction q∧∼p,q \wedge \sim p, which is different from p∧∼qp \wedge \sim q. Therefore Option B is also not equivalent.

Option C is ∼(p→q).\sim\bigl(p \rightarrow q\bigr). Again we expand the implication:

p→q  ≡  ∼p  ∨  q.p \rightarrow q \;\equiv\; \sim p \;\vee\; q.

Substituting gives

∼(p→q)  =  ∼(∼p  ∨  q).\sim\bigl(p \rightarrow q\bigr) \;=\; \sim\bigl(\sim p \;\vee\; q\bigr).

Using De Morgan’s law,

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

Simplifying ∼(∼p)=p,\sim(\sim p)=p, we obtain

∼(p→q)  ≡  p  ∧  ∼q.\sim\bigl(p \rightarrow q\bigr) \;\equiv\; p \;\wedge\; \sim q.

This is exactly the original expression we wanted. So Option C matches p∧∼qp \wedge \sim q perfectly.

Option D is ∼(p→∼q).\sim\bigl(p \rightarrow \sim q\bigr). Start with the implication:

p→∼q  ≡  ∼p  ∨  ∼q.p \rightarrow \sim q \;\equiv\; \sim p \;\vee\; \sim q.

Negating it,

∼(p→∼q)  =  ∼(∼p  ∨  ∼q).\sim\bigl(p \rightarrow \sim q\bigr) \;=\; \sim\bigl(\sim p \;\vee\; \sim q\bigr).

Applying De Morgan’s law,

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

This simplifies to

p  ∧  q.p \;\wedge\; q.

Since p∧qp \wedge q differs from p∧∼q,p \wedge \sim q, Option D is not equivalent.

Among all four options, only Option C reduces to p∧∼qp \wedge \sim q. Hence, the correct answer is Option 3.

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