RankRizz
JEE MAIN 2019 · 10 APR S2+4 / −1EASYTRANSCRIBED

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

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

SOLUTION

We begin with the Boolean expression whose negation we must find:

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

Our objective is to compute its logical negation, that is, to evaluate

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

First, we invoke De Morgan’s law for the negation of a disjunction, which states:

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

Here, we identify A=∼sA = \sim s and B=(∼r  ∧  s).B = (\sim r \;\wedge\; s). Applying the law gives

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

Now, ∼(∼s)\sim(\sim s) is simply s,s, because a double negation cancels itself. Substituting, we have

s  ∧  (∼(∼r  ∧  s)).s \;\wedge\; \bigl(\sim(\sim r \;\wedge\; s)\bigr).

Next, we must simplify ∼(∼r  ∧  s).\sim(\sim r \;\wedge\; s). We again use De Morgan’s law, this time for the negation of a conjunction:

∼(C  ∧  D)  =  (∼C)  ∨  (∼D).\sim(C \;\wedge\; D) \;=\; (\sim C) \;\vee\; (\sim D).

Here, C=∼rC = \sim r and D=s.D = s. Therefore,

∼(∼r  ∧  s)  =  (∼(∼r))  ∨  (∼s).\sim(\sim r \;\wedge\; s) \;=\; \bigl(\sim(\sim r)\bigr) \;\vee\; (\sim s).

The term ∼(∼r)\sim(\sim r) simplifies to r.r. Hence,

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

Substituting this back, the overall negation becomes

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

We now distribute ss over the disjunction r  ∨  (∼s).r \;\vee\; (\sim s). The distributive law of Boolean algebra tells us

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

Taking X=s,  Y=r,  Z=∼s,X = s, \; Y = r, \; Z = \sim s, we obtain

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

The term s  ∧  (∼s)s \;\wedge\; (\sim s) is always false (it equals 00) because a proposition cannot be simultaneously true and false. Hence that term vanishes, leaving

s  ∧  r.s \;\wedge\; r.

We have therefore shown that the negation of the original expression simplifies to s∧r,s \wedge r, which is exactly Option 2.

Hence, the correct answer is Option 2.

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