RankRizz
JEE MAIN 2021 · 24 FEB S2+4 / −1EASYTRANSCRIBED

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

The negation of the statement ∼p∧(p∨q)\sim p \wedge (p \vee q) is:

SOLUTION

We need to find the negation of ∼p∧(p∨q)\sim p \wedge (p \vee q).

Applying De Morgan's law, the negation is ∼(∼p)∨∼(p∨q)\sim(\sim p) \vee \sim(p \vee q), which simplifies to p∨(∼p∧∼q)p \vee (\sim p \wedge \sim q).

Now we apply the distributive law: p∨(∼p∧∼q)=(p∨∼p)∧(p∨∼q)p \vee (\sim p \wedge \sim q) = (p \vee \sim p) \wedge (p \vee \sim q).

Since p∨∼pp \vee \sim p is always true (a tautology), this reduces to T∧(p∨∼q)=p∨∼qT \wedge (p \vee \sim q) = p \vee \sim q.

Therefore, the negation of ∼p∧(p∨q)\sim p \wedge (p \vee q) is p∨∼qp \vee \sim q.

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