RankRizz
JEE MAIN 2020 · 06 SEP S1+4 / −1EASYTRANSCRIBED

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

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

SOLUTION

We are asked to find the negation of the Boolean expression p∨(∼p∧q)p \vee (\sim p \wedge q) and then match the simplified result with one of the given options.

First we write the required negation explicitly:

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

We recall De Morgan’s first law, which states that for any two propositions AA and BB, the negation of their disjunction is

¬(A∨B)=¬A∧¬B.\neg(A \vee B)=\neg A \wedge \neg B.

In our expression, we can treat AA as pp and BB as (∼p∧q)(\sim p \wedge q). Applying the law we get

¬[p∨(∼p∧q)]  =  (¬p)  ∧  ¬( ∼p∧q ).\neg\bigl[p \vee (\sim p \wedge q)\bigr] \;=\; \bigl(\neg p\bigr) \;\wedge\; \neg\bigl(\,\sim p \wedge q\,\bigr).

Now we turn to the second negation inside. Again, by De Morgan’s second law, which says

¬(X∧Y)=¬X∨¬Y,\neg(X \wedge Y)=\neg X \vee \neg Y,

we let X=∼pX=\sim p and Y=qY=q. Thus

¬( ∼p∧q )=¬(∼p)  ∨  ¬q.\neg\bigl(\,\sim p \wedge q\,\bigr)=\neg(\sim p) \;\vee\; \neg q.

The double negation rule ¬(∼p)=p\neg(\sim p)=p simplifies the first term, so we have

¬( ∼p∧q )=p  ∨  ¬q.\neg\bigl(\,\sim p \wedge q\,\bigr)=p \;\vee\; \neg q.

Substituting this back into the earlier expression yields

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

We now use the distributive law of conjunction over disjunction, namely

X∧(Y∨Z)=(X∧Y)∨(X∧Z).X \wedge (Y \vee Z) = (X \wedge Y) \vee (X \wedge Z).

Here X=¬p,X=\neg p, Y=p,Y=p, and Z=¬q.Z=\neg q. Distributing gives

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

Observing that ¬p∧p\neg p \wedge p is always false (a contradiction), we replace it by the constant false value, traditionally denoted by 00. Since 0∨0 \vee (anything) is just that “anything,” the expression simplifies to

¬p∧¬q.\neg p \wedge \neg q.

Thus the negation of p∨(∼p∧q)p \vee (\sim p \wedge q) is exactly ∼p∧∼q\sim p \wedge \sim q, which corresponds to 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