RankRizz
JEE MAIN 2019 · 09 APR S1+4 / −1EASYTRANSCRIBED

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

For any two statement pp and qq, the negative of the expression p∨(∼p∧q)p \lor (\sim p \land q) is:

SOLUTION

We begin with the given propositional expression

E  =  p ∨ (∼p ∧ q).E \;=\; p \,\lor\, (\sim p \,\land\, q).

Our task is to find the negation ∼E\sim E and then match it with the choices. To do this comfortably, it is convenient first to simplify EE itself.

We recall the distributive law of propositional logic, stated as

A ∨ (B ∧ C)  =  (A ∨ B) ∧ (A ∨ C).A \,\lor\, (B \,\land\, C)\;=\; (A \,\lor\, B)\,\land\,(A \,\lor\, C).

Comparing, we see A=p,  B=∼p,  C=q.A = p,\; B = \sim p,\; C = q. Substituting we obtain

p ∨ (∼p ∧ q)  =  (p ∨ ∼p) ∧ (p ∨ q).p \,\lor\, (\sim p \,\land\, q) \;=\; (p \,\lor\, \sim p)\,\land\,(p \,\lor\, q).

Now, for any statement pp, the expression p ∨ ∼pp \,\lor\, \sim p is always true; it is a tautology. We may therefore replace it by the propositional constant T (True):

(p ∨ ∼p) ∧ (p ∨ q)  =  T ∧ (p ∨ q).(p \,\lor\, \sim p)\,\land\,(p \,\lor\, q) \;=\; \text{T}\,\land\,(p \,\lor\, q).

The conjunction of a tautology with any statement leaves that statement unchanged, because T acts like the multiplicative identity in logic. Hence

E  =  p ∨ q.E \;=\; p \,\lor\, q.

Having reduced the original expression to p∨q,p \lor q, we now negate it. For this we invoke De Morgan’s law, which states

∼(A ∨ B)  =  ∼A ∧ ∼B.\sim(A \,\lor\, B) \;=\; \sim A \,\land\, \sim B.

Applying the law directly with A=pA = p and B=q,B = q, we get

∼E  =  ∼(p ∨ q)  =  ∼p ∧ ∼q.\sim E \;=\; \sim(p \,\lor\, q) \;=\; \sim p \,\land\, \sim q.

This final form exactly matches Option C in the list.

Hence, the correct answer is Option C.

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