RankRizz
JEE MAIN 2015 · 04 APR OFFLINE+4 / −1EASYTRANSCRIBED

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

The negation of ∼s∨(∼r∧s)\sim s \vee (\sim r \wedge s) is equivalent to

SOLUTION

We want the negation of the statement ∼s∨(∼r∧s)\sim s \vee (\sim r \wedge s). In symbols we therefore start with

¬( ∼s  ∨  (∼r∧s)).\neg\bigl(\,\sim s \;\vee\; (\sim r \wedge s)\bigr).

First recall De Morgan’s law for two statements: ¬(A∨B)=¬A  ∧  ¬B.\neg(A\vee B)=\neg A\;\wedge\;\neg B. Here we may identify

A=∼s,B=(∼r∧s).A=\sim s,\qquad B=(\sim r\wedge s).

Applying the law gives

¬(∼s∨(∼r∧s))=¬(∼s)  ∧  ¬(∼r∧s).\neg(\sim s\vee(\sim r\wedge s))=\neg(\sim s)\;\wedge\;\neg(\sim r\wedge s).

The first part simplifies directly because double negation cancels:

¬(∼s)=s.\neg(\sim s)=s.

So we now have

s  ∧  ¬(∼r∧s).s\;\wedge\;\neg(\sim r\wedge s).

We still need to simplify the second negation. Again, by De Morgan’s law, but this time for a conjunction, ¬(A∧B)=¬A  ∨  ¬B.\neg(A\wedge B)=\neg A\;\vee\;\neg B. Taking

A=∼r,B=s,A=\sim r,\qquad B=s,

we get

¬(∼r∧s)=¬(∼r)  ∨  ¬s.\neg(\sim r\wedge s)=\neg(\sim r)\;\vee\;\neg s.

Double negation on the first term yields

¬(∼r)=r.\neg(\sim r)=r.

Thus

¬(∼r∧s)=r  ∨  ¬s.\neg(\sim r\wedge s)=r\;\vee\;\neg s.

Substituting this back, our whole expression is now

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

Next, we distribute the conjunction over the disjunction using the distributive law P∧(Q∨R)=(P∧Q)  ∨  (P∧R).P\wedge(Q\vee R)=(P\wedge Q)\;\vee\;(P\wedge R). Here P=s,  Q=r,  R=¬s,P=s,\;Q=r,\;R=\neg s, so we obtain

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

However, s∧¬ss\wedge\neg s is a contradiction and always evaluates to false, so that term can be dropped:

(s∧r)  ∨  false=s∧r.(s\wedge r)\;\vee\;\text{false}=s\wedge r.

We have therefore shown

¬( ∼s∨(∼r∧s))≡s∧r.\neg\bigl(\,\sim s \vee (\sim r \wedge s)\bigr)\equiv s\wedge r.

Hence, the correct answer is Option A.

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